oj.uz

Submission #446565

# Submission time Handle Problem Language Result Execution time Memory
446565 2021-07-22T12:41:12 Z ComPhyPark Parachute rings (IOI12_rings) C++14
100 / 100
 2171 ms 123452 KB 
#include<cstdio>
#include<vector>
using namespace std;
const int SZ = 1000010;
int min(int a, int b) { return a < b ? a : b; }
int n;
int cycleNum;
vector<int>l[SZ];
bool p = true;
typedef struct Graph {
	int st[4], ts[3];
	int p[SZ], sz[SZ], ln[SZ];
	bool is3E[SZ], isCX[SZ];
	int x;
	void init() {
		x = n;
		st[0] = ts[0] = n;
		st[1] = st[2] = st[3] = ts[1] = ts[2] = 0;
		for (int i = 0; i < n; i++) {
			p[i] = i;
			sz[i] = 1;
			ln[i] = 0;
			is3E[i] = isCX[i] = false;
		}
	}
	void init(int X) {
		init();
		x = X;
		int i, a, b, c;
		for (i = 0; i < n; i++) {
			for (int e : l[i]) {
				if (e > i) {
					if (e == x || i == x) {
						isCX[e + i - x] = true;
						continue;
					}
					a = f(e), b = f(i);
					if (a != b) {
						p[b] = a;
						ln[a] += ln[b];
						sz[a] += sz[b];
					}
					ln[a]++;
				}
			}
			c = gC(i);
			st[min(c, 3)]++;
			if (c > 2)is3E[f(i)] = true;
		}
		for (i = 0; i < n; i++) {
			if (i == p[i])ts[gT(i)]++;
		}
	}
	int f(int a) {
		return a == p[a] ? a : p[a] = f(p[a]);
	}
	int gC(int A) {
		if (A == x)return 0;
		return l[A].size() - (isCX[A] ? 1 : 0);
	}
	void u(int A, int B) {
		int a = f(A), b = f(B);
		if (a != b) {
			p[b] = a;
			ts[gT(a)]--;
			ts[gT(b)]--;
			ln[a] += ln[b];
			sz[a] += sz[b];
			is3E[a] |= is3E[b];
		}
		else {
			ts[gT(a)]--;
		}
	}
	void Con(int A, int B) {
		int a = f(A), c;
		if (x == n)l[A].push_back(B);
		c = gC(A);
		st[min(c - 1, 3)]--;
		st[min(c, 3)]++;
		if (c >= 3)is3E[a] = true;
	}
	int gT(int a) {
		if (is3E[a]) {
			return 2;
		}
		else if (sz[a] == ln[a]) {
			return 1;
		}
		else {
			return 0;
		}
	}
	void Link(int A, int B) {
		if (A == x || B == x) {
			isCX[A + B - x] = true;
			return;
		}
		u(A, B);
		Con(A, B);
		Con(B, A);
		int a = f(A);
		ln[a]++;
		ts[gT(a)]++;
	}
	bool isChain() {
		return (ts[1] + ts[2] == 0);
	}
}Graph;
Graph MG, GV[4];
int GS;
void Init(int N) {
	cycleNum = n = N;
	MG.init();
}
void Link(int A, int B) {
	MG.Link(A, B);
	for (int i = 0; i < GS; i++) {
		if (GV[i].isChain())GV[i].Link(A, B);
	}
	if (MG.gT(MG.f(A)) == 1)cycleNum = MG.f(A);
	if (MG.gT(MG.f(B)) == 1)cycleNum = MG.f(B);
	if (p && MG.st[3]) {
		p = false;
		int a = A;
		if (l[A].size() < 3)a = B;
		GS = l[a].size() + 1;
		GV[l[a].size()].init(a);
		for (int i = 0; i < l[a].size(); i++) {
			GV[i].init(l[a][i]);
		}
	}
}
int CountCritical() {
	if (MG.ts[2]) {
		int r = 0;
		for (int i = 0; i < GS; i++) {
			if (GV[i].isChain())r++;
		}
		return r;
	}
	else if (MG.ts[1]) {
		if (MG.ts[1] > 1)return 0;
		return MG.sz[cycleNum];
	}
	else {
		return n;
	}
}

Compilation message

