Submission #223747

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
223747	2020-04-16T09:39:33 Z	staniewzki	Parachute rings (IOI12_rings)	C++17	100 / 100	892 ms	48996 KB

rings

#include<bits/stdc++.h>
using namespace std;
 
#define REP(i, n) for(int i = 0; i < n; i++)
 
template<class T> int size(T && a) { return (int) a.size(); }
 
struct Graph {
	vector<int> rep, deg;
	int excluded = -1;
 
	int find(int x) {
		return rep[x] < 0 ? x : find(rep[x]);
	}
 
	int bicomp = -1;
	int get_cycle() {
		return -rep[find(bicomp)];
	}
 
	void join(int x, int y) {
		x = find(x), y = find(y);
		if(x == y) {
			if(bicomp == -1) bicomp = x;
			else bicomp = -2;
			return;
		}
		if(rep[x] > rep[y]) swap(x, y);
		rep[x] += rep[y];
		rep[y] = x;
	}
 
	int max_deg = 0;
	void add_edge(int a, int b) {
		if(a == excluded || b == excluded)
			return;
		max_deg = max(max_deg, ++deg[a]);
		max_deg = max(max_deg, ++deg[b]);
		join(a, b);
	}
 
	Graph(int n = 0, int e = -1) : rep(n, -1), deg(n), excluded(e) {}
};
 
int n;
vector<pair<int, int>> edges;
Graph graph;
vector<Graph> without;
 
void Init(int N) {
	n = N;
	graph = Graph(n);
}
 
void Link(int A, int B) {
	edges.emplace_back(A, B);
	if(graph.max_deg < 3) {
		graph.add_edge(A, B);
		if(graph.max_deg == 3) {
			if(graph.deg[A] != 3)
				swap(A, B);
 
			vector<int> crit = {A};
			for(auto &[u, v] : edges) {
				if(u == A) crit.emplace_back(v);
				if(v == A) crit.emplace_back(u);
			}
 
			for(int x : crit) {
				without.emplace_back(n, x);
				for(auto &[u, v] : edges)
					without.back().add_edge(v, u);		
			}
		}
	}
	else {
		for(auto &g : without)
			g.add_edge(A, B);
	}
}
 
int CountCritical() {
	if(graph.max_deg < 3) {
		if(graph.bicomp == -1) return n;
		if(graph.bicomp == -2) return 0;
		return graph.get_cycle();
	}
	else {
		int ret = 0;
		for(auto &g : without) {
			if(g.bicomp == -1 && g.max_deg < 3)
				ret++;
		}
		return ret;
	}
}

Subtask #1
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	6 ms	640 KB	Output is correct
3	Correct	7 ms	768 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	624 KB	Output is correct
7	Correct	5 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	640 KB	Output is correct
10	Correct	6 ms	640 KB	Output is correct

Subtask #2
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	212 ms	9316 KB	Output is correct
2	Correct	657 ms	40656 KB	Output is correct
3	Correct	892 ms	48364 KB	Output is correct
4	Correct	478 ms	17132 KB	Output is correct
5	Correct	469 ms	17124 KB	Output is correct
6	Correct	448 ms	17104 KB	Output is correct
7	Correct	839 ms	48612 KB	Output is correct
8	Correct	714 ms	45016 KB	Output is correct
9	Correct	741 ms	47960 KB	Output is correct
10	Correct	397 ms	17124 KB	Output is correct

Subtask #3
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	6 ms	640 KB	Output is correct
3	Correct	7 ms	768 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	624 KB	Output is correct
7	Correct	5 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	640 KB	Output is correct
10	Correct	6 ms	640 KB	Output is correct
11	Correct	6 ms	640 KB	Output is correct
12	Correct	8 ms	896 KB	Output is correct
13	Correct	11 ms	1280 KB	Output is correct
14	Correct	7 ms	896 KB	Output is correct
15	Correct	7 ms	1280 KB	Output is correct
16	Correct	8 ms	768 KB	Output is correct
17	Correct	8 ms	1024 KB	Output is correct
18	Correct	9 ms	1408 KB	Output is correct
19	Correct	7 ms	768 KB	Output is correct
20	Correct	8 ms	1024 KB	Output is correct

