답안 #18803 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
18803	2016-02-15T13:19:52 Z	ggoh	낙하산 고리들 (IOI12_rings)	C++	100 / 100	2312 ms	71036 KB

rings

#include<cstdio>
#include<algorithm>
 
int p,q,a,cyc,t,co[5],link[1000003][2],par[5][1000002],deg[5][1000002],cycsz,sz[1000002],rank[5][1000002];
bool overtwo,check[5];
int find(int num,int AA){if(AA==par[num][AA])return AA;else return par[num][AA]=find(num,par[num][AA]);}
void unite(int num,int AA,int BB)
{
    if(rank[num][AA]<rank[num][BB])par[num][AA]=BB;
    else
    {
        if(rank[num][AA]==rank[num][BB])rank[num][AA]++;
        par[num][BB]=AA;
    }
}
void add(int r,int s)
{
    for(int i=1;i<=4;i++)
    {
        if(check[i]==0)continue;
        if(co[i]==r||co[i]==s)continue;
        deg[i][r]++;deg[i][s]++;
        if(deg[i][r]>=3||deg[i][s]>=3){check[i]=0;continue;}
        int rr=find(i,r),ss=find(i,s);
        if(rr==ss)check[i]=0;
        else
        {
            unite(i,rr,ss);
        }
    }
}
void make(int r)
{
    int u=1;
    co[u++]=r;
    for(int i=0;i<t;i++)
    {
        if(link[i][0]==r)co[u++]=link[i][1];
        else if(link[i][1]==r)co[u++]=link[i][0];
    }
    for(int i=1;i<=4;i++)
    {
        check[i]=1;
        for(int j=0;j<a;j++)par[i][j]=j,rank[i][j]=1;
    }
    for(int i=0;i<t;i++)add(link[i][0],link[i][1]);
}
void Init(int N)
{
    a=N;
    for(int i=0;i<N;i++)rank[0][i]=1,par[0][i]=i,sz[i]=1;
}
void Link(int A, int B)
{
    if(cyc>1)return ;
    p=A;q=B;
    link[t][0]=p;link[t][1]=q;t++;
    deg[0][p]++;deg[0][q]++;
    if(deg[0][p]==3&&overtwo==0){
        overtwo=1;
        make(p);
    }
    else if(overtwo==0&&deg[0][q]==3)
    {
        overtwo=1;
        make(q);
    }
    else if(overtwo==0)
    {
        p=find(0,p);q=find(0,q);
        if(p==q){cyc++;cycsz=sz[p];}
        else
        {
            unite(0,p,q);
            sz[p]+=sz[q];
            sz[q]=sz[p];
        }
    }
    else
    {
        add(p,q);
    }
}
int CountCritical()
{
    if(cyc>1)return 0;
    if(overtwo)
    {
        int ans=0;
        for(int i=1;i<=4;i++)ans+=check[i];
        return ans;
    }
    else
    {
        if(cyc)return cycsz;
        else return a;
    }
}

Subtask #1
20.0 / 20.0

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

Subtask #2
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	267 ms	12848 KB	Output is correct
2	Correct	1075 ms	57064 KB	Output is correct
3	Correct	468 ms	70680 KB	Output is correct
4	Correct	651 ms	70680 KB	Output is correct
5	Correct	590 ms	70680 KB	Output is correct
6	Correct	568 ms	70680 KB	Output is correct
7	Correct	417 ms	70680 KB	Output is correct
8	Correct	1852 ms	70680 KB	Output is correct
9	Correct	2312 ms	71036 KB	Output is correct
10	Correct	520 ms	71036 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	5 ms	884 KB	Output is correct
3	Correct	3 ms	960 KB	Output is correct
4	Correct	2 ms	960 KB	Output is correct
5	Correct	3 ms	960 KB	Output is correct
6	Correct	3 ms	960 KB	Output is correct
7	Correct	2 ms	960 KB	Output is correct
8	Correct	3 ms	960 KB	Output is correct
9	Correct	5 ms	960 KB	Output is correct
10	Correct	4 ms	1072 KB	Output is correct
11	Correct	3 ms	71036 KB	Output is correct
12	Correct	6 ms	71036 KB	Output is correct
13	Correct	6 ms	71036 KB	Output is correct
14	Correct	5 ms	71036 KB	Output is correct
15	Correct	5 ms	71036 KB	Output is correct
16	Correct	6 ms	71036 KB	Output is correct
17	Correct	5 ms	71036 KB	Output is correct
18	Correct	10 ms	71036 KB	Output is correct
19	Correct	5 ms	71036 KB	Output is correct
20	Correct	6 ms	71036 KB	Output is correct

