oj.uz

Submission #36817

# Submission time Handle Problem Language Result Execution time Memory
36817 2017-12-14T20:36:57 Z mohammad_kilani Parachute rings (IOI12_rings) C++
100 / 100
 1974 ms 113164 KB 
#include <bits/stdc++.h>
using namespace std;
const int N = 1000010;
int n , comp[N], mx , adj[N] , ans = 0 , cycles = 0 , vis[N] , vi = 0 , comp2[4][N] , con1[4][N] , con2[4][N] , qu[N] , in[N] , idx = 0 , u , vv;
vector< int > g[N];
vector< pair<int,bool> > v;
vector< pair<int,int> > v2;


void Init(int N_) {
  n = N_;
  ans = n ;
  for(int i=0;i<n;i++) 
  	comp[i] = i;
  mx = 0 ;
  cycles = 0 ;
}


void DFS(int node,int prnt,int last){
	while(true){
		ans++;
		if(node == last) return;
		for(int i=0;i<(int)g[node].size();i++){
			if(g[node][i] != prnt){
				prnt = node;
				node = g[node][i];
				break;
			}
		}
	}
}


void make(int u){
	v.push_back(make_pair(u,true));
	for(int i=0;i<(int)g[u].size();i++){
		v.push_back(make_pair(g[u][i],true));
	}
	ans = 0 ;
	int st = 0 , en = 1 , num = 0 , node = 0;
	for(int i=0;i<(int)v.size();i++){
		vi++;
		for(int j=0;j<n;j++){
			if(j == v[i].first || vis[j] == vi) continue;
			con1[i][j] = con2[i][j] = -1;
			st = 0 , en = 1 , num = 0 , node = j;
			qu[0] = j;
			vis[j] = vi;
			while(st < en){
				node = qu[st++];
				comp2[i][node] = j;
				num = 0 ;
				for(int k=0;k<(int)g[node].size();k++){
					num += (g[node][k] != v[i].first);
					if(vis[g[node][k]] == vi || g[node][k] == v[i].first) continue;
					qu[en++] = g[node][k];
					vis[g[node][k]] = vi;
				}
				if(num < 2){
					if(con1[i][j] == -1) con1[i][j] = node; else con2[i][j] = node;
				}
			}
			if(con1[i][j] == -1){
				v[i].second = false;
				break;
			}
			if(con2[i][j] == -1) con2[i][j] = con1[i][j];
		}
		ans += v[i].second;
	}
}

void Link(int a, int b) {
	if(ans == 0) return;
	if(mx < 3){
		u = a;
		idx = 0 ;
		while(u != comp[u]){
			in[idx++] = u;
			u = comp[u];
		}
		while(idx > 0){
			idx--;
			comp[in[idx]] = u;
		}
		vv = b;
		idx = 0 ;
		while(vv != comp[vv]){
			in[idx++] = vv;
			vv = comp[vv];
		}
		while(idx > 0){
			idx--;
			comp[in[idx]] = vv;
		}
		adj[a]++;
		adj[b]++;
		g[a].push_back(b);
		g[b].push_back(a);
		if(adj[a] == 3){
			mx = 3;
			make(a);
			return ;
		}
		if(adj[b] == 3){
			mx = 3;
			make(b);
			return;
		}
		if(u == vv){
			if(cycles > 0){
				ans = 0;
				return ;
			}
			cycles++;
			ans = 0 ;
			DFS(a,b,b);
		}
		else{
			comp[u] = vv;
		}
		return ;
	}
	for(int i=0;i<(int)v.size();i++){
		if(v[i].second == false) continue;
		if(a == v[i].first || b == v[i].first){
			adj[v[i].first]++;
			if(adj[v[i].first] > 3 && v.size() > 1){
				int cur = v[i].first;
				ans = 1;
				v.clear();
				v.push_back(make_pair(cur,1));
				break;
			}
			continue;
		}
		u = comp2[i][a];
		idx = 0;
		while(u != comp2[i][u]){
			in[idx++] = u;
			u = comp2[i][u];
		}
		while(idx > 0){
			idx--;
			comp2[i][in[idx]] = u;
		}
		vv = comp2[i][b];
		idx = 0;
		while(vv != comp2[i][vv]){
			in[idx++] = vv;
			vv = comp2[i][vv];
		}
		while(idx > 0){
			idx--;
			comp2[i][in[idx]] = vv;
		}
		if(u == vv){
			v[i].second = false;
			ans--;
			continue;
		}
		if(a != con1[i][u] && a != con2[i][u]){
			v[i].second = false;
			ans--;
			continue;
		}
		if(b != con1[i][vv] && b != con2[i][vv]){
			v[i].second = false;
			ans--;
			continue;
		}
		comp2[i][u] = vv;
		if(a == con1[i][u] && b == con1[i][vv]){
			con1[i][vv] = con2[i][u];
		}
		else if(a == con2[i][u] && b == con1[i][vv]){
			con1[i][vv] = con1[i][u];
		}
		else if(a == con1[i][u] && b == con2[i][vv]){
			con2[i][vv] = con2[i][u];
		}
		else if(a == con2[i][u] && b == con2[i][vv]){
			con2[i][vv] = con1[i][u];
		}
	}
}

