oj.uz

답안 #443819

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
443819 2021-07-12T07:00:34 Z ComPhyPark 낙하산 고리들 (IOI12_rings) C++14
52 / 100
 1006 ms 262148 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;
typedef struct Graph {
	vector<vector<int>>l, cs;
	int st[5], ts[3];
	vector<int>p, sz;
	int x;
	void init() {
		x = n;
		l.resize(n);
		p.resize(n);
		sz.resize(n);
		cs.resize(n);
		st[0] = ts[0] = n;
		st[1] = st[2] = st[3] = st[4] = ts[1] = ts[2] = 0;
		for (int i = 0; i < n; i++) {
			p[i] = i;
			cs[i].resize(5);
			cs[i][0] = sz[i] = 1;
		}
	}
	void init(int X, Graph* G) {
		init();
		x = X;
		for (int i = 0; i < n; i++) {
			for (int e : (*G).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 < 5; 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(l[A].size(), 4)]--;
		st[min(l[A].size(), 4)]--;
		l[A].push_back(B);
		cs[a][min(l[A].size(), 4)]++;
		st[min(l[A].size(), 4)]++;
	}
	int gT(int a) {
		if (cs[a][4] + 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;
		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++) {
			if (a == p[a]) {
				printf("[%d(%d,%d)]", a, sz[a], gT(a));
				for (int b = 0; b < 5; 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) {
	cycleNum = n = N;
	MG.init();
}
void Link(int A, int B) {
	bool p = (MG.st[3] + MG.st[4] == 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 (MG.l[A].size() < 3)a = B;
		GV[GS++].init(a, &MG);
		//return;
		for (int e : MG.l[a]) {
			GV[GS++].init(e, &MG);
		}
	}
}
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 12 ms 2764 KB Output is correct
3 Correct 16 ms 3172 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 844 KB Output is correct
7 Correct 4 ms 2508 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 16 ms 3304 KB Output is correct
10 Correct 15 ms 3276 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 701 ms 61268 KB Output is correct
2 Runtime error 1006 ms 262148 KB Execution killed with signal 9
3 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 12 ms 2764 KB Output is correct
3 Correct 16 ms 3172 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 844 KB Output is correct
7 Correct 4 ms 2508 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 16 ms 3304 KB Output is correct
10 Correct 15 ms 3276 KB Output is correct
11 Correct 16 ms 3312 KB Output is correct
12 Correct 27 ms 6220 KB Output is correct
13 Correct 32 ms 6252 KB Output is correct
14 Correct 31 ms 5536 KB Output is correct
15 Correct 35 ms 9608 KB Output is correct
16 Correct 8 ms 1616 KB Output is correct
17 Correct 35 ms 6152 KB Output is correct
18 Correct 55 ms 10940 KB Output is correct
19 Correct 8 ms 1612 KB Output is correct
20 Correct 32 ms 6288 KB Output is correct

Subtask #4
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 12 ms 2764 KB Output is correct
3 Correct 16 ms 3172 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 844 KB Output is correct
7 Correct 4 ms 2508 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 16 ms 3304 KB Output is correct
10 Correct 15 ms 3276 KB Output is correct
11 Correct 16 ms 3312 KB Output is correct
12 Correct 27 ms 6220 KB Output is correct
13 Correct 32 ms 6252 KB Output is correct
14 Correct 31 ms 5536 KB Output is correct
15 Correct 35 ms 9608 KB Output is correct
16 Correct 8 ms 1616 KB Output is correct
17 Correct 35 ms 6152 KB Output is correct
18 Correct 55 ms 10940 KB Output is correct
19 Correct 8 ms 1612 KB Output is correct
20 Correct 32 ms 6288 KB Output is correct
21 Correct 31 ms 5964 KB Output is correct
22 Correct 66 ms 9320 KB Output is correct
23 Correct 70 ms 11708 KB Output is correct
24 Correct 413 ms 48116 KB Output is correct
25 Correct 89 ms 44100 KB Output is correct
26 Correct 335 ms 52076 KB Output is correct
27 Correct 102 ms 11388 KB Output is correct
28 Correct 455 ms 53128 KB Output is correct
29 Correct 260 ms 51100 KB Output is correct
30 Correct 153 ms 12992 KB Output is correct

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 12 ms 2764 KB Output is correct
3 Correct 16 ms 3172 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 3 ms 588 KB Output is correct
6 Correct 4 ms 844 KB Output is correct
7 Correct 4 ms 2508 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 16 ms 3304 KB Output is correct
10 Correct 15 ms 3276 KB Output is correct
11 Correct 701 ms 61268 KB Output is correct
12 Runtime error 1006 ms 262148 KB Execution killed with signal 9
13 Halted 0 ms 0 KB -