oj.uz

답안 #446546

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
446546 2021-07-22T11:24:52 Z ComPhyPark 낙하산 고리들 (IOI12_rings) C++14
100 / 100
 3467 ms 168160 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

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 62 ms 107128 KB Output is correct
3 Correct 62 ms 107196 KB Output is correct
4 Correct 14 ms 23784 KB Output is correct
5 Correct 15 ms 23996 KB Output is correct
6 Correct 16 ms 24012 KB Output is correct
7 Correct 57 ms 106996 KB Output is correct
8 Correct 16 ms 24012 KB Output is correct
9 Correct 62 ms 107276 KB Output is correct
10 Correct 67 ms 107360 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 448 ms 48668 KB Output is correct
2 Correct 2413 ms 145424 KB Output is correct
3 Correct 3467 ms 163488 KB Output is correct
4 Correct 1154 ms 85084 KB Output is correct
5 Correct 1167 ms 85108 KB Output is correct
6 Correct 1117 ms 83600 KB Output is correct
7 Correct 3294 ms 162556 KB Output is correct
8 Correct 2687 ms 164512 KB Output is correct
9 Correct 2801 ms 168160 KB Output is correct
10 Correct 839 ms 83280 KB Output is correct

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 62 ms 107128 KB Output is correct
3 Correct 62 ms 107196 KB Output is correct
4 Correct 14 ms 23784 KB Output is correct
5 Correct 15 ms 23996 KB Output is correct
6 Correct 16 ms 24012 KB Output is correct
7 Correct 57 ms 106996 KB Output is correct
8 Correct 16 ms 24012 KB Output is correct
9 Correct 62 ms 107276 KB Output is correct
10 Correct 67 ms 107360 KB Output is correct
11 Correct 61 ms 107280 KB Output is correct
12 Correct 68 ms 107536 KB Output is correct
13 Correct 66 ms 107452 KB Output is correct
14 Correct 59 ms 107332 KB Output is correct
15 Correct 62 ms 107444 KB Output is correct
16 Correct 19 ms 24388 KB Output is correct
17 Correct 64 ms 107564 KB Output is correct
18 Correct 75 ms 107908 KB Output is correct
19 Correct 20 ms 24384 KB Output is correct
20 Correct 72 ms 107616 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 62 ms 107128 KB Output is correct
3 Correct 62 ms 107196 KB Output is correct
4 Correct 14 ms 23784 KB Output is correct
5 Correct 15 ms 23996 KB Output is correct
6 Correct 16 ms 24012 KB Output is correct
7 Correct 57 ms 106996 KB Output is correct
8 Correct 16 ms 24012 KB Output is correct
9 Correct 62 ms 107276 KB Output is correct
10 Correct 67 ms 107360 KB Output is correct
11 Correct 61 ms 107280 KB Output is correct
12 Correct 68 ms 107536 KB Output is correct
13 Correct 66 ms 107452 KB Output is correct
14 Correct 59 ms 107332 KB Output is correct
15 Correct 62 ms 107444 KB Output is correct
16 Correct 19 ms 24388 KB Output is correct
17 Correct 64 ms 107564 KB Output is correct
18 Correct 75 ms 107908 KB Output is correct
19 Correct 20 ms 24384 KB Output is correct
20 Correct 72 ms 107616 KB Output is correct
21 Correct 32 ms 26044 KB Output is correct
22 Correct 45 ms 27456 KB Output is correct
23 Correct 68 ms 28276 KB Output is correct
24 Correct 168 ms 110916 KB Output is correct
25 Correct 79 ms 109152 KB Output is correct
26 Correct 160 ms 111520 KB Output is correct
27 Correct 62 ms 28884 KB Output is correct
28 Correct 191 ms 112284 KB Output is correct
29 Correct 136 ms 110812 KB Output is correct
30 Correct 80 ms 29704 KB Output is correct

Subtask #5
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 14 ms 23756 KB Output is correct
2 Correct 62 ms 107128 KB Output is correct
3 Correct 62 ms 107196 KB Output is correct
4 Correct 14 ms 23784 KB Output is correct
5 Correct 15 ms 23996 KB Output is correct
6 Correct 16 ms 24012 KB Output is correct
7 Correct 57 ms 106996 KB Output is correct
8 Correct 16 ms 24012 KB Output is correct
9 Correct 62 ms 107276 KB Output is correct
10 Correct 67 ms 107360 KB Output is correct
11 Correct 448 ms 48668 KB Output is correct
12 Correct 2413 ms 145424 KB Output is correct
13 Correct 3467 ms 163488 KB Output is correct
14 Correct 1154 ms 85084 KB Output is correct
15 Correct 1167 ms 85108 KB Output is correct
16 Correct 1117 ms 83600 KB Output is correct
17 Correct 3294 ms 162556 KB Output is correct
18 Correct 2687 ms 164512 KB Output is correct
19 Correct 2801 ms 168160 KB Output is correct
20 Correct 839 ms 83280 KB Output is correct
21 Correct 61 ms 107280 KB Output is correct
22 Correct 68 ms 107536 KB Output is correct
23 Correct 66 ms 107452 KB Output is correct
24 Correct 59 ms 107332 KB Output is correct
25 Correct 62 ms 107444 KB Output is correct
26 Correct 19 ms 24388 KB Output is correct
27 Correct 64 ms 107564 KB Output is correct
28 Correct 75 ms 107908 KB Output is correct
29 Correct 20 ms 24384 KB Output is correct
30 Correct 72 ms 107616 KB Output is correct
31 Correct 32 ms 26044 KB Output is correct
32 Correct 45 ms 27456 KB Output is correct
33 Correct 68 ms 28276 KB Output is correct
34 Correct 168 ms 110916 KB Output is correct
35 Correct 79 ms 109152 KB Output is correct
36 Correct 160 ms 111520 KB Output is correct
37 Correct 62 ms 28884 KB Output is correct
38 Correct 191 ms 112284 KB Output is correct
39 Correct 136 ms 110812 KB Output is correct
40 Correct 80 ms 29704 KB Output is correct
41 Correct 235 ms 44192 KB Output is correct
42 Correct 1194 ms 143932 KB Output is correct
43 Correct 450 ms 129412 KB Output is correct
44 Correct 2184 ms 162576 KB Output is correct
45 Correct 2315 ms 153628 KB Output is correct
46 Correct 780 ms 75552 KB Output is correct
47 Correct 980 ms 76424 KB Output is correct
48 Correct 1165 ms 146528 KB Output is correct
49 Correct 739 ms 76504 KB Output is correct
50 Correct 817 ms 75876 KB Output is correct
51 Correct 617 ms 129168 KB Output is correct
52 Correct 1789 ms 152344 KB Output is correct
53 Correct 1189 ms 146756 KB Output is correct
54 Correct 2415 ms 157428 KB Output is correct
55 Correct 2799 ms 161488 KB Output is correct