oj.uz

Submission #63107

# Submission time Handle Problem Language Result Execution time Memory
63107 2018-07-31T18:07:48 Z reality Parachute rings (IOI12_rings) C++17
100 / 100
 1965 ms 52628 KB 
#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 (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])
				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 {
		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 3 ms 836 KB Output is correct
3 Correct 4 ms 836 KB Output is correct
4 Correct 2 ms 836 KB Output is correct
5 Correct 3 ms 836 KB Output is correct
6 Correct 5 ms 884 KB Output is correct
7 Correct 2 ms 884 KB Output is correct
8 Correct 3 ms 884 KB Output is correct
9 Correct 4 ms 1064 KB Output is correct
10 Correct 4 ms 1064 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 256 ms 11040 KB Output is correct
2 Correct 980 ms 43684 KB Output is correct
3 Correct 1965 ms 52164 KB Output is correct
4 Correct 573 ms 52164 KB Output is correct
5 Correct 589 ms 52164 KB Output is correct
6 Correct 474 ms 52164 KB Output is correct
7 Correct 1751 ms 52172 KB Output is correct
8 Correct 983 ms 52172 KB Output is correct
9 Correct 927 ms 52172 KB Output is correct
10 Correct 490 ms 52172 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 836 KB Output is correct
3 Correct 4 ms 836 KB Output is correct
4 Correct 2 ms 836 KB Output is correct
5 Correct 3 ms 836 KB Output is correct
6 Correct 5 ms 884 KB Output is correct
7 Correct 2 ms 884 KB Output is correct
8 Correct 3 ms 884 KB Output is correct
9 Correct 4 ms 1064 KB Output is correct
10 Correct 4 ms 1064 KB Output is correct
11 Correct 4 ms 52172 KB Output is correct
12 Correct 6 ms 52172 KB Output is correct
13 Correct 6 ms 52172 KB Output is correct
14 Correct 6 ms 52172 KB Output is correct
15 Correct 5 ms 52172 KB Output is correct
16 Correct 5 ms 52172 KB Output is correct
17 Correct 6 ms 52172 KB Output is correct
18 Correct 7 ms 52172 KB Output is correct
19 Correct 5 ms 52172 KB Output is correct
20 Correct 6 ms 52172 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 836 KB Output is correct
3 Correct 4 ms 836 KB Output is correct
4 Correct 2 ms 836 KB Output is correct
5 Correct 3 ms 836 KB Output is correct
6 Correct 5 ms 884 KB Output is correct
7 Correct 2 ms 884 KB Output is correct
8 Correct 3 ms 884 KB Output is correct
9 Correct 4 ms 1064 KB Output is correct
10 Correct 4 ms 1064 KB Output is correct
11 Correct 4 ms 52172 KB Output is correct
12 Correct 6 ms 52172 KB Output is correct
13 Correct 6 ms 52172 KB Output is correct
14 Correct 6 ms 52172 KB Output is correct
15 Correct 5 ms 52172 KB Output is correct
16 Correct 5 ms 52172 KB Output is correct
17 Correct 6 ms 52172 KB Output is correct
18 Correct 7 ms 52172 KB Output is correct
19 Correct 5 ms 52172 KB Output is correct
20 Correct 6 ms 52172 KB Output is correct
21 Correct 16 ms 52172 KB Output is correct
22 Correct 41 ms 52172 KB Output is correct
23 Correct 33 ms 52172 KB Output is correct
24 Correct 51 ms 52172 KB Output is correct
25 Correct 18 ms 52172 KB Output is correct
26 Correct 43 ms 52172 KB Output is correct
27 Correct 39 ms 52172 KB Output is correct
28 Correct 41 ms 52172 KB Output is correct
29 Correct 41 ms 52172 KB Output is correct
30 Correct 45 ms 52172 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 836 KB Output is correct
3 Correct 4 ms 836 KB Output is correct
4 Correct 2 ms 836 KB Output is correct
5 Correct 3 ms 836 KB Output is correct
6 Correct 5 ms 884 KB Output is correct
7 Correct 2 ms 884 KB Output is correct
8 Correct 3 ms 884 KB Output is correct
9 Correct 4 ms 1064 KB Output is correct
10 Correct 4 ms 1064 KB Output is correct
11 Correct 256 ms 11040 KB Output is correct
12 Correct 980 ms 43684 KB Output is correct
13 Correct 1965 ms 52164 KB Output is correct
14 Correct 573 ms 52164 KB Output is correct
15 Correct 589 ms 52164 KB Output is correct
16 Correct 474 ms 52164 KB Output is correct
17 Correct 1751 ms 52172 KB Output is correct
18 Correct 983 ms 52172 KB Output is correct
19 Correct 927 ms 52172 KB Output is correct
20 Correct 490 ms 52172 KB Output is correct
21 Correct 4 ms 52172 KB Output is correct
22 Correct 6 ms 52172 KB Output is correct
23 Correct 6 ms 52172 KB Output is correct
24 Correct 6 ms 52172 KB Output is correct
25 Correct 5 ms 52172 KB Output is correct
26 Correct 5 ms 52172 KB Output is correct
27 Correct 6 ms 52172 KB Output is correct
28 Correct 7 ms 52172 KB Output is correct
29 Correct 5 ms 52172 KB Output is correct
30 Correct 6 ms 52172 KB Output is correct
31 Correct 16 ms 52172 KB Output is correct
32 Correct 41 ms 52172 KB Output is correct
33 Correct 33 ms 52172 KB Output is correct
34 Correct 51 ms 52172 KB Output is correct
35 Correct 18 ms 52172 KB Output is correct
36 Correct 43 ms 52172 KB Output is correct
37 Correct 39 ms 52172 KB Output is correct
38 Correct 41 ms 52172 KB Output is correct
39 Correct 41 ms 52172 KB Output is correct
40 Correct 45 ms 52172 KB Output is correct
41 Correct 180 ms 52172 KB Output is correct
42 Correct 442 ms 52172 KB Output is correct
43 Correct 329 ms 52172 KB Output is correct
44 Correct 841 ms 52172 KB Output is correct
45 Correct 1189 ms 52628 KB Output is correct
46 Correct 520 ms 52628 KB Output is correct
47 Correct 465 ms 52628 KB Output is correct
48 Correct 721 ms 52628 KB Output is correct
49 Correct 447 ms 52628 KB Output is correct
50 Correct 432 ms 52628 KB Output is correct
51 Correct 370 ms 52628 KB Output is correct
52 Correct 698 ms 52628 KB Output is correct
53 Correct 703 ms 52628 KB Output is correct
54 Correct 932 ms 52628 KB Output is correct
55 Correct 1425 ms 52628 KB Output is correct