int CountCritical() {
  return ans;
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 24 ms 24460 KB Output is correct
3 Correct 26 ms 24472 KB Output is correct
4 Correct 22 ms 24472 KB Output is correct
5 Correct 23 ms 24472 KB Output is correct
6 Correct 24 ms 24472 KB Output is correct
7 Correct 22 ms 24472 KB Output is correct
8 Correct 24 ms 24472 KB Output is correct
9 Correct 24 ms 24496 KB Output is correct
10 Correct 25 ms 24604 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 401 ms 44504 KB Output is correct
2 Correct 975 ms 85056 KB Output is correct
3 Correct 390 ms 85056 KB Output is correct
4 Correct 1080 ms 85056 KB Output is correct
5 Correct 1089 ms 85056 KB Output is correct
6 Correct 1172 ms 85056 KB Output is correct
7 Correct 401 ms 85056 KB Output is correct
8 Correct 1619 ms 105468 KB Output is correct
9 Correct 1974 ms 113164 KB Output is correct
10 Correct 727 ms 113164 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 24 ms 24460 KB Output is correct
3 Correct 26 ms 24472 KB Output is correct
4 Correct 22 ms 24472 KB Output is correct
5 Correct 23 ms 24472 KB Output is correct
6 Correct 24 ms 24472 KB Output is correct
7 Correct 22 ms 24472 KB Output is correct
8 Correct 24 ms 24472 KB Output is correct
9 Correct 24 ms 24496 KB Output is correct
10 Correct 25 ms 24604 KB Output is correct
11 Correct 23 ms 113164 KB Output is correct
12 Correct 28 ms 113164 KB Output is correct
13 Correct 27 ms 113164 KB Output is correct
14 Correct 24 ms 113164 KB Output is correct
15 Correct 26 ms 113164 KB Output is correct
16 Correct 26 ms 113164 KB Output is correct
17 Correct 24 ms 113164 KB Output is correct
18 Correct 27 ms 113164 KB Output is correct
19 Correct 29 ms 113164 KB Output is correct
20 Correct 29 ms 113164 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 24 ms 24460 KB Output is correct
3 Correct 26 ms 24472 KB Output is correct
4 Correct 22 ms 24472 KB Output is correct
5 Correct 23 ms 24472 KB Output is correct
6 Correct 24 ms 24472 KB Output is correct
7 Correct 22 ms 24472 KB Output is correct
8 Correct 24 ms 24472 KB Output is correct
9 Correct 24 ms 24496 KB Output is correct
10 Correct 25 ms 24604 KB Output is correct
11 Correct 23 ms 113164 KB Output is correct
12 Correct 28 ms 113164 KB Output is correct
13 Correct 27 ms 113164 KB Output is correct
14 Correct 24 ms 113164 KB Output is correct
15 Correct 26 ms 113164 KB Output is correct
16 Correct 26 ms 113164 KB Output is correct
17 Correct 24 ms 113164 KB Output is correct
18 Correct 27 ms 113164 KB Output is correct
19 Correct 29 ms 113164 KB Output is correct
20 Correct 29 ms 113164 KB Output is correct
21 Correct 43 ms 113164 KB Output is correct
22 Correct 62 ms 113164 KB Output is correct
23 Correct 98 ms 113164 KB Output is correct
24 Correct 61 ms 113164 KB Output is correct
25 Correct 42 ms 113164 KB Output is correct
26 Correct 58 ms 113164 KB Output is correct
27 Correct 69 ms 113164 KB Output is correct
28 Correct 53 ms 113164 KB Output is correct
29 Correct 55 ms 113164 KB Output is correct
30 Correct 82 ms 113164 KB Output is correct

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 21 ms 23800 KB Output is correct
2 Correct 24 ms 24460 KB Output is correct
3 Correct 26 ms 24472 KB Output is correct
4 Correct 22 ms 24472 KB Output is correct
5 Correct 23 ms 24472 KB Output is correct
6 Correct 24 ms 24472 KB Output is correct
7 Correct 22 ms 24472 KB Output is correct
8 Correct 24 ms 24472 KB Output is correct
9 Correct 24 ms 24496 KB Output is correct
10 Correct 25 ms 24604 KB Output is correct
11 Correct 401 ms 44504 KB Output is correct
12 Correct 975 ms 85056 KB Output is correct
13 Correct 390 ms 85056 KB Output is correct
14 Correct 1080 ms 85056 KB Output is correct
15 Correct 1089 ms 85056 KB Output is correct
16 Correct 1172 ms 85056 KB Output is correct
17 Correct 401 ms 85056 KB Output is correct
18 Correct 1619 ms 105468 KB Output is correct
19 Correct 1974 ms 113164 KB Output is correct
20 Correct 727 ms 113164 KB Output is correct
21 Correct 23 ms 113164 KB Output is correct
22 Correct 28 ms 113164 KB Output is correct
23 Correct 27 ms 113164 KB Output is correct
24 Correct 24 ms 113164 KB Output is correct
25 Correct 26 ms 113164 KB Output is correct
26 Correct 26 ms 113164 KB Output is correct
27 Correct 24 ms 113164 KB Output is correct
28 Correct 27 ms 113164 KB Output is correct
29 Correct 29 ms 113164 KB Output is correct
30 Correct 29 ms 113164 KB Output is correct
31 Correct 43 ms 113164 KB Output is correct
32 Correct 62 ms 113164 KB Output is correct
33 Correct 98 ms 113164 KB Output is correct
34 Correct 61 ms 113164 KB Output is correct
35 Correct 42 ms 113164 KB Output is correct
36 Correct 58 ms 113164 KB Output is correct
37 Correct 69 ms 113164 KB Output is correct
38 Correct 53 ms 113164 KB Output is correct
39 Correct 55 ms 113164 KB Output is correct
40 Correct 82 ms 113164 KB Output is correct
41 Correct 223 ms 113164 KB Output is correct
42 Correct 941 ms 113164 KB Output is correct
43 Correct 293 ms 113164 KB Output is correct
44 Correct 384 ms 113164 KB Output is correct
45 Correct 600 ms 113164 KB Output is correct
46 Correct 702 ms 113164 KB Output is correct
47 Correct 1067 ms 113164 KB Output is correct
48 Correct 352 ms 113164 KB Output is correct
49 Correct 695 ms 113164 KB Output is correct
50 Correct 736 ms 113164 KB Output is correct
51 Correct 286 ms 113164 KB Output is correct
52 Correct 333 ms 113164 KB Output is correct
53 Correct 323 ms 113164 KB Output is correct
54 Correct 1202 ms 113164 KB Output is correct
55 Correct 600 ms 113164 KB Output is correct