Submission #62437

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
62437	2018-07-28T13:05:08 Z	zadrga	Parachute rings (IOI12_rings)	C++14	55 / 100	4000 ms	107932 KB

rings

#include <bits/stdc++.h>

using namespace std;
 
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define INF (1LL << 55)
#define MOD (1000 * 1000 * 1000 + 7)
#define maxn 1000111
 
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
 
int n, cnt;
int deg[maxn], dep[maxn];
bool edge[maxn], found;
 
vector<int> cycles;
vector<pii> adj[maxn];
 
void Init(int N) {
	n = N;
	for(int i = 0; i < maxn; i++){
		deg[i] = 0;
		adj[i].clear();
	}
}
 
void Link(int A, int B){
	deg[A]++;
	deg[B]++;
	adj[A].pb(mp(B, ++cnt));
	adj[B].pb(mp(A, cnt));
}
 
void DFS(int x, int p){
	if(found)
		return;
 
	for(pii v : adj[x]){
		if(found || v.fi == p || edge[v.se])
			continue;	
 
		if(dep[v.fi]){
			cycles.pb(dep[x] - dep[v.fi] + 1);
			found = 1;
		}
 
		if(!dep[v.fi]){
			dep[v.fi] = dep[x] + 1;
			DFS(v.fi, x);
		}
	}
}
 
void checkCycles(){
	cycles.clear();
	memset(dep, 0, sizeof(dep));
 
	for(int i = 0; i < n; i++){
		if(cycles.size() >= 2)
			return;
 
		if(!dep[i]){
			found = 0;
			dep[i] = 1;
			DFS(i, -1);
		}
	}
}
 
bool check(int x){
	for(pii v : adj[x]){
		edge[v.se] = 1;
		deg[v.fi]--;
	}
 
	bool ret = 1;
	for(int i = 0; i < n; i++){
		if(i != x && deg[i] > 2){
			ret = 0;
			break;
		}
	}
 
	if(ret)
		checkCycles();
 
	ret &= (cycles.size() == 0);
 
	for(pii v : adj[x]){
		edge[v.se] = 0;
		deg[v.fi]++;
	}
	return ret;
}
 
int CountCritical(){ 
	int sz[5], v[5];
	memset(sz, 0, sizeof(sz));
	
	int max_degree = 0;
	for(int i = 0; i < n; i++){
		int cur = min(deg[i], 4);
		max_degree = max(max_degree, cur);
		v[cur] = i;
		sz[cur]++;
	}
 
	if(max_degree <= 1)
		return n;
 
	if(max_degree == 2){
		checkCycles();
		if(cycles.size() > 1)
			return 0;
 
		if(cycles.size() == 1)
			return cycles[0];
 
		return n;
	}
 
	if(max_degree == 3){
		int ans = check(v[3]);
		for(pii x : adj[v[3]])
			ans += check(x.fi);
 
		return ans;
	}
 
	if(max_degree == 4){
		if(sz[4] > 1)
			return 0;
 
		int ans = check(v[4]);
		return ans;
	}
}

Compilation message

rings.cpp: In function 'int CountCritical()':
rings.cpp:142:1: warning: control reaches end of non-void function [-Wreturn-type]
 }
 ^

Subtask #1
20.0 / 20.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	31608 KB	Output is correct
2	Correct	34 ms	31860 KB	Output is correct
3	Correct	33 ms	31912 KB	Output is correct
4	Correct	32 ms	31912 KB	Output is correct
5	Correct	32 ms	32100 KB	Output is correct
6	Correct	35 ms	32288 KB	Output is correct
7	Correct	29 ms	32288 KB	Output is correct
8	Correct	33 ms	32288 KB	Output is correct
9	Correct	35 ms	32288 KB	Output is correct
10	Correct	34 ms	32288 KB	Output is correct

Subtask #2
17.0 / 17.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	508 ms	48192 KB	Output is correct
2	Correct	997 ms	57416 KB	Output is correct
3	Correct	952 ms	61420 KB	Output is correct
4	Correct	1463 ms	64112 KB	Output is correct
5	Correct	1378 ms	65148 KB	Output is correct
6	Correct	1529 ms	107932 KB	Output is correct
7	Correct	1010 ms	107932 KB	Output is correct
8	Correct	1553 ms	107932 KB	Output is correct
9	Correct	1274 ms	107932 KB	Output is correct
10	Correct	753 ms	107932 KB	Output is correct