Subtask #4
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	5 ms	884 KB	Output is correct
3	Correct	3 ms	960 KB	Output is correct
4	Correct	2 ms	960 KB	Output is correct
5	Correct	3 ms	960 KB	Output is correct
6	Correct	3 ms	960 KB	Output is correct
7	Correct	2 ms	960 KB	Output is correct
8	Correct	3 ms	960 KB	Output is correct
9	Correct	5 ms	960 KB	Output is correct
10	Correct	4 ms	1072 KB	Output is correct
11	Correct	3 ms	71036 KB	Output is correct
12	Correct	6 ms	71036 KB	Output is correct
13	Correct	6 ms	71036 KB	Output is correct
14	Correct	5 ms	71036 KB	Output is correct
15	Correct	5 ms	71036 KB	Output is correct
16	Correct	6 ms	71036 KB	Output is correct
17	Correct	5 ms	71036 KB	Output is correct
18	Correct	10 ms	71036 KB	Output is correct
19	Correct	5 ms	71036 KB	Output is correct
20	Correct	6 ms	71036 KB	Output is correct
21	Correct	16 ms	71036 KB	Output is correct
22	Correct	26 ms	71036 KB	Output is correct
23	Correct	33 ms	71036 KB	Output is correct
24	Correct	40 ms	71036 KB	Output is correct
25	Correct	19 ms	71036 KB	Output is correct
26	Correct	43 ms	71036 KB	Output is correct
27	Correct	36 ms	71036 KB	Output is correct
28	Correct	36 ms	71036 KB	Output is correct
29	Correct	35 ms	71036 KB	Output is correct
30	Correct	39 ms	71036 KB	Output is correct

Subtask #5
31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	5 ms	884 KB	Output is correct
3	Correct	3 ms	960 KB	Output is correct
4	Correct	2 ms	960 KB	Output is correct
5	Correct	3 ms	960 KB	Output is correct
6	Correct	3 ms	960 KB	Output is correct
7	Correct	2 ms	960 KB	Output is correct
8	Correct	3 ms	960 KB	Output is correct
9	Correct	5 ms	960 KB	Output is correct
10	Correct	4 ms	1072 KB	Output is correct
11	Correct	267 ms	12848 KB	Output is correct
12	Correct	1075 ms	57064 KB	Output is correct
13	Correct	468 ms	70680 KB	Output is correct
14	Correct	651 ms	70680 KB	Output is correct
15	Correct	590 ms	70680 KB	Output is correct
16	Correct	568 ms	70680 KB	Output is correct
17	Correct	417 ms	70680 KB	Output is correct
18	Correct	1852 ms	70680 KB	Output is correct
19	Correct	2312 ms	71036 KB	Output is correct
20	Correct	520 ms	71036 KB	Output is correct
21	Correct	3 ms	71036 KB	Output is correct
22	Correct	6 ms	71036 KB	Output is correct
23	Correct	6 ms	71036 KB	Output is correct
24	Correct	5 ms	71036 KB	Output is correct
25	Correct	5 ms	71036 KB	Output is correct
26	Correct	6 ms	71036 KB	Output is correct
27	Correct	5 ms	71036 KB	Output is correct
28	Correct	10 ms	71036 KB	Output is correct
29	Correct	5 ms	71036 KB	Output is correct
30	Correct	6 ms	71036 KB	Output is correct
31	Correct	16 ms	71036 KB	Output is correct
32	Correct	26 ms	71036 KB	Output is correct
33	Correct	33 ms	71036 KB	Output is correct
34	Correct	40 ms	71036 KB	Output is correct
35	Correct	19 ms	71036 KB	Output is correct
36	Correct	43 ms	71036 KB	Output is correct
37	Correct	36 ms	71036 KB	Output is correct
38	Correct	36 ms	71036 KB	Output is correct
39	Correct	35 ms	71036 KB	Output is correct
40	Correct	39 ms	71036 KB	Output is correct
41	Correct	186 ms	71036 KB	Output is correct
42	Correct	935 ms	71036 KB	Output is correct
43	Correct	265 ms	71036 KB	Output is correct
44	Correct	410 ms	71036 KB	Output is correct
45	Correct	602 ms	71036 KB	Output is correct
46	Correct	457 ms	71036 KB	Output is correct
47	Correct	535 ms	71036 KB	Output is correct
48	Correct	357 ms	71036 KB	Output is correct
49	Correct	478 ms	71036 KB	Output is correct
50	Correct	481 ms	71036 KB	Output is correct
51	Correct	269 ms	71036 KB	Output is correct
52	Correct	389 ms	71036 KB	Output is correct
53	Correct	326 ms	71036 KB	Output is correct
54	Correct	1655 ms	71036 KB	Output is correct
55	Correct	622 ms	71036 KB	Output is correct

답안 #18803

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 17.0 / 17.0

Subtask #3 18.0 / 18.0

Subtask #4 14.0 / 14.0

Subtask #5 31.0 / 31.0

Subtask #1
20.0 / 20.0

Subtask #2
17.0 / 17.0

Subtask #3
18.0 / 18.0

Subtask #4
14.0 / 14.0

Subtask #5
31.0 / 31.0