Submission #49004

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
49004	2018-05-21T06:39:28 Z	Namnamseo	Parachute rings (IOI12_rings)	C++17	100 / 100	832 ms	50460 KB

rings

#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pp;

vector<pp> links;

int n;

struct simulator {
	int deg [1000010];
	int oppo[1000010];
	bool crit;
	int R;

	void init(int rem){
		R=rem;
		for(int i=0; i<n; ++i) deg[i]=0, oppo[i]=i;
		crit=true;
		for(auto& q:links){
			update(q.first, q.second);
		}
	}

	void update(int a,int b){
		if(!crit) return;
		if(a!=R && b!=R){
			++deg[a], ++deg[b];
			int p=oppo[a], q=oppo[b];
			if(b==p){
				crit=false;
				return;
			}
			oppo[p]=q; oppo[q]=p;
			if(deg[a]>=3 || deg[b]>=3){
				crit=false;
			}
		}
	}
};

int par[1000010];
int sz [1000010];
int cyc_cnt;
int cyc_size;

int R(int x){
	return (par[x]==x)?x:(par[x]=R(par[x]));
}

void join(int a,int b){
	a=R(a); b=R(b);
	if(a == b){
		++cyc_cnt;
		cyc_size += sz[a];
	} else {
		sz[b] += sz[a];
		par[a] = b;
	}
}

void Init(int n_) {
	n=n_;
	for(int i=0; i<n; ++i) par[i]=i, sz[i]=1;
}

int first_deg[1000010];
bool isSim;

simulator ss[4];

void Link(int A, int B) {
if(!isSim){
	++first_deg[A]; ++first_deg[B];
	links.push_back({A, B});
	join(A,B);

	int thr = -1;
	if(first_deg[A] == 3) thr = A;
	if(first_deg[B] == 3) thr = B;

	if(thr != -1){
		vector<int> inj;
		for(pp& l:links){
			int a,b; tie(a,b)=l;
			if(a==thr) inj.push_back(b);
			if(b==thr) inj.push_back(a);
		}
		ss[3].init(thr);
		for(int i=0; i<3; ++i) ss[i].init(inj[i]);
		isSim = true;
	}
} else {

	for(int i=0; i<4; ++i)
		ss[i].update(A, B);
}
}

int CountCritical() {
	if(!isSim){
		if(cyc_cnt >= 2)
			return 0;
		else return cyc_cnt ? cyc_size : n;
	}
	int ans=0;
	for(int i=0; i<4; ++i) if(ss[i].crit) ++ans;
	return ans;
}

Subtask #1
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	628 KB	Output is correct
3	Correct	3 ms	796 KB	Output is correct
4	Correct	2 ms	796 KB	Output is correct
5	Correct	3 ms	796 KB	Output is correct
6	Correct	3 ms	796 KB	Output is correct
7	Correct	3 ms	868 KB	Output is correct
8	Correct	3 ms	868 KB	Output is correct
9	Correct	4 ms	868 KB	Output is correct
10	Correct	4 ms	952 KB	Output is correct

Subtask #2
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	252 ms	10920 KB	Output is correct
2	Correct	495 ms	37296 KB	Output is correct
3	Correct	338 ms	43884 KB	Output is correct
4	Correct	583 ms	43884 KB	Output is correct
5	Correct	536 ms	43884 KB	Output is correct
6	Correct	516 ms	43884 KB	Output is correct
7	Correct	313 ms	43932 KB	Output is correct
8	Correct	764 ms	46120 KB	Output is correct
9	Correct	832 ms	50460 KB	Output is correct
10	Correct	504 ms	50460 KB	Output is correct

Subtask #3
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	628 KB	Output is correct
3	Correct	3 ms	796 KB	Output is correct
4	Correct	2 ms	796 KB	Output is correct
5	Correct	3 ms	796 KB	Output is correct
6	Correct	3 ms	796 KB	Output is correct
7	Correct	3 ms	868 KB	Output is correct
8	Correct	3 ms	868 KB	Output is correct
9	Correct	4 ms	868 KB	Output is correct
10	Correct	4 ms	952 KB	Output is correct
11	Correct	4 ms	50460 KB	Output is correct
12	Correct	5 ms	50460 KB	Output is correct
13	Correct	6 ms	50460 KB	Output is correct
14	Correct	4 ms	50460 KB	Output is correct
15	Correct	5 ms	50460 KB	Output is correct
16	Correct	5 ms	50460 KB	Output is correct
17	Correct	5 ms	50460 KB	Output is correct
18	Correct	5 ms	50460 KB	Output is correct
19	Correct	5 ms	50460 KB	Output is correct
20	Correct	6 ms	50460 KB	Output is correct

