oj.uz

답안 #109317

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109317 2019-05-06T06:52:19 Z aer0park 문명 (KOI17_civilization) C++14
54 / 100
 1000 ms 52336 KB 
#include <bits/stdc++.h>
#define f first
#define s second
 
using namespace std;
 
typedef int ll;
typedef pair<ll,ll> pi;
 
ll n,k,p[4000004],transp[2004][2004],cnt,coj,anw,vis[4000004];
bool ck[4000004];
ll dx[]={1,0,-1,0},dy[]={0,1,0,-1};
vector<pi> ar;
queue<pi> q;
 
ll par(int a)
{
    if(p[a]==a)
        return a;
    return p[a]=par(p[a]);
}
 
bool merge(ll a,ll b)    
{
    a=par(a),b=par(b);
    if(a!=b)
    {
        p[a]=b;
        return 1;   
    }
    return 0;
}
 
int main() 
{
    scanf("%d%d",&n,&k);
    for(int i=0;i<k;i++)
    {
        ll a,b;scanf("%d%d",&a,&b);
        ar.push_back({a,b});
    }
    for(int i=1;i<=n;i++)
        for(int j=1;j<=n;j++)
            transp[i][j]=++cnt;
    for(int i=1;i<=n*n;i++)
        p[i]=i;
    memset(vis,-1,sizeof(vis));
    for(int i=0;i<k;i++)
    {
    	q.push(ar[i]);
    	vis[transp[ar[i].f][ar[i].s]]=0;
	}
    while(1)
    {
        while(!q.empty())
        {
            ll nwx=q.front().f,nwy=q.front().s;
            if(vis[transp[nwx][nwy]]!=anw)
            	break;
            q.pop();
            coj++;
            for(int i=0;i<4;i++)
            {
                ll ntx=nwx+dx[i],nty=nwy+dy[i];     
                if(ntx<1||ntx>n||nty<1||nty>n)
                    continue;
                if(vis[transp[ntx][nty]]==-1)
                	q.push({ntx,nty}),vis[transp[ntx][nty]]=anw+1;
				else if(vis[transp[ntx][nty]]<=anw)
                {
                    if(merge(transp[nwx][nwy],transp[ntx][nty]))
                		coj--;  
                }    	  
            }
        }
        if(coj==1)
        {
        	printf("%d",anw); 
            break;
        }
        anw++;
    }
    return 0;
}

Compilation message

civilization.cpp: In function 'int main()':
civilization.cpp:36:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d%d",&n,&k);
     ~~~~~^~~~~~~~~~~~~~
civilization.cpp:39:21: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
         ll a,b;scanf("%d%d",&a,&b);
                ~~~~~^~~~~~~~~~~~~~

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16512 KB Output is correct
2 Correct 16 ms 16512 KB Output is correct
3 Correct 16 ms 16512 KB Output is correct
4 Correct 15 ms 16512 KB Output is correct
5 Correct 18 ms 16512 KB Output is correct
6 Correct 16 ms 16512 KB Output is correct
7 Correct 15 ms 16512 KB Output is correct
8 Correct 15 ms 16512 KB Output is correct
9 Correct 19 ms 16512 KB Output is correct
10 Correct 15 ms 16512 KB Output is correct
11 Correct 19 ms 16504 KB Output is correct
12 Correct 17 ms 16512 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16512 KB Output is correct
2 Correct 16 ms 16512 KB Output is correct
3 Correct 16 ms 16512 KB Output is correct
4 Correct 15 ms 16512 KB Output is correct
5 Correct 18 ms 16512 KB Output is correct
6 Correct 16 ms 16512 KB Output is correct
7 Correct 15 ms 16512 KB Output is correct
8 Correct 15 ms 16512 KB Output is correct
9 Correct 19 ms 16512 KB Output is correct
10 Correct 15 ms 16512 KB Output is correct
11 Correct 19 ms 16504 KB Output is correct
12 Correct 127 ms 27820 KB Output is correct
13 Correct 89 ms 27800 KB Output is correct
14 Correct 122 ms 27904 KB Output is correct
15 Correct 84 ms 27856 KB Output is correct
16 Correct 35 ms 27780 KB Output is correct
17 Correct 521 ms 31656 KB Output is correct
18 Correct 507 ms 31728 KB Output is correct
19 Correct 601 ms 31748 KB Output is correct
20 Correct 579 ms 31760 KB Output is correct
21 Correct 528 ms 31668 KB Output is correct
22 Correct 25 ms 27776 KB Output is correct
23 Correct 72 ms 27768 KB Output is correct
24 Correct 17 ms 16512 KB Output is correct

Subtask #3
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 17 ms 16512 KB Output is correct
2 Correct 16 ms 16512 KB Output is correct
3 Correct 16 ms 16512 KB Output is correct
4 Correct 15 ms 16512 KB Output is correct
5 Correct 18 ms 16512 KB Output is correct
6 Correct 16 ms 16512 KB Output is correct
7 Correct 15 ms 16512 KB Output is correct
8 Correct 15 ms 16512 KB Output is correct
9 Correct 19 ms 16512 KB Output is correct
10 Correct 15 ms 16512 KB Output is correct
11 Correct 19 ms 16504 KB Output is correct
12 Correct 127 ms 27820 KB Output is correct
13 Correct 89 ms 27800 KB Output is correct
14 Correct 122 ms 27904 KB Output is correct
15 Correct 84 ms 27856 KB Output is correct
16 Correct 35 ms 27780 KB Output is correct
17 Correct 521 ms 31656 KB Output is correct
18 Correct 507 ms 31728 KB Output is correct
19 Correct 601 ms 31748 KB Output is correct
20 Correct 579 ms 31760 KB Output is correct
21 Correct 528 ms 31668 KB Output is correct
22 Correct 25 ms 27776 KB Output is correct
23 Correct 72 ms 27768 KB Output is correct
24 Correct 329 ms 47428 KB Output is correct
25 Correct 413 ms 47532 KB Output is correct
26 Correct 256 ms 47352 KB Output is correct
27 Correct 305 ms 47556 KB Output is correct
28 Correct 191 ms 47480 KB Output is correct
29 Execution timed out 1079 ms 52336 KB Time limit exceeded
30 Halted 0 ms 0 KB -