oj.uz

Submission #74239

# Submission time Handle Problem Language Result Execution time Memory
74239 2018-08-30T14:24:01 Z admin Parachute rings (IOI12_rings) C++17
100 / 100
 2079 ms 42560 KB 
#pragma GCC optimize("Ofast")

#include "bits/stdc++.h"
using namespace std;
int N;
struct dsu {
	int other[1000010];
	int len[1000010];
	int cycle_cnt;
	int cycle_sum;
	bool bad;
	int no_of_nodes;
	int del_node;
 
	void init (int n) {
		no_of_nodes = n;
		del_node = -1;
		for(int i = 0; i < no_of_nodes; i++) {
			other[i] = i;
			len[i] = 1;
		}
		cycle_cnt = 0;
		cycle_sum = 0;
		bad = false;
	}
	void add(int x, int y) {
		if(del_node == x || del_node == y) return ; 
		if(bad) return ;
		if(other[x] == y) {
			other[x] = -1;
			other[y] = -1;
			cycle_cnt += 1;
			cycle_sum += len[x];
		} else {
			if(other[x] == -1 || other[y] == -1) {
				bad = true;
				return ;
			}
			int p = other[y];
			int q = other[x];
			other[p] = q;
			other[q] = p;
			int sum = len[x] + len[y];
			len[p] = len[q] = sum;
			if(x != p && x != q) {
				other[x] = -1;
			}
			if(y != p && y != q) {
				other[y] = -1;
			}
		}
	}
	int count() {
		if(bad) return 0;
		if(cycle_cnt <= 1) {
			if(cycle_cnt == 1) return cycle_sum;
			else return no_of_nodes;
		}
		return 0;
	}
} T[4];
int deg[1000010];
vector <int> l, r;
bool found_cand;
 
void Init(int N_) {
  N = N_;
  T[0].init(N);
  for(int i = 0; i < N; i++) {
  	deg[i] = 0;
  }
  l.clear(); r.clear();
  found_cand = false;
}
void Link(int A, int B) {
	if(found_cand) {
		for(int i = 0; i < 4; i++) {
			T[i].add(A, B);
		}
		return ;
	}
	++deg[A]; ++deg[B];
	l.emplace_back(A);
	r.emplace_back(B);
	if(deg[A] == 3 || deg[B] == 3) {
		vector <int> v;
		int can = deg[A] == 3 ? A : B;
		v.emplace_back(can);
		for(int i = 0; i < (int) l.size(); i++) {
			if(l[i] == can || r[i] == can) {
				v.emplace_back(l[i] ^ r[i] ^ can);
			}
		}
		for(int i = 0; i < 4; i++) {
			T[i].init(N);
			T[i].del_node = v[i];
		}
		found_cand = true;
	} else {
		T[0].add(A, B);
	}
	if(found_cand) {
		for(int i = 0; i < (int)l.size(); i++) {
			Link(l[i], r[i]);
		}
 		l.clear(); r.clear();
	}
}
 
int CountCritical() {
	if(found_cand) {
		int ans = 0;
		for(int i = 0; i < 4; i++) {
			if(T[i].cycle_cnt == 0 && !T[i].bad) {
				++ans;
			}
 		}
 		return ans;
	}
	return T[0].count();
}

Subtask #1
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 628 KB Output is correct
3 Correct 3 ms 704 KB Output is correct
4 Correct 2 ms 704 KB Output is correct
5 Correct 3 ms 704 KB Output is correct
6 Correct 4 ms 704 KB Output is correct
7 Correct 2 ms 800 KB Output is correct
8 Correct 3 ms 800 KB Output is correct
9 Correct 4 ms 876 KB Output is correct
10 Correct 5 ms 880 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 259 ms 11064 KB Output is correct
2 Correct 813 ms 31172 KB Output is correct
3 Correct 331 ms 36080 KB Output is correct
4 Correct 610 ms 36080 KB Output is correct
5 Correct 610 ms 36080 KB Output is correct
6 Correct 601 ms 36080 KB Output is correct
7 Correct 326 ms 36080 KB Output is correct
8 Correct 1687 ms 38980 KB Output is correct
9 Correct 2079 ms 42560 KB Output is correct
10 Correct 514 ms 42560 KB Output is correct

Subtask #3
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 628 KB Output is correct
3 Correct 3 ms 704 KB Output is correct
4 Correct 2 ms 704 KB Output is correct
5 Correct 3 ms 704 KB Output is correct
6 Correct 4 ms 704 KB Output is correct
7 Correct 2 ms 800 KB Output is correct
8 Correct 3 ms 800 KB Output is correct
9 Correct 4 ms 876 KB Output is correct
10 Correct 5 ms 880 KB Output is correct
11 Correct 4 ms 42560 KB Output is correct
12 Correct 6 ms 42560 KB Output is correct
13 Correct 7 ms 42560 KB Output is correct
14 Correct 4 ms 42560 KB Output is correct
15 Correct 4 ms 42560 KB Output is correct
16 Correct 5 ms 42560 KB Output is correct
17 Correct 5 ms 42560 KB Output is correct
18 Correct 6 ms 42560 KB Output is correct
19 Correct 5 ms 42560 KB Output is correct
20 Correct 5 ms 42560 KB Output is correct

