Submission #357076

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
357076	2021-01-24T02:12:44 Z	daniel920712	Parachute rings (IOI12_rings)	C++14	20 / 100	4000 ms	49524 KB

rings

#include <stdio.h>
#include <stdlib.h>
#include <vector>
using namespace std;
int N;
int who;
vector < int > Next[1000005];
int deg[1000005];
bool have[1000005];
int ok=1;
void Init(int N_)
{
    N = N_;
}

void Link(int A, int B)
{
    Next[A].push_back(B);
    Next[B].push_back(A);
    deg[A]++;
    deg[B]++;
}
void F(int here)
{
    int t=0;
    have[here]=1;
    for(auto i:Next[here]) if(!have[i]&&i!=who) F(i);
}
int CountCritical()
{
    int ans=0;
    int i,j;
    for(i=0;i<N;i++)
    {
        ok=1;
        who=i;
        for(auto j:Next[i]) deg[j]--;
        for(j=0;j<N;j++) have[j]=0;
        have[i]=1;
        for(j=0;j<N;j++)
        {
            if(deg[j]==0) have[j]=1;
            if(deg[j]==1&&!have[j]) F(j);
            if(deg[j]>=3&&i!=j) ok=0;
        }
        for(j=0;j<N;j++) if(!have[j]) ok=0;
        for(auto j:Next[i]) deg[j]++;
        ans+=ok;
        //if(ok) printf("aa %d\n",i);
    }
    return ans;

}

Compilation message

rings.cpp: In function 'void F(int)':
rings.cpp:25:9: warning: unused variable 't' [-Wunused-variable]
   25 |     int t=0;
      |         ^

Subtask #1

20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	23788 KB	Output is correct
2	Correct	437 ms	24172 KB	Output is correct
3	Correct	716 ms	24172 KB	Output is correct
4	Correct	40 ms	23788 KB	Output is correct
5	Correct	173 ms	24044 KB	Output is correct
6	Correct	591 ms	24236 KB	Output is correct
7	Correct	226 ms	23928 KB	Output is correct
8	Correct	141 ms	24044 KB	Output is correct
9	Correct	751 ms	24168 KB	Output is correct
10	Correct	731 ms	24140 KB	Output is correct

Subtask #2

0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Execution timed out	4075 ms	49524 KB	Time limit exceeded
2	Halted	0 ms	0 KB	-

Subtask #3

0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	23788 KB	Output is correct
2	Correct	437 ms	24172 KB	Output is correct
3	Correct	716 ms	24172 KB	Output is correct
4	Correct	40 ms	23788 KB	Output is correct
5	Correct	173 ms	24044 KB	Output is correct
6	Correct	591 ms	24236 KB	Output is correct
7	Correct	226 ms	23928 KB	Output is correct
8	Correct	141 ms	24044 KB	Output is correct
9	Correct	751 ms	24168 KB	Output is correct
10	Correct	731 ms	24140 KB	Output is correct
11	Execution timed out	4088 ms	24032 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #4

0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	23788 KB	Output is correct
2	Correct	437 ms	24172 KB	Output is correct
3	Correct	716 ms	24172 KB	Output is correct
4	Correct	40 ms	23788 KB	Output is correct
5	Correct	173 ms	24044 KB	Output is correct
6	Correct	591 ms	24236 KB	Output is correct
7	Correct	226 ms	23928 KB	Output is correct
8	Correct	141 ms	24044 KB	Output is correct
9	Correct	751 ms	24168 KB	Output is correct
10	Correct	731 ms	24140 KB	Output is correct
11	Execution timed out	4088 ms	24032 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-

Subtask #5

0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	16 ms	23788 KB	Output is correct
2	Correct	437 ms	24172 KB	Output is correct
3	Correct	716 ms	24172 KB	Output is correct
4	Correct	40 ms	23788 KB	Output is correct
5	Correct	173 ms	24044 KB	Output is correct
6	Correct	591 ms	24236 KB	Output is correct
7	Correct	226 ms	23928 KB	Output is correct
8	Correct	141 ms	24044 KB	Output is correct
9	Correct	751 ms	24168 KB	Output is correct
10	Correct	731 ms	24140 KB	Output is correct
11	Execution timed out	4075 ms	49524 KB	Time limit exceeded
12	Halted	0 ms	0 KB	-