Subtask #3
18.0 / 18.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	31608 KB	Output is correct
2	Correct	34 ms	31860 KB	Output is correct
3	Correct	33 ms	31912 KB	Output is correct
4	Correct	32 ms	31912 KB	Output is correct
5	Correct	32 ms	32100 KB	Output is correct
6	Correct	35 ms	32288 KB	Output is correct
7	Correct	29 ms	32288 KB	Output is correct
8	Correct	33 ms	32288 KB	Output is correct
9	Correct	35 ms	32288 KB	Output is correct
10	Correct	34 ms	32288 KB	Output is correct
11	Correct	82 ms	107932 KB	Output is correct
12	Correct	100 ms	107932 KB	Output is correct
13	Correct	135 ms	107932 KB	Output is correct
14	Correct	84 ms	107932 KB	Output is correct
15	Correct	89 ms	107932 KB	Output is correct
16	Correct	89 ms	107932 KB	Output is correct
17	Correct	40 ms	107932 KB	Output is correct
18	Correct	45 ms	107932 KB	Output is correct
19	Correct	90 ms	107932 KB	Output is correct
20	Correct	100 ms	107932 KB	Output is correct

Subtask #4
0 / 14.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	31608 KB	Output is correct
2	Correct	34 ms	31860 KB	Output is correct
3	Correct	33 ms	31912 KB	Output is correct
4	Correct	32 ms	31912 KB	Output is correct
5	Correct	32 ms	32100 KB	Output is correct
6	Correct	35 ms	32288 KB	Output is correct
7	Correct	29 ms	32288 KB	Output is correct
8	Correct	33 ms	32288 KB	Output is correct
9	Correct	35 ms	32288 KB	Output is correct
10	Correct	34 ms	32288 KB	Output is correct
11	Correct	82 ms	107932 KB	Output is correct
12	Correct	100 ms	107932 KB	Output is correct
13	Correct	135 ms	107932 KB	Output is correct
14	Correct	84 ms	107932 KB	Output is correct
15	Correct	89 ms	107932 KB	Output is correct
16	Correct	89 ms	107932 KB	Output is correct
17	Correct	40 ms	107932 KB	Output is correct
18	Correct	45 ms	107932 KB	Output is correct
19	Correct	90 ms	107932 KB	Output is correct
20	Correct	100 ms	107932 KB	Output is correct
21	Execution timed out	4038 ms	107932 KB	Time limit exceeded
22	Halted	0 ms	0 KB	-

Subtask #5
0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	33 ms	31608 KB	Output is correct
2	Correct	34 ms	31860 KB	Output is correct
3	Correct	33 ms	31912 KB	Output is correct
4	Correct	32 ms	31912 KB	Output is correct
5	Correct	32 ms	32100 KB	Output is correct
6	Correct	35 ms	32288 KB	Output is correct
7	Correct	29 ms	32288 KB	Output is correct
8	Correct	33 ms	32288 KB	Output is correct
9	Correct	35 ms	32288 KB	Output is correct
10	Correct	34 ms	32288 KB	Output is correct
11	Correct	508 ms	48192 KB	Output is correct
12	Correct	997 ms	57416 KB	Output is correct
13	Correct	952 ms	61420 KB	Output is correct
14	Correct	1463 ms	64112 KB	Output is correct
15	Correct	1378 ms	65148 KB	Output is correct
16	Correct	1529 ms	107932 KB	Output is correct
17	Correct	1010 ms	107932 KB	Output is correct
18	Correct	1553 ms	107932 KB	Output is correct
19	Correct	1274 ms	107932 KB	Output is correct
20	Correct	753 ms	107932 KB	Output is correct
21	Correct	82 ms	107932 KB	Output is correct
22	Correct	100 ms	107932 KB	Output is correct
23	Correct	135 ms	107932 KB	Output is correct
24	Correct	84 ms	107932 KB	Output is correct
25	Correct	89 ms	107932 KB	Output is correct
26	Correct	89 ms	107932 KB	Output is correct
27	Correct	40 ms	107932 KB	Output is correct
28	Correct	45 ms	107932 KB	Output is correct
29	Correct	90 ms	107932 KB	Output is correct
30	Correct	100 ms	107932 KB	Output is correct
31	Execution timed out	4038 ms	107932 KB	Time limit exceeded
32	Halted	0 ms	0 KB	-

Submission #62437

Compilation message

Subtask #1 20.0 / 20.0

Subtask #2 17.0 / 17.0

Subtask #3 18.0 / 18.0

Subtask #4 0 / 14.0

Subtask #5 0 / 31.0

Subtask #1
20.0 / 20.0

Subtask #2
17.0 / 17.0

Subtask #3
18.0 / 18.0

Subtask #4
0 / 14.0

Subtask #5
0 / 31.0