oj.uz

Submission #109285

# Submission time Handle Problem Language Result Execution time Memory
109285 2019-05-06T05:29:47 Z aer0park None (KOI17_civilization) C++14
19 / 100
 619 ms 35332 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]);
        vis[transp[ar[i].f][ar[i].s]]=0;
        coj++;
    }
    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(vis[transp[ntx][nty]]==-1)
                	vis[transp[ntx][nty]]=anw,coj++;
                if(vis[p[transp[ntx][nty]]]==0)
                {
                    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}),coj--;
                }	  
            }
        }
        if(coj==1)
        {
        	if(flag)
				cout<<anw-1;
			else
				cout<<anw; 
            break;
        }
    }
    return 0;
}

Subtask #1
19.0 / 19.0

# Verdict Execution time Memory 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 3 ms 1024 KB Output is correct
5 Correct 3 ms 1024 KB Output is correct
6 Correct 4 ms 1024 KB Output is correct
7 Correct 3 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 22 ms 1024 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 4 ms 1024 KB Output is correct

Subtask #2
0 / 35.0

# Verdict Execution time Memory 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 3 ms 1024 KB Output is correct
5 Correct 3 ms 1024 KB Output is correct
6 Correct 4 ms 1024 KB Output is correct
7 Correct 3 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 22 ms 1024 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 145 ms 27976 KB Output is correct
13 Correct 103 ms 27992 KB Output is correct
14 Correct 167 ms 27868 KB Output is correct
15 Correct 105 ms 27904 KB Output is correct
16 Correct 40 ms 27896 KB Output is correct
17 Incorrect 619 ms 35332 KB Output isn't correct
18 Halted 0 ms 0 KB -

Subtask #3
0 / 46.0

# Verdict Execution time Memory 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 3 ms 1024 KB Output is correct
5 Correct 3 ms 1024 KB Output is correct
6 Correct 4 ms 1024 KB Output is correct
7 Correct 3 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 22 ms 1024 KB Output is correct
11 Correct 3 ms 1024 KB Output is correct
12 Correct 145 ms 27976 KB Output is correct
13 Correct 103 ms 27992 KB Output is correct
14 Correct 167 ms 27868 KB Output is correct
15 Correct 105 ms 27904 KB Output is correct
16 Correct 40 ms 27896 KB Output is correct
17 Incorrect 619 ms 35332 KB Output isn't correct
18 Halted 0 ms 0 KB -