# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
152344 | arnold518 | 문명 (KOI17_civilization) | C++14 | 824 ms | 43068 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 <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
const int MAXN = 2000;
const int INF = 2e9;
const int dy[]={-1, 1, 0, 0};
const int dx[]={0, 0, -1, 1};
int N, K;
int A[MAXN+10][MAXN+10];
bool vis[MAXN+10][MAXN+10];
int par[MAXN*MAXN+10];
int f(int y, int x) { y--; x--; return y*N+x; }
int Find(int x) { return x==par[x]?x:(par[x]=Find(par[x])); }
int main()
{
int i, j;
scanf("%d%d", &N, &K);
for(i=0; i<N*N; i++) par[i]=i;
for(i=1; i<=N; i++) for(j=1; j<=N; j++) A[i][j]=INF;
queue<pii> Q;
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... |