Subtask #4
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	628 KB	Output is correct
3	Correct	3 ms	796 KB	Output is correct
4	Correct	2 ms	796 KB	Output is correct
5	Correct	3 ms	796 KB	Output is correct
6	Correct	3 ms	796 KB	Output is correct
7	Correct	3 ms	868 KB	Output is correct
8	Correct	3 ms	868 KB	Output is correct
9	Correct	4 ms	868 KB	Output is correct
10	Correct	4 ms	952 KB	Output is correct
11	Correct	4 ms	50460 KB	Output is correct
12	Correct	5 ms	50460 KB	Output is correct
13	Correct	6 ms	50460 KB	Output is correct
14	Correct	4 ms	50460 KB	Output is correct
15	Correct	5 ms	50460 KB	Output is correct
16	Correct	5 ms	50460 KB	Output is correct
17	Correct	5 ms	50460 KB	Output is correct
18	Correct	5 ms	50460 KB	Output is correct
19	Correct	5 ms	50460 KB	Output is correct
20	Correct	6 ms	50460 KB	Output is correct
21	Correct	17 ms	50460 KB	Output is correct
22	Correct	36 ms	50460 KB	Output is correct
23	Correct	33 ms	50460 KB	Output is correct
24	Correct	33 ms	50460 KB	Output is correct
25	Correct	20 ms	50460 KB	Output is correct
26	Correct	43 ms	50460 KB	Output is correct
27	Correct	39 ms	50460 KB	Output is correct
28	Correct	35 ms	50460 KB	Output is correct
29	Correct	30 ms	50460 KB	Output is correct
30	Correct	46 ms	50460 KB	Output is correct

Subtask #5
31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	2 ms	376 KB	Output is correct
2	Correct	3 ms	628 KB	Output is correct
3	Correct	3 ms	796 KB	Output is correct
4	Correct	2 ms	796 KB	Output is correct
5	Correct	3 ms	796 KB	Output is correct
6	Correct	3 ms	796 KB	Output is correct
7	Correct	3 ms	868 KB	Output is correct
8	Correct	3 ms	868 KB	Output is correct
9	Correct	4 ms	868 KB	Output is correct
10	Correct	4 ms	952 KB	Output is correct
11	Correct	252 ms	10920 KB	Output is correct
12	Correct	495 ms	37296 KB	Output is correct
13	Correct	338 ms	43884 KB	Output is correct
14	Correct	583 ms	43884 KB	Output is correct
15	Correct	536 ms	43884 KB	Output is correct
16	Correct	516 ms	43884 KB	Output is correct
17	Correct	313 ms	43932 KB	Output is correct
18	Correct	764 ms	46120 KB	Output is correct
19	Correct	832 ms	50460 KB	Output is correct
20	Correct	504 ms	50460 KB	Output is correct
21	Correct	4 ms	50460 KB	Output is correct
22	Correct	5 ms	50460 KB	Output is correct
23	Correct	6 ms	50460 KB	Output is correct
24	Correct	4 ms	50460 KB	Output is correct
25	Correct	5 ms	50460 KB	Output is correct
26	Correct	5 ms	50460 KB	Output is correct
27	Correct	5 ms	50460 KB	Output is correct
28	Correct	5 ms	50460 KB	Output is correct
29	Correct	5 ms	50460 KB	Output is correct
30	Correct	6 ms	50460 KB	Output is correct
31	Correct	17 ms	50460 KB	Output is correct
32	Correct	36 ms	50460 KB	Output is correct
33	Correct	33 ms	50460 KB	Output is correct
34	Correct	33 ms	50460 KB	Output is correct
35	Correct	20 ms	50460 KB	Output is correct
36	Correct	43 ms	50460 KB	Output is correct
37	Correct	39 ms	50460 KB	Output is correct
38	Correct	35 ms	50460 KB	Output is correct
39	Correct	30 ms	50460 KB	Output is correct
40	Correct	46 ms	50460 KB	Output is correct
41	Correct	170 ms	50460 KB	Output is correct
42	Correct	467 ms	50460 KB	Output is correct
43	Correct	248 ms	50460 KB	Output is correct
44	Correct	320 ms	50460 KB	Output is correct
45	Correct	429 ms	50460 KB	Output is correct
46	Correct	479 ms	50460 KB	Output is correct
47	Correct	442 ms	50460 KB	Output is correct
48	Correct	290 ms	50460 KB	Output is correct
49	Correct	484 ms	50460 KB	Output is correct
50	Correct	460 ms	50460 KB	Output is correct
51	Correct	246 ms	50460 KB	Output is correct
52	Correct	311 ms	50460 KB	Output is correct
53	Correct	259 ms	50460 KB	Output is correct
54	Correct	670 ms	50460 KB	Output is correct
55	Correct	515 ms	50460 KB	Output is correct

Submission #49004

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