oj.uz

Submission #446568

# Submission time Handle Problem Language Result Execution time Memory
446568 2021-07-22T12:51:13 Z ComPhyPark Parachute rings (IOI12_rings) C++14
100 / 100
 2148 ms 123544 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) {
	if (p) {
		MG.Link(A, B);
	}
	else {
		l[A].push_back(B);
		l[B].push_back(A);
	}
	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:135:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |   for (int i = 0; i < l[a].size(); i++) {
      |                   ~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 17 ms 24400 KB Output is correct
3 Correct 17 ms 24512 KB Output is correct
4 Correct 14 ms 23756 KB Output is correct
5 Correct 15 ms 23844 KB Output is correct
6 Correct 17 ms 24140 KB Output is correct
7 Correct 16 ms 24344 KB Output is correct
8 Correct 15 ms 24012 KB Output is correct
9 Correct 18 ms 24440 KB Output is correct
10 Correct 18 ms 24512 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 468 ms 47132 KB Output is correct
2 Correct 1515 ms 103968 KB Output is correct
3 Correct 1179 ms 119528 KB Output is correct
4 Correct 1226 ms 68836 KB Output is correct
5 Correct 1259 ms 68748 KB Output is correct
6 Correct 1175 ms 67688 KB Output is correct
7 Correct 1100 ms 118928 KB Output is correct
8 Correct 2093 ms 117204 KB Output is correct
9 Correct 2148 ms 123544 KB Output is correct
10 Correct 898 ms 67504 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 17 ms 24400 KB Output is correct
3 Correct 17 ms 24512 KB Output is correct
4 Correct 14 ms 23756 KB Output is correct
5 Correct 15 ms 23844 KB Output is correct
6 Correct 17 ms 24140 KB Output is correct
7 Correct 16 ms 24344 KB Output is correct
8 Correct 15 ms 24012 KB Output is correct
9 Correct 18 ms 24440 KB Output is correct
10 Correct 18 ms 24512 KB Output is correct
11 Correct 19 ms 24516 KB Output is correct
12 Correct 20 ms 24964 KB Output is correct
13 Correct 21 ms 24968 KB Output is correct
14 Correct 17 ms 24820 KB Output is correct
15 Correct 19 ms 25460 KB Output is correct
16 Correct 19 ms 24232 KB Output is correct
17 Correct 23 ms 25012 KB Output is correct
18 Correct 25 ms 25756 KB Output is correct
19 Correct 20 ms 24268 KB Output is correct
20 Correct 21 ms 24908 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 17 ms 24400 KB Output is correct
3 Correct 17 ms 24512 KB Output is correct
4 Correct 14 ms 23756 KB Output is correct
5 Correct 15 ms 23844 KB Output is correct
6 Correct 17 ms 24140 KB Output is correct
7 Correct 16 ms 24344 KB Output is correct
8 Correct 15 ms 24012 KB Output is correct
9 Correct 18 ms 24440 KB Output is correct
10 Correct 18 ms 24512 KB Output is correct
11 Correct 19 ms 24516 KB Output is correct
12 Correct 20 ms 24964 KB Output is correct
13 Correct 21 ms 24968 KB Output is correct
14 Correct 17 ms 24820 KB Output is correct
15 Correct 19 ms 25460 KB Output is correct
16 Correct 19 ms 24232 KB Output is correct
17 Correct 23 ms 25012 KB Output is correct
18 Correct 25 ms 25756 KB Output is correct
19 Correct 20 ms 24268 KB Output is correct
20 Correct 21 ms 24908 KB Output is correct
21 Correct 35 ms 25508 KB Output is correct
22 Correct 44 ms 26428 KB Output is correct
23 Correct 55 ms 27216 KB Output is correct
24 Correct 68 ms 31812 KB Output is correct
25 Correct 36 ms 31020 KB Output is correct
26 Correct 71 ms 32560 KB Output is correct
27 Correct 62 ms 27716 KB Output is correct
28 Correct 64 ms 32780 KB Output is correct
29 Correct 63 ms 32420 KB Output is correct
30 Correct 72 ms 28292 KB Output is correct

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 17 ms 24400 KB Output is correct
3 Correct 17 ms 24512 KB Output is correct
4 Correct 14 ms 23756 KB Output is correct
5 Correct 15 ms 23844 KB Output is correct
6 Correct 17 ms 24140 KB Output is correct
7 Correct 16 ms 24344 KB Output is correct
8 Correct 15 ms 24012 KB Output is correct
9 Correct 18 ms 24440 KB Output is correct
10 Correct 18 ms 24512 KB Output is correct
11 Correct 468 ms 47132 KB Output is correct
12 Correct 1515 ms 103968 KB Output is correct
13 Correct 1179 ms 119528 KB Output is correct
14 Correct 1226 ms 68836 KB Output is correct
15 Correct 1259 ms 68748 KB Output is correct
16 Correct 1175 ms 67688 KB Output is correct
17 Correct 1100 ms 118928 KB Output is correct
18 Correct 2093 ms 117204 KB Output is correct
19 Correct 2148 ms 123544 KB Output is correct
20 Correct 898 ms 67504 KB Output is correct
21 Correct 19 ms 24516 KB Output is correct
22 Correct 20 ms 24964 KB Output is correct
23 Correct 21 ms 24968 KB Output is correct
24 Correct 17 ms 24820 KB Output is correct
25 Correct 19 ms 25460 KB Output is correct
26 Correct 19 ms 24232 KB Output is correct
27 Correct 23 ms 25012 KB Output is correct
28 Correct 25 ms 25756 KB Output is correct
29 Correct 20 ms 24268 KB Output is correct
30 Correct 21 ms 24908 KB Output is correct
31 Correct 35 ms 25508 KB Output is correct
32 Correct 44 ms 26428 KB Output is correct
33 Correct 55 ms 27216 KB Output is correct
34 Correct 68 ms 31812 KB Output is correct
35 Correct 36 ms 31020 KB Output is correct
36 Correct 71 ms 32560 KB Output is correct
37 Correct 62 ms 27716 KB Output is correct
38 Correct 64 ms 32780 KB Output is correct
39 Correct 63 ms 32420 KB Output is correct
40 Correct 72 ms 28292 KB Output is correct
41 Correct 242 ms 39192 KB Output is correct
42 Correct 1035 ms 97088 KB Output is correct
43 Correct 354 ms 90808 KB Output is correct
44 Correct 810 ms 115140 KB Output is correct
45 Correct 1095 ms 113076 KB Output is correct
46 Correct 816 ms 61696 KB Output is correct
47 Correct 1033 ms 62532 KB Output is correct
48 Correct 650 ms 108832 KB Output is correct
49 Correct 779 ms 63176 KB Output is correct
50 Correct 801 ms 62660 KB Output is correct
51 Correct 407 ms 83328 KB Output is correct
52 Correct 688 ms 97184 KB Output is correct
53 Correct 608 ms 109204 KB Output is correct
54 Correct 1871 ms 104544 KB Output is correct
55 Correct 1516 ms 111864 KB Output is correct