oj.uz

Submission #546160

# Submission time Handle Problem Language Result Execution time Memory
546160 2022-04-06T14:54:12 Z keta_tsimakuridze Parachute rings (IOI12_rings) C++14
52 / 100
 4000 ms 259832 KB 
#include<bits/stdc++.h>
using namespace std;
#define f first
#define s second
#define pii pair<int,int>
const int N = 1000000 + 5;
int n, sz = 0, h[N];
int cycle[7], rem[7], stop = 0, p[N][7];
set<pii> tried[6], deg;
vector<int> V[7][N];
void Init(int N_) {
  n = N_;
  for(int i = 0; i < n; i++) {
  	for(int t = 0; t < 6; t++) {
  		p[i][t] = i;
	}
	deg.insert({0, i});
  }
}
int find(int a, int t) {
	return (p[a][t] == a ? p[a][t] :  p[a][t] = find(p[a][t], t));	
}
void merge(int a,int b, int t) {
	a = find(a, t); b = find(b, t);
	if(a == b) return;
	p[a][t] = b;
	return;
}
void dfs(int a, int p) {
	h[a] = h[p] + 1;
	for(int i = 0; i < V[5][a].size(); i++) {
		if(V[5][a][i] == p) continue;
		if(sz) return;
		if(h[V[5][a][i]]) { 
			sz = h[a] - h[V[5][a][i]] + 1;
			return;
		} else dfs(V[5][a][i], a);
	}
}
void add(int a, int b, int t) {
	if(a == rem[t] || b == rem[t]) return;
	tried[t].erase({V[t][a].size(), a});
	tried[t].erase({V[t][b].size(), b});
	V[t][a].push_back(b); V[t][b].push_back(a);
	tried[t].insert({V[t][a].size(), a});
	tried[t].insert({V[t][b].size(), b});
	if(find(a, t) == find(b, t)) cycle[t] = 1;
	else merge(a, b, t);
	return;	
}
void Link(int a, int b) {
	deg.erase({V[5][a].size(), a});
	deg.erase({V[5][b].size(), b});
	V[5][a].push_back(b); V[5][b].push_back(a);
	deg.insert({V[5][a].size(), a});
	deg.insert({V[5][b].size(), b});
	if(find(a, 5) != find(b, 5)) {
		merge(a, b, 5);
	}
	else {
		if(!cycle[5]) {
			merge(a, b, 5);
			dfs(a, -1);
			cycle[5] = a + 1;
		}
		else if(find(a, 5) != find(cycle[5] - 1, 5)) {
			stop = 1;
		}
	}
	if(tried[0].size()) {
		add(a, b, 0);
	}
	if(tried[1].size()) {

		for(int i = 1; i <= 4; i++) add(a, b, i);
	}
	
}
void build(int t) {
	int u = rem[t];
	for(int i = 0; i < n; i++) {
		if(u == i) continue;
		for(int j = 0; j < V[5][i].size(); j++) {
			int v = V[5][i][j];
			if(v == u || v < i) continue;
			if(find(v, t) == find(i, t)) cycle[t] = 1;
			merge(i, v, t);
			V[t][i].push_back(v); V[t][v].push_back(i);
		}
	}
	for(int i = 0; i < n; i++) tried[t].insert({V[t][i].size(), i});	
}
int CountCritical() {
	if(stop) return 0; 
	if(!cycle[5] && (*--deg.end()).f <= 2) return n;
	if((*--deg.end()).f <= 2) return sz;
	
	if((*--deg.end()).f >= 4) {
		if(!tried[0].size()) {
			rem[0] = (*--deg.end()).s;
			build(0);
		}
		if((*--tried[0].end()).f <= 2 && !cycle[0]) return 1;
		stop = 1;
		return 0;
	}
	if(!tried[1].size()) {
		rem[1] = (*--deg.end()).s; 
		for(int i = 0; i < V[5][rem[1]].size(); i++) {
			rem[i + 2] = V[5][rem[1]][i]; 
		}
		for(int i = 1; i <= 4; i++) {
			build(i);
		}
	}
	int cn = 0;
	for(int i = 1; i <= 4; i++) {
		if((*--tried[i].end()).f <= 2 && !cycle[i]) cn++;
	}
	return cn;
}

Compilation message

