답안 #7709 :: oj.uz

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
7709	2014-08-15T06:21:02 Z	baneling100	낙하산 고리들 (IOI12_rings)	C++	100 / 100	1955 ms	110172 KB

rings

#include <algorithm>
#include <vector>

using namespace std;

typedef pair <int,int> ppair;
vector <int> Ring[1000000];
vector <ppair> Line;
int N, Three, Anc[1000000][4], Cycle[4], Deg[1000000][4], Size[1000000][4], MaxDeg[4], CycleSize, Die[4];

void Init(int N_) {

    int i;

    N = N_;
    for(i=0 ; i<N ; i++) {
        Size[i][0]=Size[i][1]=Size[i][2]=Size[i][3]=1;
        Anc[i][0]=Anc[i][1]=Anc[i][2]=Anc[i][3]=-1;
    }
}

int FindAnc(int X, int Y) {

    int Father, Temp;

    Father=X;
    while(Anc[Father][Y]>=0) {
        Father=Anc[Father][Y];
    }
    while(Anc[X][Y]>=0) {
        Temp=Anc[X][Y];
        Anc[X][Y]=Father;
        X=Temp;
    }
    return Father;
}

void DivideThree(int X) {

    int i, j=Line.size(), k, P, Q;

    for(i=0 ; i<N ; i++) {
        Anc[i][0]=-1;
        Deg[i][0]=0;
        Size[i][0]=1;
    }
    Cycle[0]=0;
    Die[0]=X;
    for(i=0 ; i<j ; i++)
        if(Line[i].first!=X && Line[i].second!=X) {
            Deg[Line[i].first][0]++;
            Deg[Line[i].second][0]++;
            if(MaxDeg[0]<Deg[Line[i].first][0])
                MaxDeg[0]=Deg[Line[i].first][0];
            if(MaxDeg[0]<Deg[Line[i].second][0])
                MaxDeg[0]=Deg[Line[i].second][0];
            P=FindAnc(Line[i].first,0);
            Q=FindAnc(Line[i].second,0);
            if(P<Q) {
                Anc[Q][0]=P;
                Size[P][0]+=Size[Q][0];
                Size[Q][0]=0;
            }
            else if(P>Q) {
                Anc[P][0]=Q;
                Size[Q][0]+=Size[P][0];
                Size[P][0]=0;
            }
            else
                Cycle[0]++;
        }
    for(k=0 ; k<3 ; k++) {
        Die[k+1]=Ring[X][k];
        for(i=0 ; i<j ; i++)
            if(Line[i].first!=Ring[X][k] && Line[i].second!=Ring[X][k]) {
                Deg[Line[i].first][k+1]++;
                Deg[Line[i].second][k+1]++;
                if(MaxDeg[k+1]<Deg[Line[i].first][k+1])
                    MaxDeg[k+1]=Deg[Line[i].first][k+1];
                if(MaxDeg[k+1]<Deg[Line[i].second][k+1])
                    MaxDeg[k+1]=Deg[Line[i].second][k+1];
                P=FindAnc(Line[i].first,k+1);
                Q=FindAnc(Line[i].second,k+1);
                if(P<Q) {
                    Anc[Q][k+1]=P;
                    Size[P][k+1]+=Size[Q][k+1];
                    Size[Q][k+1]=0;
                }
                else if(P>Q) {
                    Anc[P][k+1]=Q;
                    Size[Q][k+1]+=Size[P][k+1];
                    Size[P][k+1]=0;
                }
                else
                    Cycle[k+1]++;
            }
    }
}

