# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
49016 | okaybody10 | 문명 (KOI17_civilization) | C++98 | 3 ms | 760 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>
int map_size,civ;
int Q[4000010][2],front,rear;
int Q2[1000010][2],front2,rear2;
int start[100010][2];
int map[2010][2010],vis[100010];
int extend(int a,int x,int y)
{
if(x==0 || x==map_size+1 || y==0 || y==map_size+1) return 0;
if(map[x][y]!=0) return 0;
map[x][y]=a;
Q[rear][0]=x; Q[rear++][1]=y;
return 1;
}
void find(int x,int y)
{
if(map[x+1][y])
{
if(map[x][y]>map[x+1][y]) vis[map[x][y]]=vis[map[x+1][y]];
else vis[map[x+1][y]]=vis[map[x][y]];
}
if(map[x-1][y])
{
if(map[x][y]>map[x-1][y]) vis[map[x][y]]=vis[map[x-1][y]];
else vis[map[x-1][y]]=vis[map[x][y]];
}
if(map[x][y+1])
{
if(map[x][y]>map[x][y+1]) vis[map[x][y]]=vis[map[x][y+1]];
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... |