Submission #63108

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
63108	2018-07-31T18:11:23 Z	reality	Parachute rings (IOI12_rings)	C++17	100 / 100	837 ms	52400 KB

rings

#include "bits/stdc++.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define dbg(v) cerr<<#v<<" = "<<v<<'\n'
#define vi vector<int>
#define vl vector <ll>
#define pii pair<int,int>
#define mp make_pair
#define db long double
#define pb push_back
#define all(s) s.begin(),s.end()
template < class T > T smin(T &a,T b) {if (a > b) a = b;return a;}
template < class T > T smax(T &a,T b) {if (a < b) a = b;return a;}

const int NN = 2e6 + 5;

int n;

int f[NN];

int deg[NN];

int sz[NN];

vector < pii > e;

int ans;

int gg[5][NN];

int dg[5][NN];

vi who;

vi ANS;

int szz;

int cyc;

int g(int w,int k) {
	return gg[w][k] == k ? k : gg[w][k] = g(w,gg[w][k]);
}

int get(int k) {
	return k == f[k] ? k : f[k] = get(f[k]);
}

void Init(int N_) {
  	n = N_;
  	ans = n;
  	for (int i = 1;i <= n;++i) {
  		f[i] = i,sz[i] = 1;
  	}
}



void Link(int A, int B) {
	++A;++B;
	e.pb(mp(A,B));
	if (!szz && (deg[A] >= 2 || deg[B] >= 2)) {
		if (deg[A] < 2)
			swap(A,B);
		for (auto it : e) {
			if (it.fi == A)
				who.pb(it.se);
			else
			if (it.se == A)
				who.pb(it.fi);
		}
		who.pb(A);
		szz = who.size();
		ANS = vi(szz,1);
		for (int i = 0;i < szz;++i) {
			for (int j = 1;j <= n;++j)
				gg[i][j] = j,dg[i][j] = 0;
			for (auto it : e) {
				if (!ANS[i])
					break;
				if (it.fi == who[i] || it.se == who[i])
					continue;
				int x = g(i,it.fi);
				int y = g(i,it.se);
				++dg[i][it.fi];
				++dg[i][it.se];
				ANS[i] &= dg[i][it.fi] <= 2 && dg[i][it.se] <= 2 && x != y;
				gg[i][x] = y;
			}
		}
	} else
	if (szz) {
		for (int i = 0;i < szz;++i) {
			if (A == who[i] || B == who[i] || !ANS[i])
				continue;
			int x = g(i,A);
			int y = g(i,B);
			++dg[i][A];
			++dg[i][B];
			ANS[i] &= dg[i][A] <= 2 && dg[i][B] <= 2 && x != y;
			gg[i][x] = y;
		}
	} else 
	if (cyc <= 1) {
		int x = get(A);
		int y = get(B);
		++deg[A];
		++deg[B];
		if (x == y)
			++cyc,ans = (cyc == 1) * sz[x];
		else {
			sz[y] += sz[x];
			sz[x] = 0;
			f[x] = y;
		}
	}

}

