Submission #2668939
Source Code Expand
/* main code starts from line 133. */
/* ---------- STL Libraries ---------- */
// IO library
#include <cstdio>
#include <iomanip>
#include <ios>
#include <iostream>
// algorithm library
#include <algorithm>
#include <cmath>
#include <numeric>
// container library
#include <array>
#include <bitset>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <vector>
/* ---------- Namespace ---------- */
using namespace std;
/* ---------- Type Abbreviation ---------- */
template <typename T>
using V = vector<T>;
template <typename T, typename U>
using P = pair<T, U>;
template <typename T>
using PQ = priority_queue<T>;
template <typename T>
using GPQ = priority_queue<T, vector<T>, greater<T>>;
using ll = long long;
#define fst first
#define snd second
#define pb push_back
#define mp make_pair
#define mt make_tuple
/* ---------- conversion ---------- */
#define INT(c) static_cast<int>(c)
#define CHAR(n) static_cast<char>(n)
#define LL(n) static_cast<ll>(n)
#define DOUBLE(n) static_cast<double>(n)
/* ---------- container ---------- */
#define ALL(v) (v).begin(), (v).end()
#define SIZE(v) (LL((v).size()))
#define FIND(v, k) (v).find(k) != (v).end()
#define VFIND(v, k) find(ALL(v), k) != (v).end()
#define SORT(v) sort(ALL(v))
#define GSORT(v) sort(ALL(v), greater<decltype((v).front())>())
/* ---------- repetition ---------- */
#define FOR(i, a, b) for (ll i = (a); i < (b); i++)
#define REP(i, n) FOR(i, 0, n)
#define NREP(i, n) FOR(i, 1, n + 1)
#define RFOR(i, a, b) for (ll i = (a); i >= (b); i--)
#define RREP(i, n) RFOR(i, n - 1, 0)
#define RNREP(i, n) RFOR(i, n, 1)
// Usual REP runs from 0 to n-1 (R: n-1 to 0)
// Natural REP runs from 1 to n (R: n to 1)
/* ---------- Short Functions ---------- */
template <typename T>
T sq(T a) {
return a * a;
}
#define fcout cout << fixed << setprecision(10)
/* ----------- debug ---------- */
template <typename T, typename U>
void testP2(T a, U b) {
cout << "(" << a << ", " << b << ")" << endl;
return;
}
template <typename T>
void testV(T v) {
cout << "[";
for (auto i : v) {
cout << i << ", ";
}
cout << "\b\b]" << endl;
return;
}
template <typename T>
void testV2(T v) {
for (auto sv : v) {
testV(sv);
}
cout << endl;
return;
}
#define GET_VAR_NAME(variable) #variable
#define test(x) cout << GET_VAR_NAME(x) << " = " << x << endl;
#define testP(p) \
cout << GET_VAR_NAME(p) << " = "; \
testP2(p.fst, p.snd);
/* ---------- Constants ---------- */
// const ll MOD = 1e9 + 7;
// const int INF = 1 << 25;
// const ll INF = 1LL << 50;
// const double PI = acos(-1);
// const double EPS = 1e-10;
const ll dx[4] = {0, -1, 1, 0};
const ll dy[4] = {-1, 0, 0, 1};
// const ll dx[8] = {-1, 0, 1, -1, 1, -1, 0, 1};
// const ll dy[8] = {-1, -1, -1, 0, 0, 1, 1, 1};
/* v-v-v-v-v-v-v-v-v Main Part v-v-v-v-v-v-v-v-v */
/* ---------- Type Definition ----------- */
/* ---------- Global Variance ----------- */
V<V<ll>> grid(50, V<ll>(50));
V<V<bool>> use(50, V<bool>(50, false));
V<P<ll, ll>> ans;
/* ------------- Functions -------------- */
void init() {
ll H, W, K;
cin >> H >> W >> K;
REP(i, 50) {
string S;
cin >> S;
REP(j, 50) {
grid[i][j] = LL(S[j] - '0');
}
}
return;
}
void output() {
cout << SIZE(ans) / 8 << endl;
for (auto p : ans) {
cout << p.fst + 1 << " " << p.snd + 1 << endl;
}
}
void update(ll v) {
REP(i, 50) {
REP(j, 50) {
if (grid[i][j] == v) use[i][j] = true;
}
}
return;
}
bool dfs(ll x, ll y, ll d) {
if (d == 8) return true;
if (x < 0 || x >= 50 || y < 0 || y >= 50 || !use[x][y]) return false;
use[x][y] = false;
REP(i, 4) {
ll sx = x + dx[i];
ll sy = y + dy[i];
if (dfs(sx, sy, d + 1)) {
ans.pb(mp(x, y));
return true;
}
}
use[x][y] = true;
return false;
}
/* ----------- Main Function ------------ */
int main() {
cin.tie(0);
ios::sync_with_stdio(false);
init();
RNREP(v, 9) {
update(v);
REP(i, 50) {
REP(j, 50) {
dfs(i, j, 0);
}
}
}
output();
return 0;
}
Submission Info
Submission Time |
|
Task |
A - Multiple Pieces |
User |
Tiramister |
Language |
C++14 (GCC 5.4.1) |
Score |
613692 |
Code Size |
4497 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 |
63008 / 1343058 |
60464 / 1343058 |
59792 / 1343058 |
55884 / 1343058 |
66971 / 1343058 |
55273 / 1343058 |
65640 / 1343058 |
58154 / 1343058 |
66074 / 1343058 |
62432 / 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 |