oj.uz

답안 #109300

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
109300 2019-05-06T06:16:34 Z aer0park 문명 (KOI17_civilization) C++14
54 / 100
 1000 ms 114080 KB 
#include <bits/stdc++.h>
#define f first
#define s second
 
using namespace std;
 
typedef long long 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,wq;
 
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() 
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    cin>>n>>k;
    for(int i=0;i<k;i++)
    {
        ll a,b;cin>>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,vis[i]=-1;
    for(int i=0;i<k;i++)
    	wq.push(ar[i]);
    while(1)
    {
        while(!wq.empty())
        {
            pi a=wq.front();
            q.push(a);
            wq.pop();
        }
        while(!q.empty())
        {
            ll nwx=q.front().f,nwy=q.front().s;
            q.pop();
            if(vis[transp[nwx][nwy]]!=-1) continue;
            vis[transp[nwx][nwy]]=anw,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)
                {
                    if(merge(transp[nwx][nwy],transp[ntx][nty]))
                		coj--;  
                }
                else
                	wq.push({ntx,nty});    	  
            }
        }
        if(coj==1)
        {
        	cout<<anw; 
            break;
        }
        anw++;
    }
    return 0;
}

Subtask #1
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1024 KB Output is correct
2 Correct 3 ms 1024 KB Output is correct
3 Correct 3 ms 1024 KB Output is correct
4 Correct 4 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 3 ms 1024 KB Output is correct
7 Correct 4 ms 1024 KB Output is correct
8 Correct 3 ms 1024 KB Output is correct
9 Correct 3 ms 1024 KB Output is correct
10 Correct 3 ms 1024 KB Output is correct
11 Correct 4 ms 1024 KB Output is correct
12 Correct 3 ms 1024 KB Output is correct

Subtask #2
35.0 / 35.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1024 KB Output is correct
2 Correct 3 ms 1024 KB Output is correct
3 Correct 3 ms 1024 KB Output is correct
4 Correct 4 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 3 ms 1024 KB Output is correct
7 Correct 4 ms 1024 KB Output is correct
8 Correct 3 ms 1024 KB Output is correct
9 Correct 3 ms 1024 KB Output is correct
10 Correct 3 ms 1024 KB Output is correct
11 Correct 4 ms 1024 KB Output is correct
12 Correct 115 ms 27964 KB Output is correct
13 Correct 108 ms 28124 KB Output is correct
14 Correct 134 ms 28024 KB Output is correct
15 Correct 90 ms 28024 KB Output is correct
16 Correct 32 ms 27904 KB Output is correct
17 Correct 503 ms 42344 KB Output is correct
18 Correct 521 ms 42984 KB Output is correct
19 Correct 535 ms 43212 KB Output is correct
20 Correct 582 ms 42984 KB Output is correct
21 Correct 610 ms 43232 KB Output is correct
22 Correct 23 ms 28032 KB Output is correct
23 Correct 67 ms 28004 KB Output is correct
24 Correct 3 ms 1024 KB Output is correct

Subtask #3
0 / 46.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 1024 KB Output is correct
2 Correct 3 ms 1024 KB Output is correct
3 Correct 3 ms 1024 KB Output is correct
4 Correct 4 ms 1024 KB Output is correct
5 Correct 5 ms 1024 KB Output is correct
6 Correct 3 ms 1024 KB Output is correct
7 Correct 4 ms 1024 KB Output is correct
8 Correct 3 ms 1024 KB Output is correct
9 Correct 3 ms 1024 KB Output is correct
10 Correct 3 ms 1024 KB Output is correct
11 Correct 4 ms 1024 KB Output is correct
12 Correct 115 ms 27964 KB Output is correct
13 Correct 108 ms 28124 KB Output is correct
14 Correct 134 ms 28024 KB Output is correct
15 Correct 90 ms 28024 KB Output is correct
16 Correct 32 ms 27904 KB Output is correct
17 Correct 503 ms 42344 KB Output is correct
18 Correct 521 ms 42984 KB Output is correct
19 Correct 535 ms 43212 KB Output is correct
20 Correct 582 ms 42984 KB Output is correct
21 Correct 610 ms 43232 KB Output is correct
22 Correct 23 ms 28032 KB Output is correct
23 Correct 67 ms 28004 KB Output is correct
24 Correct 343 ms 94464 KB Output is correct
25 Correct 490 ms 94576 KB Output is correct
26 Correct 342 ms 94592 KB Output is correct
27 Correct 424 ms 94584 KB Output is correct
28 Correct 345 ms 94788 KB Output is correct
29 Execution timed out 1088 ms 114080 KB Time limit exceeded
30 Halted 0 ms 0 KB -