oj.uz

답안 #443943

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443943 2021-07-12T14:15:52 Z ComPhyPark 낙하산 고리들 (IOI12_rings) C++14
52 / 100
 4000 ms 195952 KB 
#include<cstdio>
#include<vector>
#include<set>
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<vector<int>>l;
typedef struct Graph {
	int st[4], ts[3];
	int p[SZ], sz[SZ], cs[SZ][4], c[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;
			cs[i][0] = sz[i] = 1;
			cs[i][1] = cs[i][2] = cs[i][3] = c[i] = 0;
		}
	}
	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) {
		vector<int>v;
		while (a != p[a]) {
			v.push_back(a);
			a = p[a];
		}
		for (int e : v)p[e] = a;
		return 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)]--;
			for (int i = 0; i < 4; i++) {
				cs[a][i] += cs[b][i];
			}
			sz[a] += sz[b];
		}
		else {
			ts[gT(a)]--;
		}
	}
	void Con(int A, int B) {
		int a = f(A);
		cs[a][min(c[A], 3)]--;
		st[min(c[A], 3)]--;
		if(isMain)l[A].push_back(B);
		c[A]++;
		cs[a][min(c[A], 3)]++;
		st[min(c[A], 3)]++;
	}
	int gT(int a) {
		if (cs[a][3]) {
			return 2;
		}
		else if (cs[a][2] && (cs[a][1] + cs[a][0] == 0)) {
			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);
		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)]", a, sz[a], gT(a));
				for (int b = 0; b < 4; b++)printf(" %d", cs[a][b]);
				printf("\n");
			}
			else {
				printf("%d->%d\n", a, f(a));
			}
		}
		printf("-----------------\n");
	}
}Graph;
Graph MG, GV[4];
int GS;
//type: 0-chain/1-cycle/2-3 exists/3-4 exists
void Init(int N) {
	l.resize(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("걸렸구나!!!!!!!!!\n");
		int a = A;
		if (l[A].size() < 3)a = B;
		GV[GS++].init(a);
		//return;
		for (int e : l[a]) {
			GV[GS++].init(e);
		}
	}
}
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;
	}
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 7 ms 1228 KB Output is correct
3 Correct 9 ms 1484 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 8 ms 1444 KB Output is correct
10 Correct 8 ms 1484 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 609 ms 43116 KB Output is correct
2 Correct 3875 ms 153832 KB Output is correct
3 Execution timed out 4094 ms 195952 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 7 ms 1228 KB Output is correct
3 Correct 9 ms 1484 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 8 ms 1444 KB Output is correct
10 Correct 8 ms 1484 KB Output is correct
11 Correct 8 ms 1484 KB Output is correct
12 Correct 15 ms 2516 KB Output is correct
13 Correct 16 ms 2496 KB Output is correct
14 Correct 14 ms 2252 KB Output is correct
15 Correct 15 ms 3832 KB Output is correct
16 Correct 7 ms 1228 KB Output is correct
17 Correct 15 ms 2460 KB Output is correct
18 Correct 18 ms 4172 KB Output is correct
19 Correct 7 ms 1276 KB Output is correct
20 Correct 16 ms 2508 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 7 ms 1228 KB Output is correct
3 Correct 9 ms 1484 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 8 ms 1444 KB Output is correct
10 Correct 8 ms 1484 KB Output is correct
11 Correct 8 ms 1484 KB Output is correct
12 Correct 15 ms 2516 KB Output is correct
13 Correct 16 ms 2496 KB Output is correct
14 Correct 14 ms 2252 KB Output is correct
15 Correct 15 ms 3832 KB Output is correct
16 Correct 7 ms 1228 KB Output is correct
17 Correct 15 ms 2460 KB Output is correct
18 Correct 18 ms 4172 KB Output is correct
19 Correct 7 ms 1276 KB Output is correct
20 Correct 16 ms 2508 KB Output is correct
21 Correct 27 ms 4168 KB Output is correct
22 Correct 42 ms 6584 KB Output is correct
23 Correct 61 ms 8272 KB Output is correct
24 Correct 196 ms 17616 KB Output is correct
25 Correct 38 ms 16836 KB Output is correct
26 Correct 170 ms 18772 KB Output is correct
27 Correct 81 ms 8520 KB Output is correct
28 Correct 215 ms 18424 KB Output is correct
29 Correct 115 ms 18628 KB Output is correct
30 Correct 84 ms 9576 KB Output is correct

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 7 ms 1228 KB Output is correct
3 Correct 9 ms 1484 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 2 ms 588 KB Output is correct
6 Correct 4 ms 716 KB Output is correct
7 Correct 2 ms 1228 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 8 ms 1444 KB Output is correct
10 Correct 8 ms 1484 KB Output is correct
11 Correct 609 ms 43116 KB Output is correct
12 Correct 3875 ms 153832 KB Output is correct
13 Execution timed out 4094 ms 195952 KB Time limit exceeded
14 Halted 0 ms 0 KB -