Submission #1400893
Source Code Expand
#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <cmath>
#include <cstdio>
#include <functional>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <set>
#include <utility>
#include <sstream>
#include <complex>
#include <fstream>
#include <bitset>
#include <time.h>
using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
typedef vector<ll> V;
typedef complex<double> Point;
#define PI acos(-1.0)
#define EPS 1e-10
const ll INF = (1LL << 31) - 1;
const ll MOD = 1e9 + 7;
#define FOR(i,a,b) for(int i=(a);i<(b);i++)
#define REP(i,N) for(int i=0;i<(N);i++)
#define ALL(s) (s).begin(),(s).end()
#define EQ(a,b) (abs((a)-(b))<EPS)
#define EQV(a,b) ( EQ((a).real(), (b).real()) && EQ((a).imag(), (b).imag()) )
#define fi first
#define se second
#define N_SIZE (1LL << 20)
#define NIL -1
#define MAX_N 100100 * 3
int h, w, k;
int table[100][100];
vector<vector<P>> vvp;
bool isused[100][100];
int dx[] = { 0,1,0,-1 };
int dy[] = { 1,0,-1,0 };
//vector<P> solve(int i,int j) {
// int d[50][50] = {};
// vector<P> res;
// queue<P> que;
// que.push({ i,j });
// isused[i][j] = 1;
// while (!que.empty()) {
// P p = que.front();
// que.pop();
//
// }
//}
vector<P> solve(int i, int j) {
vector<P> res;
REP(k, 8) {
res.push_back({ i + 1, j + k + 1 });
}
return res;
}
int main() {
cin >> h >> w >> k;
REP(i, h) {
REP(j, w) {
cin >> table[i][j];
if (table[i][j] == 0)isused[i][j] = 1;
}
}
for (int i = 0; i < 50; i++) {
for (int j = 0; j + 8 < 50; j += 8) {
vvp.push_back(solve(i, j));
}
}
cout << vvp.size() << endl;
REP(i, vvp.size()) {
REP(j, vvp[i].size()) {
cout << vvp[i][j].first << " " << vvp[i][j].second << endl;
}
}
}
Submission Info
Submission Time |
|
Task |
A - Multiple Pieces |
User |
jimmy |
Language |
C++14 (GCC 5.4.1) |
Score |
49322 |
Code Size |
1832 Byte |
Status |
AC |
Exec Time |
5 ms |
Memory |
384 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 |
4942 / 1343058 |
3392 / 1343058 |
5288 / 1343058 |
5309 / 1343058 |
5133 / 1343058 |
5776 / 1343058 |
4593 / 1343058 |
3890 / 1343058 |
6085 / 1343058 |
4914 / 1343058 |
Status |
|
|
|
|
|
|
|
|
|
|
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 |
5 ms |
384 KB |
subtask_01_02.txt |
AC |
5 ms |
384 KB |
subtask_01_03.txt |
AC |
5 ms |
384 KB |
subtask_01_04.txt |
AC |
5 ms |
384 KB |
subtask_01_05.txt |
AC |
5 ms |
384 KB |
subtask_01_06.txt |
AC |
5 ms |
384 KB |
subtask_01_07.txt |
AC |
5 ms |
384 KB |
subtask_01_08.txt |
AC |
5 ms |
384 KB |
subtask_01_09.txt |
AC |
5 ms |
384 KB |
subtask_01_10.txt |
AC |
5 ms |
384 KB |