Submission #108997

# Submission time Handle Problem Language Result Execution time Memory
108997 2019-05-03T13:29:20 Z aer0park None (KOI17_civilization) C++14
19 / 100
611 ms 36664 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,-1,0,0},dy[]={0,0,1,-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;
    for(int i=0;i<k;i++)
    {
        wq.push(ar[i]); 
        ck[transp[ar[i].f][ar[i].s]]=1;
    }
    while(1)
    {
        bool flag=1;
        anw++;
        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();
            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(ck[p[transp[ntx][nty]]])
                {
                    if(merge(transp[ntx][nty],transp[nwx][nwy]))
                    {
                    	if(vis[transp[ntx][nty]]==anw)
                    		flag=0;
						coj++;
					}    
                }
                else
                {
					if(merge(transp[ntx][nty],transp[nwx][nwy]))
                        wq.push({ntx,nty}),vis[transp[ntx][nty]]=anw;
                }	  
            }
        }
        if(coj==k-1)
        {
            if(flag)
                cout<<anw-1;
            else
                cout<<anw;  
            break;
        }
    }
    return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 5 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 4 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 4 ms 1024 KB Output is correct
9 Correct 4 ms 1024 KB Output is correct
10 Correct 3 ms 1024 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 4 ms 1024 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 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 4 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 4 ms 1024 KB Output is correct
9 Correct 4 ms 1024 KB Output is correct
10 Correct 3 ms 1024 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 148 ms 27956 KB Output is correct
13 Correct 114 ms 27872 KB Output is correct
14 Correct 139 ms 27896 KB Output is correct
15 Correct 100 ms 27852 KB Output is correct
16 Correct 32 ms 22500 KB Output is correct
17 Incorrect 611 ms 36664 KB Output isn't correct
18 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Correct 5 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 4 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 4 ms 1024 KB Output is correct
9 Correct 4 ms 1024 KB Output is correct
10 Correct 3 ms 1024 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 148 ms 27956 KB Output is correct
13 Correct 114 ms 27872 KB Output is correct
14 Correct 139 ms 27896 KB Output is correct
15 Correct 100 ms 27852 KB Output is correct
16 Correct 32 ms 22500 KB Output is correct
17 Incorrect 611 ms 36664 KB Output isn't correct
18 Halted 0 ms 0 KB -