oj.uz

답안 #133886

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
133886 2019-07-21T16:27:51 Z nvmdava Simurgh (IOI17_simurgh) C++17
100 / 100
 736 ms 5868 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
vector<pair<int, int> > edge;
int n, m;
bool ans[150000];
bool ch[150000];

int p[505];
int get(int v, int i){
	return edge[i].ff + edge[i].ss - v;
}

void reset(){
	for(int i = 0; i < n; i++)
		p[i] = i;
}

int find(int v){
	return v == p[v] ? v : p[v] = find(p[v]);
}

bool merge(int v, int u){
	v = find(v);
	u = find(u);
	if(v == u) return 0;
	p[v] = u;
	return 1;
}

vector<int> inq;
vector<int> tree;
int t;
int ask(){
	reset();
	for(int& x : inq)
		merge(edge[x].ff, edge[x].ss);
	t = 0;
	for(int& x : tree){
		if(merge(edge[x].ff, edge[x].ss)){
			inq.push_back(x);
			t += ans[x];
		}
	}
	return count_common_roads(inq);
}

int par[505];
int dep[505];
vector<int> adj[505];

void dfs(int v){
	for(int& x : adj[v]){
		int u = get(v, x);
		if(dep[u]) continue;
		par[u] = x;
		dep[u] = dep[v] + 1;
		tree.push_back(x);
		dfs(u);
	}
}

vector<int> cyc, fin, onn, off;
int fillexc(int x){
	inq = cyc;
	for(int& a : inq){
		if(a == x){
			swap(a, inq.back());
			inq.pop_back();
			break;
		}
	}
	return ask();
}
vector<int> vall;
void solvecycle(){
	if(fin.empty()) return;
	if(onn.empty() && off.empty()){
		int lo = -1;
		vall.clear();
		for(int& x : cyc)
			vall.push_back(fillexc(x));
		for(int& x : vall)
			lo = max(lo, x);
		for(int i = cyc.size() - 1; i >= 0; i--){
			ch[cyc[i]] = 1;
			ans[cyc[i]] = (lo - vall[i]);
		}
	} else {
		int lo;
		if(off.empty())
			lo = fillexc(onn[0]);
		else 
			lo = fillexc(off[0]) - 1;
		for(int& x : fin){
			ch[x] = 1;
			ans[x] = (fillexc(x) == lo);
		}
	}
}

void solvetree(){
	for(int i = 0; i < m; i++){
		if(dep[edge[i].ff] < dep[edge[i].ss]) swap(edge[i].ff, edge[i].ss);
		if(dep[edge[i].ff] - dep[edge[i].ss] == 1) continue;
		cyc.clear(); fin.clear(); off.clear(); onn.clear();
		cyc.push_back(i);
		int s = edge[i].ff;
		while(s != edge[i].ss){
			cyc.push_back(par[s]);
			if(ch[par[s]] == 0) fin.push_back(par[s]);
			else if(ans[par[s]] == 1) onn.push_back(par[s]);
			else off.push_back(par[s]);
			s = get(s, par[s]);
		}
		solvecycle();
	}
	for(int& x : tree){
		if(ch[x] == 0){
			ch[x] = ans[x] = 1;
		}
	}
}

vector<int> imsad;
bool in[505];

void dfs2(int v){
	in[v] = 1;
	for(int i = adj[v].size() - 1; i >= 0; i--){
		if(ch[adj[v][i]]){
			swap(adj[v][i], adj[v].back());
			adj[v].pop_back();
			continue;
		}
		int u = get(v, adj[v][i]);
		if(in[u]) continue;
		imsad.push_back(adj[v][i]);
		dfs2(u);
	}
}

void solvethisshit(){
	if(imsad.empty()) return;
	inq = imsad;
	if(ask() == t){
		for(int& x : imsad){
			ch[x] = 1;
			ans[x] = 0;
		}
		return;
	}
	int l = 0, r = imsad.size() - 1;
	while(l != r){
		int m = (l + r) >> 1;
		inq.clear();
		for(int i = 0; i <= m; i++)
			inq.push_back(imsad[i]);
		if(ask() == t) l = m + 1;
		else r = m;
	}
	for(int i = 0; i < r; i++){
		ch[imsad[i]] = 1;
		ans[imsad[i]] = 0;
	}
	ch[imsad[r]] = ans[imsad[r]] = 1;
}

vector<int> ACpls;

vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	::n = n;
	m = u.size();
	for(int i = 0; i < m; i++){
		adj[v[i]].push_back(i);
		adj[u[i]].push_back(i);
		edge.push_back({v[i], u[i]});
	}
	dep[0] = 1;
	dfs(0);
	if(m == n - 1){
		return tree; 
	}
	solvetree();
	do{
		memset(in, 0, sizeof in);
		imsad.clear();
		for(int i = 0; i < n; i++){
			if(in[i]) continue;
			dfs2(i);
		}
		solvethisshit();
	} while(!imsad.empty());
	for(int i = 0; i < m; i++){
		if(ans[i]) ACpls.push_back(i);
	}
	return ACpls;
}

