Submission #1400014


Source Code Expand

#include <bits/stdc++.h>
using namespace std;

int h, w, k;
string s[51];
bool f[51][51];

vector<pair<int, int> > make_piece(int y, int x, int l){
    vector<pair<int, int> > res;
    queue<pair<int, int> > q;
    q.push(pair<int, int>(y, x));
    
}

int main(){
	cin >> h >> w >> k;
	for(int i = 0; i < h; i++) cin >> s[i];
	vector<vector<pair<int, int> > > ans;
    vector<pair<int, int> > tmp;
    for(int i = 0; i < k; i++){
        tmp.push_back(pair<int, int>(0, i));
	}
    ans.push_back(tmp);
	int c = ans.size();
	cout << c << endl;
	for(int i = 0; i < c; i++){
		for(int j = 0; j < k; j++){
			cout << ans[i][j].first + 1 << " " << ans[i][j].second + 1 << endl;
		}
	}
}

Submission Info

Submission Time
Task A - Multiple Pieces
User treeone
Language C++14 (GCC 5.4.1)
Score 108
Code Size 712 Byte
Status AC
Exec Time 1 ms
Memory 256 KB

Judge Result

Set Name test_01 test_02 test_03 test_04 test_05 test_06 test_07 test_08 test_09 test_10
Score / Max Score 31 / 1343058 0 / 1343058 13 / 1343058 5 / 1343058 27 / 1343058 0 / 1343058 0 / 1343058 0 / 1343058 27 / 1343058 5 / 1343058
Status
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
AC × 1
Set Name Test Cases
test_01 subtask_01_01.txt
test_02 subtask_01_02.txt
test_03 subtask_01_03.txt
test_04 subtask_01_04.txt
test_05 subtask_01_05.txt
test_06 subtask_01_06.txt
test_07 subtask_01_07.txt
test_08 subtask_01_08.txt
test_09 subtask_01_09.txt
test_10 subtask_01_10.txt
Case Name Status Exec Time Memory
subtask_01_01.txt AC 1 ms 256 KB
subtask_01_02.txt AC 1 ms 256 KB
subtask_01_03.txt AC 1 ms 256 KB
subtask_01_04.txt AC 1 ms 256 KB
subtask_01_05.txt AC 1 ms 256 KB
subtask_01_06.txt AC 1 ms 256 KB
subtask_01_07.txt AC 1 ms 256 KB
subtask_01_08.txt AC 1 ms 256 KB
subtask_01_09.txt AC 1 ms 256 KB
subtask_01_10.txt AC 1 ms 256 KB