oj.uz

Submission #444661

# Submission time Handle Problem Language Result Execution time Memory
444661 2021-07-14T14:18:52 Z ComPhyPark Parachute rings (IOI12_rings) C++14
100 / 100
 3324 ms 168196 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;
const bool ifDebug = false;
int cycleNum;
vector<int>l[SZ];
typedef struct Graph {
	int st[4], ts[3];
	int p[SZ], sz[SZ], ln[SZ], c[SZ];
	bool is3E[SZ];
	int x;
	bool isMain;
	void init() {
		x = n;
		isMain = true;
		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] = c[i] = 0;
			is3E[i] = false;
		}
	}
	void init(int X) {
		if (ifDebug)printf("init(%d)\n", X);
		init();
		isMain = false;
		x = X;
		PR();
		for (int i = 0; i < n; i++) {
			for (int e : l[i]) {
				if (e < i)Link(e, i);
			}
		}
	}
	int f(int a) {
		return a == p[a] ? a : p[a] = f(p[a]);
	}
	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);
		st[min(c[A], 3)]--;
		if (isMain)l[A].push_back(B);
		c[A]++;
		st[min(c[A], 3)]++;
		if (c[A] >= 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)return;
		if (ifDebug)printf("%d:%d-%d\n", x, A, B);
		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);
	}
	void PR() {
		if (!ifDebug)return;
		printf("-------%d-------\n", x);
		for (int a = 0; a < n; a++) {
			printf("(%d)", c[a]);
			if (a == p[a]) {
				printf("[%d(%d,%d,%d)]", a, sz[a], gT(a),ln[a]);
				printf("\n");
			}
			else {
				printf("%d->%d\n", a, f(a));
			}
		}
		printf("-----------------\n");
	}
}Graph;
Graph MG;
vector<Graph>GV;
//type: 0-chain/1-cycle/2-3 exists/3-4 exists
void Init(int N) {
	cycleNum = n = N;
	MG.init();
}
void Link(int A, int B) {
	bool p = (MG.st[3] == 0);
	MG.Link(A, B);
	for (int i = 0; i < GV.size(); i++) {
		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]) {
		int a = A;
		if (l[A].size() < 3)a = B;
		GV.resize(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]) {
		if (ifDebug)printf(">=3 Exists");
		int r = 0;
		for (int i = 0; i < GV.size(); i++) {
			if (GV[i].isChain())r++;
		}
		return r;
	}
	else if (MG.ts[1]) {
		if (ifDebug)printf("cycle Exists");
		if (MG.ts[1] > 1)return 0;
		return MG.sz[cycleNum];
	}
	else {
		if (ifDebug)printf("Already Chain");
		return n;
	}
}

