# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
59104 | andy627 | 문명 (KOI17_civilization) | C++17 | 1092 ms | 64324 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 <stdio.h>
#include <queue>
#include <algorithm>
#define INF 2e9
using namespace std;
int par[2222*2222];
int dist[2222][2222],num[2222][2222];
bool is_gone[2222][2222];
queue<int> qx,qy;
int dx[]={0,0,1,-1};
int dy[]={1,-1,0,0};
int find_(int x){
if(par[x]==x) return x;
return par[x]=find_(par[x]);
}
int main(){
int n,k;
scanf("%d %d",&n,&k);
int pos=0;
for(int i=1;i<=n;i++)
for(int j=1;j<=n;j++) dist[i][j]=INF,num[i][j]=++pos;
for(int i=1;i<=pos;i++) par[i]=i;
for(int i=1;i<=k;i++){
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... |