rings.cpp: In function 'void Link(int, int)':
rings.cpp:129:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  129 |   for (int i = 0; i < l[a].size(); i++) {
      |                   ~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 17 ms 24396 KB Output is correct
3 Correct 17 ms 24404 KB Output is correct
4 Correct 15 ms 23768 KB Output is correct
5 Correct 15 ms 23920 KB Output is correct
6 Correct 17 ms 23968 KB Output is correct
7 Correct 15 ms 24240 KB Output is correct
8 Correct 16 ms 24004 KB Output is correct
9 Correct 18 ms 24396 KB Output is correct
10 Correct 18 ms 24392 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 480 ms 47224 KB Output is correct
2 Correct 1532 ms 103708 KB Output is correct
3 Correct 1255 ms 119584 KB Output is correct
4 Correct 1166 ms 68632 KB Output is correct
5 Correct 1169 ms 68760 KB Output is correct
6 Correct 1185 ms 67652 KB Output is correct
7 Correct 1186 ms 118988 KB Output is correct
8 Correct 2067 ms 117280 KB Output is correct
9 Correct 2171 ms 123452 KB Output is correct
10 Correct 867 ms 67608 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 17 ms 24396 KB Output is correct
3 Correct 17 ms 24404 KB Output is correct
4 Correct 15 ms 23768 KB Output is correct
5 Correct 15 ms 23920 KB Output is correct
6 Correct 17 ms 23968 KB Output is correct
7 Correct 15 ms 24240 KB Output is correct
8 Correct 16 ms 24004 KB Output is correct
9 Correct 18 ms 24396 KB Output is correct
10 Correct 18 ms 24392 KB Output is correct
11 Correct 18 ms 24516 KB Output is correct
12 Correct 20 ms 25008 KB Output is correct
13 Correct 21 ms 24908 KB Output is correct
14 Correct 18 ms 24808 KB Output is correct
15 Correct 20 ms 25488 KB Output is correct
16 Correct 19 ms 24320 KB Output is correct
17 Correct 21 ms 24976 KB Output is correct
18 Correct 22 ms 25676 KB Output is correct
19 Correct 19 ms 24268 KB Output is correct
20 Correct 21 ms 24948 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 17 ms 24396 KB Output is correct
3 Correct 17 ms 24404 KB Output is correct
4 Correct 15 ms 23768 KB Output is correct
5 Correct 15 ms 23920 KB Output is correct
6 Correct 17 ms 23968 KB Output is correct
7 Correct 15 ms 24240 KB Output is correct
8 Correct 16 ms 24004 KB Output is correct
9 Correct 18 ms 24396 KB Output is correct
10 Correct 18 ms 24392 KB Output is correct
11 Correct 18 ms 24516 KB Output is correct
12 Correct 20 ms 25008 KB Output is correct
13 Correct 21 ms 24908 KB Output is correct
14 Correct 18 ms 24808 KB Output is correct
15 Correct 20 ms 25488 KB Output is correct
16 Correct 19 ms 24320 KB Output is correct
17 Correct 21 ms 24976 KB Output is correct
18 Correct 22 ms 25676 KB Output is correct
19 Correct 19 ms 24268 KB Output is correct
20 Correct 21 ms 24948 KB Output is correct
21 Correct 33 ms 25492 KB Output is correct
22 Correct 46 ms 26480 KB Output is correct
23 Correct 54 ms 27204 KB Output is correct
24 Correct 70 ms 31860 KB Output is correct
25 Correct 35 ms 30988 KB Output is correct
26 Correct 69 ms 32512 KB Output is correct
27 Correct 61 ms 27716 KB Output is correct
28 Correct 66 ms 32792 KB Output is correct
29 Correct 59 ms 32420 KB Output is correct
30 Correct 73 ms 28276 KB Output is correct

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 17 ms 24396 KB Output is correct
3 Correct 17 ms 24404 KB Output is correct
4 Correct 15 ms 23768 KB Output is correct
5 Correct 15 ms 23920 KB Output is correct
6 Correct 17 ms 23968 KB Output is correct
7 Correct 15 ms 24240 KB Output is correct
8 Correct 16 ms 24004 KB Output is correct
9 Correct 18 ms 24396 KB Output is correct
10 Correct 18 ms 24392 KB Output is correct
11 Correct 480 ms 47224 KB Output is correct
12 Correct 1532 ms 103708 KB Output is correct
13 Correct 1255 ms 119584 KB Output is correct
14 Correct 1166 ms 68632 KB Output is correct
15 Correct 1169 ms 68760 KB Output is correct
16 Correct 1185 ms 67652 KB Output is correct
17 Correct 1186 ms 118988 KB Output is correct
18 Correct 2067 ms 117280 KB Output is correct
19 Correct 2171 ms 123452 KB Output is correct
20 Correct 867 ms 67608 KB Output is correct
21 Correct 18 ms 24516 KB Output is correct
22 Correct 20 ms 25008 KB Output is correct
23 Correct 21 ms 24908 KB Output is correct
24 Correct 18 ms 24808 KB Output is correct
25 Correct 20 ms 25488 KB Output is correct
26 Correct 19 ms 24320 KB Output is correct
27 Correct 21 ms 24976 KB Output is correct
28 Correct 22 ms 25676 KB Output is correct
29 Correct 19 ms 24268 KB Output is correct
30 Correct 21 ms 24948 KB Output is correct
31 Correct 33 ms 25492 KB Output is correct
32 Correct 46 ms 26480 KB Output is correct
33 Correct 54 ms 27204 KB Output is correct
34 Correct 70 ms 31860 KB Output is correct
35 Correct 35 ms 30988 KB Output is correct
36 Correct 69 ms 32512 KB Output is correct
37 Correct 61 ms 27716 KB Output is correct
38 Correct 66 ms 32792 KB Output is correct
39 Correct 59 ms 32420 KB Output is correct
40 Correct 73 ms 28276 KB Output is correct
41 Correct 236 ms 39240 KB Output is correct
42 Correct 1037 ms 97140 KB Output is correct
43 Correct 358 ms 90904 KB Output is correct
44 Correct 912 ms 115236 KB Output is correct
45 Correct 1139 ms 113032 KB Output is correct
46 Correct 797 ms 61764 KB Output is correct
47 Correct 1012 ms 62364 KB Output is correct
48 Correct 613 ms 108824 KB Output is correct
49 Correct 750 ms 63136 KB Output is correct
50 Correct 789 ms 62640 KB Output is correct
51 Correct 400 ms 83304 KB Output is correct
52 Correct 718 ms 97092 KB Output is correct
53 Correct 614 ms 109272 KB Output is correct
54 Correct 1849 ms 104696 KB Output is correct
55 Correct 1501 ms 111836 KB Output is correct