# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
132754 | abra_stone | 문명 (KOI17_civilization) | C++14 | 983 ms | 34040 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <iostream>
#include <cstdio>
#include <queue>
#include <cstring>
#define N 2005
#define K 100005
using namespace std;
int n, k, ans, ca[K], g[N][N];
int dx[4] = {-1, 0, 1, 0};
int dy[4] = {0, -1, 0, 1};
bool v[N][N];
queue<int> qx, qy, qg, qc;
int uni(int p) {
if (ca[p] == p) return p;
return ca[p] = uni(ca[p]);
}
void f(int x, int y, int fg, int fc) {
if (g[x][y] == -1) return;
if (v[x][y] == 0) {
qx.push(x);
qy.push(y);
qg.push(fg);
qc.push(fc + 1);
v[x][y] = 1;
return;
}
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |