oj.uz

답안 #446554

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446554 2021-07-22T12:11:50 Z ComPhyPark 낙하산 고리들 (IOI12_rings) C++14
100 / 100
 3735 ms 123612 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];
	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) {
		if (ifDebug)printf("init(%d)\n", X);
		init();
		x = X;
		PR();
		for (int i = 0; i < n; i++) {
			for (int e : l[i]) {
				if (e > i) {
					if (e == x || i == x) {
						isCX[e + i - x] = true;
						continue;
					}
					int a = f(e), b = f(i);
					if (a != b) {
						p[b] = a;
						ln[a] += ln[b];
						sz[a] += sz[b];
					}
					ln[a]++;
				}
			}
			st[min(gC(i), 3)]++;
			if (gC(i) > 2)is3E[f(i)] = true;
		}
		for (int 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);
		if (x == n) {
			st[min(gC(A), 3)]--;
			l[A].push_back(B);
			st[min(gC(A), 3)]++;
		}
		else {
			st[min(gC(A) - 1, 3)]--;
			st[min(gC(A), 3)]++;
		}
		if (gC(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) {
			isCX[A + B - x] = true;
			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);
		printf("%d %d %d %d\n", st[0], st[1], st[2], st[3]);
		printf("%d %d %d\n", ts[0], ts[1], ts[2]);
		for (int a = 0; a < n; a++) {
			printf("(%d)", gC(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, GV[4];
int GS;
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 < GS; 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]) {
		if (ifDebug)printf("!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!");
		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]) {
		if (ifDebug)printf(">=3 Exists");
		int r = 0;
		for (int i = 0; i < GS; 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:153:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  153 |   for (int i = 0; i < l[a].size(); i++) {
      |                   ~~^~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 18 ms 24376 KB Output is correct
3 Correct 20 ms 24396 KB Output is correct
4 Correct 16 ms 23816 KB Output is correct
5 Correct 16 ms 23912 KB Output is correct
6 Correct 17 ms 23968 KB Output is correct
7 Correct 15 ms 24348 KB Output is correct
8 Correct 16 ms 23964 KB Output is correct
9 Correct 19 ms 24396 KB Output is correct
10 Correct 18 ms 24652 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 452 ms 47256 KB Output is correct
2 Correct 2406 ms 103856 KB Output is correct
3 Correct 3735 ms 119572 KB Output is correct
4 Correct 1135 ms 68892 KB Output is correct
5 Correct 1156 ms 68776 KB Output is correct
6 Correct 1102 ms 67884 KB Output is correct
7 Correct 3562 ms 119064 KB Output is correct
8 Correct 2373 ms 117268 KB Output is correct
9 Correct 2239 ms 123612 KB Output is correct
10 Correct 837 ms 67652 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 18 ms 24376 KB Output is correct
3 Correct 20 ms 24396 KB Output is correct
4 Correct 16 ms 23816 KB Output is correct
5 Correct 16 ms 23912 KB Output is correct
6 Correct 17 ms 23968 KB Output is correct
7 Correct 15 ms 24348 KB Output is correct
8 Correct 16 ms 23964 KB Output is correct
9 Correct 19 ms 24396 KB Output is correct
10 Correct 18 ms 24652 KB Output is correct
11 Correct 20 ms 24408 KB Output is correct
12 Correct 21 ms 24980 KB Output is correct
13 Correct 22 ms 24920 KB Output is correct
14 Correct 21 ms 24856 KB Output is correct
15 Correct 22 ms 25420 KB Output is correct
16 Correct 20 ms 24268 KB Output is correct
17 Correct 27 ms 24988 KB Output is correct
18 Correct 25 ms 25676 KB Output is correct
19 Correct 22 ms 24268 KB Output is correct
20 Correct 24 ms 24968 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 18 ms 24376 KB Output is correct
3 Correct 20 ms 24396 KB Output is correct
4 Correct 16 ms 23816 KB Output is correct
5 Correct 16 ms 23912 KB Output is correct
6 Correct 17 ms 23968 KB Output is correct
7 Correct 15 ms 24348 KB Output is correct
8 Correct 16 ms 23964 KB Output is correct
9 Correct 19 ms 24396 KB Output is correct
10 Correct 18 ms 24652 KB Output is correct
11 Correct 20 ms 24408 KB Output is correct
12 Correct 21 ms 24980 KB Output is correct
13 Correct 22 ms 24920 KB Output is correct
14 Correct 21 ms 24856 KB Output is correct
15 Correct 22 ms 25420 KB Output is correct
16 Correct 20 ms 24268 KB Output is correct
17 Correct 27 ms 24988 KB Output is correct
18 Correct 25 ms 25676 KB Output is correct
19 Correct 22 ms 24268 KB Output is correct
20 Correct 24 ms 24968 KB Output is correct
21 Correct 33 ms 25492 KB Output is correct
22 Correct 46 ms 26512 KB Output is correct
23 Correct 54 ms 27204 KB Output is correct
24 Correct 134 ms 31852 KB Output is correct
25 Correct 42 ms 31088 KB Output is correct
26 Correct 118 ms 32580 KB Output is correct
27 Correct 62 ms 27648 KB Output is correct
28 Correct 152 ms 32908 KB Output is correct
29 Correct 88 ms 32428 KB Output is correct
30 Correct 77 ms 28228 KB Output is correct

Subtask #5
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 23756 KB Output is correct
2 Correct 18 ms 24376 KB Output is correct
3 Correct 20 ms 24396 KB Output is correct
4 Correct 16 ms 23816 KB Output is correct
5 Correct 16 ms 23912 KB Output is correct
6 Correct 17 ms 23968 KB Output is correct
7 Correct 15 ms 24348 KB Output is correct
8 Correct 16 ms 23964 KB Output is correct
9 Correct 19 ms 24396 KB Output is correct
10 Correct 18 ms 24652 KB Output is correct
11 Correct 452 ms 47256 KB Output is correct
12 Correct 2406 ms 103856 KB Output is correct
13 Correct 3735 ms 119572 KB Output is correct
14 Correct 1135 ms 68892 KB Output is correct
15 Correct 1156 ms 68776 KB Output is correct
16 Correct 1102 ms 67884 KB Output is correct
17 Correct 3562 ms 119064 KB Output is correct
18 Correct 2373 ms 117268 KB Output is correct
19 Correct 2239 ms 123612 KB Output is correct
20 Correct 837 ms 67652 KB Output is correct
21 Correct 20 ms 24408 KB Output is correct
22 Correct 21 ms 24980 KB Output is correct
23 Correct 22 ms 24920 KB Output is correct
24 Correct 21 ms 24856 KB Output is correct
25 Correct 22 ms 25420 KB Output is correct
26 Correct 20 ms 24268 KB Output is correct
27 Correct 27 ms 24988 KB Output is correct
28 Correct 25 ms 25676 KB Output is correct
29 Correct 22 ms 24268 KB Output is correct
30 Correct 24 ms 24968 KB Output is correct
31 Correct 33 ms 25492 KB Output is correct
32 Correct 46 ms 26512 KB Output is correct
33 Correct 54 ms 27204 KB Output is correct
34 Correct 134 ms 31852 KB Output is correct
35 Correct 42 ms 31088 KB Output is correct
36 Correct 118 ms 32580 KB Output is correct
37 Correct 62 ms 27648 KB Output is correct
38 Correct 152 ms 32908 KB Output is correct
39 Correct 88 ms 32428 KB Output is correct
40 Correct 77 ms 28228 KB Output is correct
41 Correct 246 ms 39176 KB Output is correct
42 Correct 1020 ms 97188 KB Output is correct
43 Correct 491 ms 90756 KB Output is correct
44 Correct 2363 ms 115288 KB Output is correct
45 Correct 2479 ms 113136 KB Output is correct
46 Correct 783 ms 61764 KB Output is correct
47 Correct 986 ms 62356 KB Output is correct
48 Correct 1255 ms 108988 KB Output is correct
49 Correct 726 ms 63048 KB Output is correct
50 Correct 801 ms 62640 KB Output is correct
51 Correct 628 ms 83272 KB Output is correct
52 Correct 1960 ms 97292 KB Output is correct
53 Correct 1309 ms 109460 KB Output is correct
54 Correct 2249 ms 104680 KB Output is correct
55 Correct 3061 ms 112168 KB Output is correct