void Link(int A, int B) {

    int i, X, Y;

    Ring[A].push_back(B);
    Ring[B].push_back(A);
    Line.push_back(make_pair(A,B));
    if(Three)
        for(i=0 ; i<4 ; i++) {
            if(A!=Die[i] && B!=Die[i]) {
                Deg[A][i]++;
                Deg[B][i]++;
                if(MaxDeg[i]<Deg[A][i])
                    MaxDeg[i]=Deg[A][i];
                if(MaxDeg[i]<Deg[B][i])
                    MaxDeg[i]=Deg[B][i];
                X=FindAnc(A,i);
                Y=FindAnc(B,i);
                if(X<Y) {
                    Anc[Y][i]=X;
                    Size[X][i]+=Size[Y][i];
                    Size[Y][i]=0;
                }
                else if(X>Y) {
                    Anc[X][i]=Y;
                    Size[Y][i]+=Size[X][i];
                    Size[X][i]=0;
                }
                else
                    Cycle[i]++;
            }
        }
    else {
        Deg[A][0]++;
        Deg[B][0]++;
        X=FindAnc(A,0);
        Y=FindAnc(B,0);
        if(X<Y) {
            Anc[Y][0]=X;
            Size[X][0]+=Size[Y][0];
            Size[Y][0]=0;
        }
        else if(X>Y) {
            Anc[X][0]=Y;
            Size[Y][0]+=Size[X][0];
            Size[X][0]=0;
        }
        else {
            Cycle[0]++;
            CycleSize=Size[X][0];
        }
        if(Deg[A][0]>=3) {
            DivideThree(A);
            Three=1;
        }
        else if(Deg[B][0]>=3) {
            DivideThree(B);
            Three=1;
        }
    }
}

int CountCritical(void) {

    int i, Cnt=0;

    if(Three) {
        for(i=0 ; i<4 ; i++)
            if(MaxDeg[i]<=2 && !Cycle[i])
                Cnt++;
        return Cnt;
    }
    else {
        if(Cycle[0]==0)
            return N;
        else if(Cycle[0]==1)
            return CycleSize;
        else
            return 0;
    }
}

Subtask #1
20.0 / 20.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	23736 KB	Output is correct
2	Correct	24 ms	24436 KB	Output is correct
3	Correct	24 ms	24436 KB	Output is correct
4	Correct	21 ms	24436 KB	Output is correct
5	Correct	23 ms	24436 KB	Output is correct
6	Correct	24 ms	24480 KB	Output is correct
7	Correct	22 ms	24480 KB	Output is correct
8	Correct	24 ms	24480 KB	Output is correct
9	Correct	25 ms	24572 KB	Output is correct
10	Correct	25 ms	24572 KB	Output is correct

Subtask #2
17.0 / 17.0

#	결과	실행 시간	메모리	Grader output
1	Correct	556 ms	69024 KB	Output is correct
2	Correct	1360 ms	93032 KB	Output is correct
3	Correct	1470 ms	105728 KB	Output is correct
4	Correct	1525 ms	110172 KB	Output is correct
5	Correct	1696 ms	110172 KB	Output is correct
6	Correct	1701 ms	110172 KB	Output is correct
7	Correct	1518 ms	110172 KB	Output is correct
8	Correct	1776 ms	110172 KB	Output is correct
9	Correct	1955 ms	110172 KB	Output is correct
10	Correct	931 ms	110172 KB	Output is correct

Subtask #3
18.0 / 18.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	23736 KB	Output is correct
2	Correct	24 ms	24436 KB	Output is correct
3	Correct	24 ms	24436 KB	Output is correct
4	Correct	21 ms	24436 KB	Output is correct
5	Correct	23 ms	24436 KB	Output is correct
6	Correct	24 ms	24480 KB	Output is correct
7	Correct	22 ms	24480 KB	Output is correct
8	Correct	24 ms	24480 KB	Output is correct
9	Correct	25 ms	24572 KB	Output is correct
10	Correct	25 ms	24572 KB	Output is correct
11	Correct	28 ms	110172 KB	Output is correct
12	Correct	29 ms	110172 KB	Output is correct
13	Correct	29 ms	110172 KB	Output is correct
14	Correct	26 ms	110172 KB	Output is correct
15	Correct	26 ms	110172 KB	Output is correct
16	Correct	30 ms	110172 KB	Output is correct
17	Correct	29 ms	110172 KB	Output is correct
18	Correct	30 ms	110172 KB	Output is correct
19	Correct	27 ms	110172 KB	Output is correct
20	Correct	29 ms	110172 KB	Output is correct

