oj.uz

답안 #576090

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
576090 2022-06-12T09:59:19 Z benson1029 낙하산 고리들 (IOI12_rings) C++14
38 / 100
 4000 ms 58232 KB 
#include<bits/stdc++.h>
using namespace std;
int N;

vector<int> edg[1000005];
int DEG3 = -1;
int DEG4 = -1;
bool choicesToggle = false;
set<int> choices, tmp;
int dsu[1000005];
int cyc[1000005];
bool vis[1000005];
int pre[1000005];
int cyccnt = 0;
int GG = 0;
vector<int> undolist;

int find(int x) {
	if(dsu[x]==x)return x;
	return dsu[x] = find(dsu[x]);
}

void setintersection(set<int> tmp) {
	if(!choicesToggle) {
		choicesToggle = true;
		choices = tmp;
		return;
	}
	set<int> tmp2;
	for(int i:tmp) {
		if(choices.find(i)!=choices.end()) {
			tmp2.insert(i);
		}
	}
	choices = tmp2;
}

void dfs(int x, int p, int tar) {
	vis[x] = true;
	pre[x] = p;
	undolist.push_back(x);
	if(x==tar) {
		int ptr = pre[tar];
		tmp.clear();
		tmp.insert(tar);
		while(ptr != tar) {
			tmp.insert(ptr);
			ptr = pre[ptr];
		}
		setintersection(tmp);
		return;
	}
	for(int i:edg[x]) {
		if(i==p) continue;
		if(!vis[i]) dfs(i, x, tar);
	}
}

void merge(int x, int y) {
	if(find(x)==find(y)) {
		cyc[find(x)]++;
		if(!GG) dfs(x, y, y);
		for(int i:undolist) vis[i] = false;
		undolist.clear();
		if(cyc[find(x)]==2) {
			tmp.clear();
			for(int i:choices) {
				if(edg[i].size()>=3) tmp.insert(i);
			}
			choices = tmp;
		}
	} else {
		cyc[find(x)] += cyc[find(y)];
		dsu[find(y)] = find(x);
	}
}

void Init(int N_) {
	N = N_;
	for(int i=0; i<N; i++) dsu[i] = i;
}


void Link(int A, int B) {
	if(GG) return;
	edg[A].push_back(B);
	edg[B].push_back(A);
	merge(A, B);
	if(edg[A].size()==4) setintersection({A});
	else if(edg[A].size()==3) setintersection({A, edg[A][0], edg[A][1], edg[A][2]});
	if(edg[B].size()==4) setintersection({B});
	else if(edg[B].size()==3) setintersection({B, edg[B][0], edg[B][1], edg[B][2]});
}

int CountCritical() {
	if(GG) return 0;
	if(!choicesToggle) return N;
	else return choices.size();
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23952 KB Output is correct
3 Correct 14 ms 24048 KB Output is correct
4 Correct 14 ms 23828 KB Output is correct
5 Correct 15 ms 24456 KB Output is correct
6 Correct 17 ms 25120 KB Output is correct
7 Correct 13 ms 23780 KB Output is correct
8 Correct 14 ms 24248 KB Output is correct
9 Correct 15 ms 24020 KB Output is correct
10 Correct 14 ms 24020 KB Output is correct

Subtask #2
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 347 ms 45736 KB Output is correct
2 Correct 730 ms 56604 KB Output is correct
3 Execution timed out 4030 ms 58232 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23952 KB Output is correct
3 Correct 14 ms 24048 KB Output is correct
4 Correct 14 ms 23828 KB Output is correct
5 Correct 15 ms 24456 KB Output is correct
6 Correct 17 ms 25120 KB Output is correct
7 Correct 13 ms 23780 KB Output is correct
8 Correct 14 ms 24248 KB Output is correct
9 Correct 15 ms 24020 KB Output is correct
10 Correct 14 ms 24020 KB Output is correct
11 Correct 16 ms 24080 KB Output is correct
12 Correct 157 ms 25872 KB Output is correct
13 Correct 368 ms 26052 KB Output is correct
14 Correct 173 ms 24396 KB Output is correct
15 Correct 239 ms 24324 KB Output is correct
16 Correct 18 ms 24404 KB Output is correct
17 Correct 17 ms 24400 KB Output is correct
18 Correct 17 ms 24540 KB Output is correct
19 Correct 17 ms 24508 KB Output is correct
20 Correct 17 ms 24268 KB Output is correct

Subtask #4
0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23952 KB Output is correct
3 Correct 14 ms 24048 KB Output is correct
4 Correct 14 ms 23828 KB Output is correct
5 Correct 15 ms 24456 KB Output is correct
6 Correct 17 ms 25120 KB Output is correct
7 Correct 13 ms 23780 KB Output is correct
8 Correct 14 ms 24248 KB Output is correct
9 Correct 15 ms 24020 KB Output is correct
10 Correct 14 ms 24020 KB Output is correct
11 Correct 16 ms 24080 KB Output is correct
12 Correct 157 ms 25872 KB Output is correct
13 Correct 368 ms 26052 KB Output is correct
14 Correct 173 ms 24396 KB Output is correct
15 Correct 239 ms 24324 KB Output is correct
16 Correct 18 ms 24404 KB Output is correct
17 Correct 17 ms 24400 KB Output is correct
18 Correct 17 ms 24540 KB Output is correct
19 Correct 17 ms 24508 KB Output is correct
20 Correct 17 ms 24268 KB Output is correct
21 Correct 34 ms 25560 KB Output is correct
22 Correct 36 ms 26572 KB Output is correct
23 Correct 44 ms 27432 KB Output is correct
24 Execution timed out 4056 ms 27592 KB Time limit exceeded
25 Halted 0 ms 0 KB -

Subtask #5
0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 23764 KB Output is correct
2 Correct 14 ms 23952 KB Output is correct
3 Correct 14 ms 24048 KB Output is correct
4 Correct 14 ms 23828 KB Output is correct
5 Correct 15 ms 24456 KB Output is correct
6 Correct 17 ms 25120 KB Output is correct
7 Correct 13 ms 23780 KB Output is correct
8 Correct 14 ms 24248 KB Output is correct
9 Correct 15 ms 24020 KB Output is correct
10 Correct 14 ms 24020 KB Output is correct
11 Correct 347 ms 45736 KB Output is correct
12 Correct 730 ms 56604 KB Output is correct
13 Execution timed out 4030 ms 58232 KB Time limit exceeded
14 Halted 0 ms 0 KB -