# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
145562 | surface03 | 문명 (KOI17_civilization) | C++14 | 462 ms | 63032 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>
const int LM=2005;
const int KLM=(int)1e5+1;
int N,K,G[LM][LM],gCnt,group[KLM];
int ans, now;
int fr,re;
int dr[]={1,-1,0,0},dc[]={0,0,1,-1};
struct Civil{
int r,c,lev;
}que[LM*LM];
void ffill(int r,int c){
if(G[r][c]>=0)return;
G[r][c]=gCnt;
que[re++]={r,c,0};
for(int k=0;k<4;k++){
ffill(r+dr[k],c+dc[k]);
}
}
void input(){
scanf("%d%d",&N,&K);
int i,j,r,c;
for(i=0;i<K;i++){
scanf("%d%d",&r,&c);
G[r][c]=-1;
}
for(i=1;i<=N;i++)for(j=1;j<=N;j++){
if(G[i][j]<0){
gCnt++;
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... |