Subtask #4
14.0 / 14.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	23736 KB	Output is correct
2	Correct	24 ms	24436 KB	Output is correct
3	Correct	24 ms	24436 KB	Output is correct
4	Correct	21 ms	24436 KB	Output is correct
5	Correct	23 ms	24436 KB	Output is correct
6	Correct	24 ms	24480 KB	Output is correct
7	Correct	22 ms	24480 KB	Output is correct
8	Correct	24 ms	24480 KB	Output is correct
9	Correct	25 ms	24572 KB	Output is correct
10	Correct	25 ms	24572 KB	Output is correct
11	Correct	28 ms	110172 KB	Output is correct
12	Correct	29 ms	110172 KB	Output is correct
13	Correct	29 ms	110172 KB	Output is correct
14	Correct	26 ms	110172 KB	Output is correct
15	Correct	26 ms	110172 KB	Output is correct
16	Correct	30 ms	110172 KB	Output is correct
17	Correct	29 ms	110172 KB	Output is correct
18	Correct	30 ms	110172 KB	Output is correct
19	Correct	27 ms	110172 KB	Output is correct
20	Correct	29 ms	110172 KB	Output is correct
21	Correct	46 ms	110172 KB	Output is correct
22	Correct	64 ms	110172 KB	Output is correct
23	Correct	101 ms	110172 KB	Output is correct
24	Correct	82 ms	110172 KB	Output is correct
25	Correct	40 ms	110172 KB	Output is correct
26	Correct	78 ms	110172 KB	Output is correct
27	Correct	87 ms	110172 KB	Output is correct
28	Correct	87 ms	110172 KB	Output is correct
29	Correct	66 ms	110172 KB	Output is correct
30	Correct	100 ms	110172 KB	Output is correct

Subtask #5
31.0 / 31.0

#	결과	실행 시간	메모리	Grader output
1	Correct	27 ms	23736 KB	Output is correct
2	Correct	24 ms	24436 KB	Output is correct
3	Correct	24 ms	24436 KB	Output is correct
4	Correct	21 ms	24436 KB	Output is correct
5	Correct	23 ms	24436 KB	Output is correct
6	Correct	24 ms	24480 KB	Output is correct
7	Correct	22 ms	24480 KB	Output is correct
8	Correct	24 ms	24480 KB	Output is correct
9	Correct	25 ms	24572 KB	Output is correct
10	Correct	25 ms	24572 KB	Output is correct
11	Correct	556 ms	69024 KB	Output is correct
12	Correct	1360 ms	93032 KB	Output is correct
13	Correct	1470 ms	105728 KB	Output is correct
14	Correct	1525 ms	110172 KB	Output is correct
15	Correct	1696 ms	110172 KB	Output is correct
16	Correct	1701 ms	110172 KB	Output is correct
17	Correct	1518 ms	110172 KB	Output is correct
18	Correct	1776 ms	110172 KB	Output is correct
19	Correct	1955 ms	110172 KB	Output is correct
20	Correct	931 ms	110172 KB	Output is correct
21	Correct	28 ms	110172 KB	Output is correct
22	Correct	29 ms	110172 KB	Output is correct
23	Correct	29 ms	110172 KB	Output is correct
24	Correct	26 ms	110172 KB	Output is correct
25	Correct	26 ms	110172 KB	Output is correct
26	Correct	30 ms	110172 KB	Output is correct
27	Correct	29 ms	110172 KB	Output is correct
28	Correct	30 ms	110172 KB	Output is correct
29	Correct	27 ms	110172 KB	Output is correct
30	Correct	29 ms	110172 KB	Output is correct
31	Correct	46 ms	110172 KB	Output is correct
32	Correct	64 ms	110172 KB	Output is correct
33	Correct	101 ms	110172 KB	Output is correct
34	Correct	82 ms	110172 KB	Output is correct
35	Correct	40 ms	110172 KB	Output is correct
36	Correct	78 ms	110172 KB	Output is correct
37	Correct	87 ms	110172 KB	Output is correct
38	Correct	87 ms	110172 KB	Output is correct
39	Correct	66 ms	110172 KB	Output is correct
40	Correct	100 ms	110172 KB	Output is correct
41	Correct	289 ms	110172 KB	Output is correct
42	Correct	748 ms	110172 KB	Output is correct
43	Correct	335 ms	110172 KB	Output is correct
44	Correct	912 ms	110172 KB	Output is correct
45	Correct	957 ms	110172 KB	Output is correct
46	Correct	865 ms	110172 KB	Output is correct
47	Correct	1303 ms	110172 KB	Output is correct
48	Correct	667 ms	110172 KB	Output is correct
49	Correct	879 ms	110172 KB	Output is correct
50	Correct	973 ms	110172 KB	Output is correct
51	Correct	453 ms	110172 KB	Output is correct
52	Correct	770 ms	110172 KB	Output is correct
53	Correct	669 ms	110172 KB	Output is correct
54	Correct	1389 ms	110172 KB	Output is correct
55	Correct	1353 ms	110172 KB	Output is correct

답안 #7709

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