rings.cpp: In function 'void dfs(int, int)':
rings.cpp:31:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   31 |  for(int i = 0; i < V[5][a].size(); i++) {
      |                 ~~^~~~~~~~~~~~~~~~
rings.cpp: In function 'void build(int)':
rings.cpp:83:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   83 |   for(int j = 0; j < V[5][i].size(); j++) {
      |                  ~~^~~~~~~~~~~~~~~~
rings.cpp: In function 'int CountCritical()':
rings.cpp:109:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  109 |   for(int i = 0; i < V[5][rem[1]].size(); i++) {
      |                  ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 164624 KB Output is correct
2 Correct 82 ms 165560 KB Output is correct
3 Correct 84 ms 165632 KB Output is correct
4 Correct 78 ms 164788 KB Output is correct
5 Correct 78 ms 165080 KB Output is correct
6 Correct 82 ms 165452 KB Output is correct
7 Correct 80 ms 166092 KB Output is correct
8 Correct 79 ms 165056 KB Output is correct
9 Correct 90 ms 166808 KB Output is correct
10 Correct 89 ms 166756 KB Output is correct

Subtask #2
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1995 ms 226220 KB Output is correct
2 Execution timed out 4098 ms 259832 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 164624 KB Output is correct
2 Correct 82 ms 165560 KB Output is correct
3 Correct 84 ms 165632 KB Output is correct
4 Correct 78 ms 164788 KB Output is correct
5 Correct 78 ms 165080 KB Output is correct
6 Correct 82 ms 165452 KB Output is correct
7 Correct 80 ms 166092 KB Output is correct
8 Correct 79 ms 165056 KB Output is correct
9 Correct 90 ms 166808 KB Output is correct
10 Correct 89 ms 166756 KB Output is correct
11 Correct 108 ms 166860 KB Output is correct
12 Correct 102 ms 168804 KB Output is correct
13 Correct 129 ms 169644 KB Output is correct
14 Correct 90 ms 166224 KB Output is correct
15 Correct 94 ms 167556 KB Output is correct
16 Correct 96 ms 165880 KB Output is correct
17 Correct 86 ms 165708 KB Output is correct
18 Correct 179 ms 173324 KB Output is correct
19 Correct 89 ms 165772 KB Output is correct
20 Correct 118 ms 168852 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 164624 KB Output is correct
2 Correct 82 ms 165560 KB Output is correct
3 Correct 84 ms 165632 KB Output is correct
4 Correct 78 ms 164788 KB Output is correct
5 Correct 78 ms 165080 KB Output is correct
6 Correct 82 ms 165452 KB Output is correct
7 Correct 80 ms 166092 KB Output is correct
8 Correct 79 ms 165056 KB Output is correct
9 Correct 90 ms 166808 KB Output is correct
10 Correct 89 ms 166756 KB Output is correct
11 Correct 108 ms 166860 KB Output is correct
12 Correct 102 ms 168804 KB Output is correct
13 Correct 129 ms 169644 KB Output is correct
14 Correct 90 ms 166224 KB Output is correct
15 Correct 94 ms 167556 KB Output is correct
16 Correct 96 ms 165880 KB Output is correct
17 Correct 86 ms 165708 KB Output is correct
18 Correct 179 ms 173324 KB Output is correct
19 Correct 89 ms 165772 KB Output is correct
20 Correct 118 ms 168852 KB Output is correct
21 Correct 127 ms 169448 KB Output is correct
22 Correct 169 ms 172248 KB Output is correct
23 Correct 203 ms 174224 KB Output is correct
24 Correct 378 ms 179432 KB Output is correct
25 Correct 274 ms 196684 KB Output is correct
26 Correct 969 ms 206608 KB Output is correct
27 Correct 239 ms 173724 KB Output is correct
28 Correct 1362 ms 201808 KB Output is correct
29 Correct 762 ms 204364 KB Output is correct
30 Correct 297 ms 176236 KB Output is correct

Subtask #5
0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 75 ms 164624 KB Output is correct
2 Correct 82 ms 165560 KB Output is correct
3 Correct 84 ms 165632 KB Output is correct
4 Correct 78 ms 164788 KB Output is correct
5 Correct 78 ms 165080 KB Output is correct
6 Correct 82 ms 165452 KB Output is correct
7 Correct 80 ms 166092 KB Output is correct
8 Correct 79 ms 165056 KB Output is correct
9 Correct 90 ms 166808 KB Output is correct
10 Correct 89 ms 166756 KB Output is correct
11 Correct 1995 ms 226220 KB Output is correct
12 Execution timed out 4098 ms 259832 KB Time limit exceeded
13 Halted 0 ms 0 KB -