int CountCritical() {
	if (szz)
		return accumulate(all(ANS),0);
	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	5 ms	764 KB	Output is correct
3	Correct	4 ms	800 KB	Output is correct
4	Correct	2 ms	800 KB	Output is correct
5	Correct	3 ms	800 KB	Output is correct
6	Correct	4 ms	800 KB	Output is correct
7	Correct	2 ms	800 KB	Output is correct
8	Correct	3 ms	800 KB	Output is correct
9	Correct	4 ms	908 KB	Output is correct
10	Correct	4 ms	936 KB	Output is correct

Subtask #2
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	237 ms	10952 KB	Output is correct
2	Correct	500 ms	43704 KB	Output is correct
3	Correct	358 ms	52316 KB	Output is correct
4	Correct	577 ms	52316 KB	Output is correct
5	Correct	581 ms	52316 KB	Output is correct
6	Correct	565 ms	52316 KB	Output is correct
7	Correct	336 ms	52316 KB	Output is correct
8	Correct	722 ms	52316 KB	Output is correct
9	Correct	837 ms	52316 KB	Output is correct
10	Correct	519 ms	52316 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	5 ms	764 KB	Output is correct
3	Correct	4 ms	800 KB	Output is correct
4	Correct	2 ms	800 KB	Output is correct
5	Correct	3 ms	800 KB	Output is correct
6	Correct	4 ms	800 KB	Output is correct
7	Correct	2 ms	800 KB	Output is correct
8	Correct	3 ms	800 KB	Output is correct
9	Correct	4 ms	908 KB	Output is correct
10	Correct	4 ms	936 KB	Output is correct
11	Correct	5 ms	52316 KB	Output is correct
12	Correct	6 ms	52316 KB	Output is correct
13	Correct	6 ms	52316 KB	Output is correct
14	Correct	5 ms	52316 KB	Output is correct
15	Correct	5 ms	52316 KB	Output is correct
16	Correct	5 ms	52316 KB	Output is correct
17	Correct	5 ms	52316 KB	Output is correct
18	Correct	5 ms	52316 KB	Output is correct
19	Correct	9 ms	52316 KB	Output is correct
20	Correct	6 ms	52316 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	5 ms	764 KB	Output is correct
3	Correct	4 ms	800 KB	Output is correct
4	Correct	2 ms	800 KB	Output is correct
5	Correct	3 ms	800 KB	Output is correct
6	Correct	4 ms	800 KB	Output is correct
7	Correct	2 ms	800 KB	Output is correct
8	Correct	3 ms	800 KB	Output is correct
9	Correct	4 ms	908 KB	Output is correct
10	Correct	4 ms	936 KB	Output is correct
11	Correct	5 ms	52316 KB	Output is correct
12	Correct	6 ms	52316 KB	Output is correct
13	Correct	6 ms	52316 KB	Output is correct
14	Correct	5 ms	52316 KB	Output is correct
15	Correct	5 ms	52316 KB	Output is correct
16	Correct	5 ms	52316 KB	Output is correct
17	Correct	5 ms	52316 KB	Output is correct
18	Correct	5 ms	52316 KB	Output is correct
19	Correct	9 ms	52316 KB	Output is correct
20	Correct	6 ms	52316 KB	Output is correct
21	Correct	21 ms	52316 KB	Output is correct
22	Correct	25 ms	52316 KB	Output is correct
23	Correct	31 ms	52316 KB	Output is correct
24	Correct	36 ms	52316 KB	Output is correct
25	Correct	16 ms	52316 KB	Output is correct
26	Correct	36 ms	52316 KB	Output is correct
27	Correct	33 ms	52316 KB	Output is correct
28	Correct	34 ms	52316 KB	Output is correct
29	Correct	29 ms	52316 KB	Output is correct
30	Correct	46 ms	52316 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	5 ms	764 KB	Output is correct
3	Correct	4 ms	800 KB	Output is correct
4	Correct	2 ms	800 KB	Output is correct
5	Correct	3 ms	800 KB	Output is correct
6	Correct	4 ms	800 KB	Output is correct
7	Correct	2 ms	800 KB	Output is correct
8	Correct	3 ms	800 KB	Output is correct
9	Correct	4 ms	908 KB	Output is correct
10	Correct	4 ms	936 KB	Output is correct
11	Correct	237 ms	10952 KB	Output is correct
12	Correct	500 ms	43704 KB	Output is correct
13	Correct	358 ms	52316 KB	Output is correct
14	Correct	577 ms	52316 KB	Output is correct
15	Correct	581 ms	52316 KB	Output is correct
16	Correct	565 ms	52316 KB	Output is correct
17	Correct	336 ms	52316 KB	Output is correct
18	Correct	722 ms	52316 KB	Output is correct
19	Correct	837 ms	52316 KB	Output is correct
20	Correct	519 ms	52316 KB	Output is correct
21	Correct	5 ms	52316 KB	Output is correct
22	Correct	6 ms	52316 KB	Output is correct
23	Correct	6 ms	52316 KB	Output is correct
24	Correct	5 ms	52316 KB	Output is correct
25	Correct	5 ms	52316 KB	Output is correct
26	Correct	5 ms	52316 KB	Output is correct
27	Correct	5 ms	52316 KB	Output is correct
28	Correct	5 ms	52316 KB	Output is correct
29	Correct	9 ms	52316 KB	Output is correct
30	Correct	6 ms	52316 KB	Output is correct
31	Correct	21 ms	52316 KB	Output is correct
32	Correct	25 ms	52316 KB	Output is correct
33	Correct	31 ms	52316 KB	Output is correct
34	Correct	36 ms	52316 KB	Output is correct
35	Correct	16 ms	52316 KB	Output is correct
36	Correct	36 ms	52316 KB	Output is correct
37	Correct	33 ms	52316 KB	Output is correct
38	Correct	34 ms	52316 KB	Output is correct
39	Correct	29 ms	52316 KB	Output is correct
40	Correct	46 ms	52316 KB	Output is correct
41	Correct	170 ms	52316 KB	Output is correct
42	Correct	440 ms	52316 KB	Output is correct
43	Correct	254 ms	52316 KB	Output is correct
44	Correct	333 ms	52316 KB	Output is correct
45	Correct	430 ms	52400 KB	Output is correct
46	Correct	509 ms	52400 KB	Output is correct
47	Correct	426 ms	52400 KB	Output is correct
48	Correct	313 ms	52400 KB	Output is correct
49	Correct	464 ms	52400 KB	Output is correct
50	Correct	496 ms	52400 KB	Output is correct
51	Correct	249 ms	52400 KB	Output is correct
52	Correct	326 ms	52400 KB	Output is correct
53	Correct	267 ms	52400 KB	Output is correct
54	Correct	715 ms	52400 KB	Output is correct
55	Correct	517 ms	52400 KB	Output is correct

Submission #63108

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