Subtask #1
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB correct
2 Correct 2 ms 376 KB correct
3 Correct 2 ms 376 KB correct
4 Correct 2 ms 376 KB correct
5 Correct 2 ms 376 KB correct
6 Correct 2 ms 376 KB correct
7 Correct 2 ms 376 KB correct
8 Correct 2 ms 376 KB correct
9 Correct 2 ms 376 KB correct
10 Correct 2 ms 376 KB correct
11 Correct 2 ms 376 KB correct
12 Correct 2 ms 376 KB correct
13 Correct 2 ms 376 KB correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB correct
2 Correct 2 ms 376 KB correct
3 Correct 2 ms 376 KB correct
4 Correct 2 ms 376 KB correct
5 Correct 2 ms 376 KB correct
6 Correct 2 ms 376 KB correct
7 Correct 2 ms 376 KB correct
8 Correct 2 ms 376 KB correct
9 Correct 2 ms 376 KB correct
10 Correct 2 ms 376 KB correct
11 Correct 2 ms 376 KB correct
12 Correct 2 ms 376 KB correct
13 Correct 2 ms 376 KB correct
14 Correct 4 ms 376 KB correct
15 Correct 4 ms 376 KB correct
16 Correct 4 ms 504 KB correct
17 Correct 4 ms 376 KB correct
18 Correct 3 ms 376 KB correct
19 Correct 4 ms 380 KB correct
20 Correct 4 ms 376 KB correct
21 Correct 4 ms 376 KB correct
22 Correct 3 ms 376 KB correct
23 Correct 3 ms 376 KB correct
24 Correct 3 ms 504 KB correct
25 Correct 2 ms 376 KB correct
26 Correct 3 ms 376 KB correct
27 Correct 3 ms 376 KB correct
28 Correct 3 ms 376 KB correct
29 Correct 2 ms 376 KB correct
30 Correct 3 ms 376 KB correct
31 Correct 3 ms 376 KB correct
32 Correct 2 ms 380 KB correct
33 Correct 3 ms 376 KB correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB correct
2 Correct 2 ms 376 KB correct
3 Correct 2 ms 376 KB correct
4 Correct 2 ms 376 KB correct
5 Correct 2 ms 376 KB correct
6 Correct 2 ms 376 KB correct
7 Correct 2 ms 376 KB correct
8 Correct 2 ms 376 KB correct
9 Correct 2 ms 376 KB correct
10 Correct 2 ms 376 KB correct
11 Correct 2 ms 376 KB correct
12 Correct 2 ms 376 KB correct
13 Correct 2 ms 376 KB correct
14 Correct 4 ms 376 KB correct
15 Correct 4 ms 376 KB correct
16 Correct 4 ms 504 KB correct
17 Correct 4 ms 376 KB correct
18 Correct 3 ms 376 KB correct
19 Correct 4 ms 380 KB correct
20 Correct 4 ms 376 KB correct
21 Correct 4 ms 376 KB correct
22 Correct 3 ms 376 KB correct
23 Correct 3 ms 376 KB correct
24 Correct 3 ms 504 KB correct
25 Correct 2 ms 376 KB correct
26 Correct 3 ms 376 KB correct
27 Correct 3 ms 376 KB correct
28 Correct 3 ms 376 KB correct
29 Correct 2 ms 376 KB correct
30 Correct 3 ms 376 KB correct
31 Correct 3 ms 376 KB correct
32 Correct 2 ms 380 KB correct
33 Correct 3 ms 376 KB correct
34 Correct 92 ms 1616 KB correct
35 Correct 90 ms 1528 KB correct
36 Correct 70 ms 1272 KB correct
37 Correct 25 ms 436 KB correct
38 Correct 92 ms 1652 KB correct
39 Correct 81 ms 1508 KB correct
40 Correct 69 ms 1272 KB correct
41 Correct 87 ms 1652 KB correct
42 Correct 88 ms 1528 KB correct
43 Correct 30 ms 1016 KB correct
44 Correct 25 ms 888 KB correct
45 Correct 28 ms 1016 KB correct
46 Correct 24 ms 888 KB correct
47 Correct 15 ms 632 KB correct
48 Correct 5 ms 376 KB correct
49 Correct 11 ms 504 KB correct
50 Correct 15 ms 632 KB correct
51 Correct 29 ms 1016 KB correct
52 Correct 25 ms 1016 KB correct
53 Correct 24 ms 892 KB correct
54 Correct 30 ms 1020 KB correct
55 Correct 30 ms 1144 KB correct
56 Correct 31 ms 1016 KB correct
57 Correct 30 ms 1016 KB correct