Compilation message

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

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23776 KB Output is correct
2 Correct 61 ms 107316 KB Output is correct
3 Correct 65 ms 107252 KB Output is correct
4 Correct 16 ms 23764 KB Output is correct
5 Correct 18 ms 23884 KB Output is correct
6 Correct 16 ms 24076 KB Output is correct
7 Correct 61 ms 106976 KB Output is correct
8 Correct 15 ms 24020 KB Output is correct
9 Correct 59 ms 107244 KB Output is correct
10 Correct 59 ms 107188 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 442 ms 49612 KB Output is correct
2 Correct 2341 ms 146156 KB Output is correct
3 Correct 3324 ms 163412 KB Output is correct
4 Correct 1151 ms 85000 KB Output is correct
5 Correct 1147 ms 85104 KB Output is correct
6 Correct 1104 ms 83580 KB Output is correct
7 Correct 3284 ms 162316 KB Output is correct
8 Correct 2629 ms 164520 KB Output is correct
9 Correct 2670 ms 168196 KB Output is correct
10 Correct 846 ms 83128 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23776 KB Output is correct
2 Correct 61 ms 107316 KB Output is correct
3 Correct 65 ms 107252 KB Output is correct
4 Correct 16 ms 23764 KB Output is correct
5 Correct 18 ms 23884 KB Output is correct
6 Correct 16 ms 24076 KB Output is correct
7 Correct 61 ms 106976 KB Output is correct
8 Correct 15 ms 24020 KB Output is correct
9 Correct 59 ms 107244 KB Output is correct
10 Correct 59 ms 107188 KB Output is correct
11 Correct 62 ms 107248 KB Output is correct
12 Correct 67 ms 107556 KB Output is correct
13 Correct 75 ms 107496 KB Output is correct
14 Correct 71 ms 107368 KB Output is correct
15 Correct 64 ms 107552 KB Output is correct
16 Correct 20 ms 24428 KB Output is correct
17 Correct 66 ms 107460 KB Output is correct
18 Correct 69 ms 107844 KB Output is correct
19 Correct 23 ms 24312 KB Output is correct
20 Correct 64 ms 107548 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23776 KB Output is correct
2 Correct 61 ms 107316 KB Output is correct
3 Correct 65 ms 107252 KB Output is correct
4 Correct 16 ms 23764 KB Output is correct
5 Correct 18 ms 23884 KB Output is correct
6 Correct 16 ms 24076 KB Output is correct
7 Correct 61 ms 106976 KB Output is correct
8 Correct 15 ms 24020 KB Output is correct
9 Correct 59 ms 107244 KB Output is correct
10 Correct 59 ms 107188 KB Output is correct
11 Correct 62 ms 107248 KB Output is correct
12 Correct 67 ms 107556 KB Output is correct
13 Correct 75 ms 107496 KB Output is correct
14 Correct 71 ms 107368 KB Output is correct
15 Correct 64 ms 107552 KB Output is correct
16 Correct 20 ms 24428 KB Output is correct
17 Correct 66 ms 107460 KB Output is correct
18 Correct 69 ms 107844 KB Output is correct
19 Correct 23 ms 24312 KB Output is correct
20 Correct 64 ms 107548 KB Output is correct
21 Correct 34 ms 26012 KB Output is correct
22 Correct 47 ms 27304 KB Output is correct
23 Correct 59 ms 28248 KB Output is correct
24 Correct 176 ms 110868 KB Output is correct
25 Correct 78 ms 109124 KB Output is correct
26 Correct 150 ms 111520 KB Output is correct
27 Correct 63 ms 28968 KB Output is correct
28 Correct 195 ms 112312 KB Output is correct
29 Correct 136 ms 110916 KB Output is correct
30 Correct 88 ms 29636 KB Output is correct

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23776 KB Output is correct
2 Correct 61 ms 107316 KB Output is correct
3 Correct 65 ms 107252 KB Output is correct
4 Correct 16 ms 23764 KB Output is correct
5 Correct 18 ms 23884 KB Output is correct
6 Correct 16 ms 24076 KB Output is correct
7 Correct 61 ms 106976 KB Output is correct
8 Correct 15 ms 24020 KB Output is correct
9 Correct 59 ms 107244 KB Output is correct
10 Correct 59 ms 107188 KB Output is correct
11 Correct 442 ms 49612 KB Output is correct
12 Correct 2341 ms 146156 KB Output is correct
13 Correct 3324 ms 163412 KB Output is correct
14 Correct 1151 ms 85000 KB Output is correct
15 Correct 1147 ms 85104 KB Output is correct
16 Correct 1104 ms 83580 KB Output is correct
17 Correct 3284 ms 162316 KB Output is correct
18 Correct 2629 ms 164520 KB Output is correct
19 Correct 2670 ms 168196 KB Output is correct
20 Correct 846 ms 83128 KB Output is correct
21 Correct 62 ms 107248 KB Output is correct
22 Correct 67 ms 107556 KB Output is correct
23 Correct 75 ms 107496 KB Output is correct
24 Correct 71 ms 107368 KB Output is correct
25 Correct 64 ms 107552 KB Output is correct
26 Correct 20 ms 24428 KB Output is correct
27 Correct 66 ms 107460 KB Output is correct
28 Correct 69 ms 107844 KB Output is correct
29 Correct 23 ms 24312 KB Output is correct
30 Correct 64 ms 107548 KB Output is correct
31 Correct 34 ms 26012 KB Output is correct
32 Correct 47 ms 27304 KB Output is correct
33 Correct 59 ms 28248 KB Output is correct
34 Correct 176 ms 110868 KB Output is correct
35 Correct 78 ms 109124 KB Output is correct
36 Correct 150 ms 111520 KB Output is correct
37 Correct 63 ms 28968 KB Output is correct
38 Correct 195 ms 112312 KB Output is correct
39 Correct 136 ms 110916 KB Output is correct
40 Correct 88 ms 29636 KB Output is correct
41 Correct 245 ms 44208 KB Output is correct
42 Correct 1137 ms 143644 KB Output is correct
43 Correct 437 ms 129352 KB Output is correct
44 Correct 2133 ms 162388 KB Output is correct
45 Correct 2273 ms 153584 KB Output is correct
46 Correct 798 ms 75528 KB Output is correct
47 Correct 999 ms 76488 KB Output is correct
48 Correct 1132 ms 146468 KB Output is correct
49 Correct 761 ms 76464 KB Output is correct
50 Correct 791 ms 76028 KB Output is correct
51 Correct 587 ms 129136 KB Output is correct
52 Correct 1795 ms 152468 KB Output is correct
53 Correct 1195 ms 146744 KB Output is correct
54 Correct 2367 ms 157492 KB Output is correct
55 Correct 2686 ms 161616 KB Output is correct