Subtask #4
14.0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	6 ms	640 KB	Output is correct
3	Correct	7 ms	768 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	624 KB	Output is correct
7	Correct	5 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	640 KB	Output is correct
10	Correct	6 ms	640 KB	Output is correct
11	Correct	6 ms	640 KB	Output is correct
12	Correct	8 ms	896 KB	Output is correct
13	Correct	11 ms	1280 KB	Output is correct
14	Correct	7 ms	896 KB	Output is correct
15	Correct	7 ms	1280 KB	Output is correct
16	Correct	8 ms	768 KB	Output is correct
17	Correct	8 ms	1024 KB	Output is correct
18	Correct	9 ms	1408 KB	Output is correct
19	Correct	7 ms	768 KB	Output is correct
20	Correct	8 ms	1024 KB	Output is correct
21	Correct	19 ms	1536 KB	Output is correct
22	Correct	28 ms	2048 KB	Output is correct
23	Correct	39 ms	2576 KB	Output is correct
24	Correct	39 ms	4984 KB	Output is correct
25	Correct	18 ms	4736 KB	Output is correct
26	Correct	40 ms	5240 KB	Output is correct
27	Correct	37 ms	2676 KB	Output is correct
28	Correct	44 ms	5364 KB	Output is correct
29	Correct	36 ms	5368 KB	Output is correct
30	Correct	40 ms	2676 KB	Output is correct

Subtask #5
31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	4 ms	256 KB	Output is correct
2	Correct	6 ms	640 KB	Output is correct
3	Correct	7 ms	768 KB	Output is correct
4	Correct	5 ms	384 KB	Output is correct
5	Correct	6 ms	512 KB	Output is correct
6	Correct	6 ms	624 KB	Output is correct
7	Correct	5 ms	512 KB	Output is correct
8	Correct	6 ms	512 KB	Output is correct
9	Correct	6 ms	640 KB	Output is correct
10	Correct	6 ms	640 KB	Output is correct
11	Correct	212 ms	9316 KB	Output is correct
12	Correct	657 ms	40656 KB	Output is correct
13	Correct	892 ms	48364 KB	Output is correct
14	Correct	478 ms	17132 KB	Output is correct
15	Correct	469 ms	17124 KB	Output is correct
16	Correct	448 ms	17104 KB	Output is correct
17	Correct	839 ms	48612 KB	Output is correct
18	Correct	714 ms	45016 KB	Output is correct
19	Correct	741 ms	47960 KB	Output is correct
20	Correct	397 ms	17124 KB	Output is correct
21	Correct	6 ms	640 KB	Output is correct
22	Correct	8 ms	896 KB	Output is correct
23	Correct	11 ms	1280 KB	Output is correct
24	Correct	7 ms	896 KB	Output is correct
25	Correct	7 ms	1280 KB	Output is correct
26	Correct	8 ms	768 KB	Output is correct
27	Correct	8 ms	1024 KB	Output is correct
28	Correct	9 ms	1408 KB	Output is correct
29	Correct	7 ms	768 KB	Output is correct
30	Correct	8 ms	1024 KB	Output is correct
31	Correct	19 ms	1536 KB	Output is correct
32	Correct	28 ms	2048 KB	Output is correct
33	Correct	39 ms	2576 KB	Output is correct
34	Correct	39 ms	4984 KB	Output is correct
35	Correct	18 ms	4736 KB	Output is correct
36	Correct	40 ms	5240 KB	Output is correct
37	Correct	37 ms	2676 KB	Output is correct
38	Correct	44 ms	5364 KB	Output is correct
39	Correct	36 ms	5368 KB	Output is correct
40	Correct	40 ms	2676 KB	Output is correct
41	Correct	154 ms	8684 KB	Output is correct
42	Correct	400 ms	39408 KB	Output is correct
43	Correct	255 ms	39540 KB	Output is correct
44	Correct	555 ms	45668 KB	Output is correct
45	Correct	629 ms	48996 KB	Output is correct
46	Correct	380 ms	16612 KB	Output is correct
47	Correct	425 ms	16740 KB	Output is correct
48	Correct	394 ms	45544 KB	Output is correct
49	Correct	378 ms	18916 KB	Output is correct
50	Correct	399 ms	18532 KB	Output is correct
51	Correct	269 ms	34416 KB	Output is correct
52	Correct	495 ms	38628 KB	Output is correct
53	Correct	372 ms	45040 KB	Output is correct
54	Correct	695 ms	41572 KB	Output is correct
55	Correct	813 ms	44004 KB	Output is correct

Submission #223747

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