Subtask #4
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 628 KB Output is correct
3 Correct 3 ms 704 KB Output is correct
4 Correct 2 ms 704 KB Output is correct
5 Correct 3 ms 704 KB Output is correct
6 Correct 4 ms 704 KB Output is correct
7 Correct 2 ms 800 KB Output is correct
8 Correct 3 ms 800 KB Output is correct
9 Correct 4 ms 876 KB Output is correct
10 Correct 5 ms 880 KB Output is correct
11 Correct 4 ms 42560 KB Output is correct
12 Correct 6 ms 42560 KB Output is correct
13 Correct 7 ms 42560 KB Output is correct
14 Correct 4 ms 42560 KB Output is correct
15 Correct 4 ms 42560 KB Output is correct
16 Correct 5 ms 42560 KB Output is correct
17 Correct 5 ms 42560 KB Output is correct
18 Correct 6 ms 42560 KB Output is correct
19 Correct 5 ms 42560 KB Output is correct
20 Correct 5 ms 42560 KB Output is correct
21 Correct 19 ms 42560 KB Output is correct
22 Correct 25 ms 42560 KB Output is correct
23 Correct 33 ms 42560 KB Output is correct
24 Correct 36 ms 42560 KB Output is correct
25 Correct 16 ms 42560 KB Output is correct
26 Correct 35 ms 42560 KB Output is correct
27 Correct 38 ms 42560 KB Output is correct
28 Correct 34 ms 42560 KB Output is correct
29 Correct 28 ms 42560 KB Output is correct
30 Correct 37 ms 42560 KB Output is correct

Subtask #5
31.0 / 31.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 4 ms 628 KB Output is correct
3 Correct 3 ms 704 KB Output is correct
4 Correct 2 ms 704 KB Output is correct
5 Correct 3 ms 704 KB Output is correct
6 Correct 4 ms 704 KB Output is correct
7 Correct 2 ms 800 KB Output is correct
8 Correct 3 ms 800 KB Output is correct
9 Correct 4 ms 876 KB Output is correct
10 Correct 5 ms 880 KB Output is correct
11 Correct 259 ms 11064 KB Output is correct
12 Correct 813 ms 31172 KB Output is correct
13 Correct 331 ms 36080 KB Output is correct
14 Correct 610 ms 36080 KB Output is correct
15 Correct 610 ms 36080 KB Output is correct
16 Correct 601 ms 36080 KB Output is correct
17 Correct 326 ms 36080 KB Output is correct
18 Correct 1687 ms 38980 KB Output is correct
19 Correct 2079 ms 42560 KB Output is correct
20 Correct 514 ms 42560 KB Output is correct
21 Correct 4 ms 42560 KB Output is correct
22 Correct 6 ms 42560 KB Output is correct
23 Correct 7 ms 42560 KB Output is correct
24 Correct 4 ms 42560 KB Output is correct
25 Correct 4 ms 42560 KB Output is correct
26 Correct 5 ms 42560 KB Output is correct
27 Correct 5 ms 42560 KB Output is correct
28 Correct 6 ms 42560 KB Output is correct
29 Correct 5 ms 42560 KB Output is correct
30 Correct 5 ms 42560 KB Output is correct
31 Correct 19 ms 42560 KB Output is correct
32 Correct 25 ms 42560 KB Output is correct
33 Correct 33 ms 42560 KB Output is correct
34 Correct 36 ms 42560 KB Output is correct
35 Correct 16 ms 42560 KB Output is correct
36 Correct 35 ms 42560 KB Output is correct
37 Correct 38 ms 42560 KB Output is correct
38 Correct 34 ms 42560 KB Output is correct
39 Correct 28 ms 42560 KB Output is correct
40 Correct 37 ms 42560 KB Output is correct
41 Correct 167 ms 42560 KB Output is correct
42 Correct 809 ms 42560 KB Output is correct
43 Correct 257 ms 42560 KB Output is correct
44 Correct 322 ms 42560 KB Output is correct
45 Correct 453 ms 42560 KB Output is correct
46 Correct 458 ms 42560 KB Output is correct
47 Correct 512 ms 42560 KB Output is correct
48 Correct 302 ms 42560 KB Output is correct
49 Correct 457 ms 42560 KB Output is correct
50 Correct 481 ms 42560 KB Output is correct
51 Correct 250 ms 42560 KB Output is correct
52 Correct 345 ms 42560 KB Output is correct
53 Correct 255 ms 42560 KB Output is correct
54 Correct 1131 ms 42560 KB Output is correct
55 Correct 470 ms 42560 KB Output is correct