Subtask #4
19.0 / 19.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB correct
2 Correct 2 ms 376 KB correct
3 Correct 381 ms 3572 KB correct
4 Correct 723 ms 4924 KB correct
5 Correct 730 ms 4868 KB correct
6 Correct 659 ms 4804 KB correct
7 Correct 653 ms 4716 KB correct
8 Correct 663 ms 4768 KB correct
9 Correct 716 ms 4972 KB correct
10 Correct 724 ms 4764 KB correct
11 Correct 714 ms 5644 KB correct
12 Correct 722 ms 5712 KB correct
13 Correct 2 ms 376 KB correct
14 Correct 708 ms 5728 KB correct
15 Correct 713 ms 5780 KB correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB correct
2 Correct 2 ms 376 KB correct
3 Correct 2 ms 376 KB correct
4 Correct 2 ms 376 KB correct
5 Correct 2 ms 376 KB correct
6 Correct 2 ms 376 KB correct
7 Correct 2 ms 376 KB correct
8 Correct 2 ms 376 KB correct
9 Correct 2 ms 376 KB correct
10 Correct 2 ms 376 KB correct
11 Correct 2 ms 376 KB correct
12 Correct 2 ms 376 KB correct
13 Correct 2 ms 376 KB correct
14 Correct 4 ms 376 KB correct
15 Correct 4 ms 376 KB correct
16 Correct 4 ms 504 KB correct
17 Correct 4 ms 376 KB correct
18 Correct 3 ms 376 KB correct
19 Correct 4 ms 380 KB correct
20 Correct 4 ms 376 KB correct
21 Correct 4 ms 376 KB correct
22 Correct 3 ms 376 KB correct
23 Correct 3 ms 376 KB correct
24 Correct 3 ms 504 KB correct
25 Correct 2 ms 376 KB correct
26 Correct 3 ms 376 KB correct
27 Correct 3 ms 376 KB correct
28 Correct 3 ms 376 KB correct
29 Correct 2 ms 376 KB correct
30 Correct 3 ms 376 KB correct
31 Correct 3 ms 376 KB correct
32 Correct 2 ms 380 KB correct
33 Correct 3 ms 376 KB correct
34 Correct 92 ms 1616 KB correct
35 Correct 90 ms 1528 KB correct
36 Correct 70 ms 1272 KB correct
37 Correct 25 ms 436 KB correct
38 Correct 92 ms 1652 KB correct
39 Correct 81 ms 1508 KB correct
40 Correct 69 ms 1272 KB correct
41 Correct 87 ms 1652 KB correct
42 Correct 88 ms 1528 KB correct
43 Correct 30 ms 1016 KB correct
44 Correct 25 ms 888 KB correct
45 Correct 28 ms 1016 KB correct
46 Correct 24 ms 888 KB correct
47 Correct 15 ms 632 KB correct
48 Correct 5 ms 376 KB correct
49 Correct 11 ms 504 KB correct
50 Correct 15 ms 632 KB correct
51 Correct 29 ms 1016 KB correct
52 Correct 25 ms 1016 KB correct
53 Correct 24 ms 892 KB correct
54 Correct 30 ms 1020 KB correct
55 Correct 30 ms 1144 KB correct
56 Correct 31 ms 1016 KB correct
57 Correct 30 ms 1016 KB correct
58 Correct 2 ms 376 KB correct
59 Correct 2 ms 376 KB correct
60 Correct 381 ms 3572 KB correct
61 Correct 723 ms 4924 KB correct
62 Correct 730 ms 4868 KB correct
63 Correct 659 ms 4804 KB correct
64 Correct 653 ms 4716 KB correct
65 Correct 663 ms 4768 KB correct
66 Correct 716 ms 4972 KB correct
67 Correct 724 ms 4764 KB correct
68 Correct 714 ms 5644 KB correct
69 Correct 722 ms 5712 KB correct
70 Correct 2 ms 376 KB correct
71 Correct 708 ms 5728 KB correct
72 Correct 713 ms 5780 KB correct
73 Correct 2 ms 376 KB correct
74 Correct 736 ms 5808 KB correct
75 Correct 718 ms 5640 KB correct
76 Correct 238 ms 2416 KB correct
77 Correct 703 ms 5820 KB correct
78 Correct 713 ms 5740 KB correct
79 Correct 727 ms 5868 KB correct
80 Correct 689 ms 5612 KB correct
81 Correct 562 ms 4900 KB correct
82 Correct 690 ms 5564 KB correct
83 Correct 398 ms 3228 KB correct
84 Correct 210 ms 3952 KB correct
85 Correct 195 ms 3396 KB correct
86 Correct 124 ms 2420 KB correct
87 Correct 99 ms 1968 KB correct
88 Correct 82 ms 1536 KB correct
89 Correct 85 ms 1472 KB correct
90 Correct 71 ms 1276 KB correct
91 Correct 36 ms 504 KB correct
92 Correct 16 ms 376 KB correct
93 Correct 186 ms 3428 KB correct
94 Correct 125 ms 2452 KB correct
95 Correct 120 ms 2408 KB correct
96 Correct 80 ms 1512 KB correct
97 Correct 82 ms 1524 KB correct
98 Correct 93 ms 1908 KB correct
99 Correct 82 ms 1528 KB correct
100 Correct 49 ms 632 KB correct
101 Correct 23 ms 504 KB correct
102 Correct 191 ms 3056 KB correct
103 Correct 197 ms 3188 KB correct
104 Correct 190 ms 2960 KB correct
105 Correct 191 ms 3084 KB correct