oj.uz

답안 #135056

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
135056 2019-07-23T15:07:42 Z nvmdava Simurgh (IOI17_simurgh) C++17
100 / 100
 787 ms 4972 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;
#define ff first
#define ss second
#define pb push_back
#define vi vector<int>
#define M 505

vector<pair<int, int> > e;
bool ans[M * M], ch[M * M], in[M];
vi inq, tr, adj[M], vall, qq, ret, cyc, fin, onn, off, nu;
int p[M], t, pp[M], d[M], n, m;

int get(int v, int i){
	return e[i].ff + e[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 dsu(int v, int u){
	p[v = find(v)] = u = find(u);
	return v != u;
}

int ask(){
	reset();
	for(int x : inq)
		dsu(e[x].ff, e[x].ss);
	t = 0;
	for(int x : tr)
		if(dsu(e[x].ff, e[x].ss)){
			inq.pb(x);
			t += ans[x];
		}
	return count_common_roads(inq);
}

void dfs(int v){
	for(int x : adj[v]){
		int u = get(v, x);
		if(d[u]) continue;
		pp[u] = x;
		d[u] = d[v] + 1;
		tr.pb(x);
		dfs(u);
	}
}

int fexc(int a){
   inq.clear();
   for(int x : cyc)
      if(x != a)
         inq.pb(x);
	return ask();
}

void cycle(){
	if(fin.empty()) return;
   int lo;
	if(onn.empty() && off.empty()){
		lo = -1;
		vall = nu;
		for(int x : cyc)
			vall.pb(fexc(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 {
      lo = off.empty() ? fexc(onn[0]) : fexc(off[0]) - 1;
		for(int x : fin){
			ch[x] = 1;
			ans[x] = fexc(x) == lo;
		}
	}
}

void tree(){
	for(int i = 0; i < m; i++){
      int v = e[i].ff, u = e[i].ss;
		if(d[v] < d[u]) swap(v, u);
		if(d[v] - d[u] == 1) continue;
		cyc = fin = off = onn = nu;
		cyc.pb(i);
		int s = v;
		while(s != u){
			cyc.pb(pp[s]);
			if(ch[pp[s]] == 0) fin.pb(pp[s]);
			else if(ans[pp[s]] == 1) onn.pb(pp[s]);
			else off.pb(pp[s]);
			s = get(s, pp[s]);
		}
		cycle();
	}
	for(int x : tr)
		if(!ch[x])
			ch[x] = ans[x] = 1;
}

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;
		qq.pb(adj[v][i]);
		dfs2(u);
	}
}

void vsolve(){
	if(qq.empty()) return;
	inq = qq;
	if(ask() == t){
		for(int x : qq){
			ch[x] = 1;
			ans[x] = 0;
		}
		return;
	}
	int l = 0, r = qq.size() - 1;
	while(l != r){
		int m = (l + r) / 2;
		inq = nu;
		for(int i = 0; i <= m; i++)
			inq.pb(qq[i]);
		if(ask() == t)
         l = m + 1;
		else
         r = m;
	}
	for(int i = 0; i < r; i++){
		ch[qq[i]] = 1;
		ans[qq[i]] = 0;
	}
	ch[qq[r]] = ans[qq[r]] = 1;
}


vi find_roads(int N, vi u, vi v) {
	n = N;
	m = u.size();
	for(int i = 0; i < m; i++){
		adj[v[i]].pb(i);
		adj[u[i]].pb(i);
		e.pb({v[i], u[i]});
	}
	d[0] = 1;
	dfs(0);
	tree();
	do{
		memset(in, 0, sizeof in);
		qq = nu;
		for(int i = 0; i < n; i++)
			if(!in[i])
            dfs2(i);
		vsolve();
	} while(!qq.empty());
	for(int i = 0; i < m; i++)
		if(ans[i])
         ret.pb(i);
	return ret;
}

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 380 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 380 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 380 KB correct
25 Correct 2 ms 376 KB correct
26 Correct 3 ms 376 KB correct
27 Correct 3 ms 420 KB correct
28 Correct 3 ms 376 KB correct
29 Correct 3 ms 376 KB correct
30 Correct 3 ms 376 KB correct
31 Correct 3 ms 376 KB correct
32 Correct 3 ms 376 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 380 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 380 KB correct
25 Correct 2 ms 376 KB correct
26 Correct 3 ms 376 KB correct
27 Correct 3 ms 420 KB correct
28 Correct 3 ms 376 KB correct
29 Correct 3 ms 376 KB correct
30 Correct 3 ms 376 KB correct
31 Correct 3 ms 376 KB correct
32 Correct 3 ms 376 KB correct
33 Correct 3 ms 376 KB correct
34 Correct 98 ms 1528 KB correct
35 Correct 95 ms 1272 KB correct
36 Correct 83 ms 1164 KB correct
37 Correct 29 ms 508 KB correct
38 Correct 98 ms 1524 KB correct
39 Correct 87 ms 1308 KB correct
40 Correct 75 ms 1280 KB correct
41 Correct 93 ms 1396 KB correct
42 Correct 96 ms 1524 KB correct
43 Correct 32 ms 1016 KB correct
44 Correct 27 ms 1016 KB correct
45 Correct 30 ms 892 KB correct
46 Correct 26 ms 888 KB correct
47 Correct 16 ms 504 KB correct
48 Correct 6 ms 376 KB correct
49 Correct 11 ms 376 KB correct
50 Correct 16 ms 632 KB correct
51 Correct 31 ms 888 KB correct
52 Correct 26 ms 1016 KB correct
53 Correct 26 ms 888 KB correct
54 Correct 32 ms 1016 KB correct
55 Correct 31 ms 888 KB correct
56 Correct 32 ms 888 KB correct
57 Correct 32 ms 972 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 403 ms 3684 KB correct
4 Correct 752 ms 4848 KB correct
5 Correct 768 ms 4700 KB correct
6 Correct 695 ms 4864 KB correct
7 Correct 688 ms 4812 KB correct
8 Correct 697 ms 4844 KB correct
9 Correct 757 ms 4972 KB correct
10 Correct 744 ms 4892 KB correct
11 Correct 750 ms 4844 KB correct
12 Correct 748 ms 4860 KB correct
13 Correct 2 ms 376 KB correct
14 Correct 737 ms 4800 KB correct
15 Correct 750 ms 4784 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 380 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 380 KB correct
25 Correct 2 ms 376 KB correct
26 Correct 3 ms 376 KB correct
27 Correct 3 ms 420 KB correct
28 Correct 3 ms 376 KB correct
29 Correct 3 ms 376 KB correct
30 Correct 3 ms 376 KB correct
31 Correct 3 ms 376 KB correct
32 Correct 3 ms 376 KB correct
33 Correct 3 ms 376 KB correct
34 Correct 98 ms 1528 KB correct
35 Correct 95 ms 1272 KB correct
36 Correct 83 ms 1164 KB correct
37 Correct 29 ms 508 KB correct
38 Correct 98 ms 1524 KB correct
39 Correct 87 ms 1308 KB correct
40 Correct 75 ms 1280 KB correct
41 Correct 93 ms 1396 KB correct
42 Correct 96 ms 1524 KB correct
43 Correct 32 ms 1016 KB correct
44 Correct 27 ms 1016 KB correct
45 Correct 30 ms 892 KB correct
46 Correct 26 ms 888 KB correct
47 Correct 16 ms 504 KB correct
48 Correct 6 ms 376 KB correct
49 Correct 11 ms 376 KB correct
50 Correct 16 ms 632 KB correct
51 Correct 31 ms 888 KB correct
52 Correct 26 ms 1016 KB correct
53 Correct 26 ms 888 KB correct
54 Correct 32 ms 1016 KB correct
55 Correct 31 ms 888 KB correct
56 Correct 32 ms 888 KB correct
57 Correct 32 ms 972 KB correct
58 Correct 2 ms 376 KB correct
59 Correct 2 ms 376 KB correct
60 Correct 403 ms 3684 KB correct
61 Correct 752 ms 4848 KB correct
62 Correct 768 ms 4700 KB correct
63 Correct 695 ms 4864 KB correct
64 Correct 688 ms 4812 KB correct
65 Correct 697 ms 4844 KB correct
66 Correct 757 ms 4972 KB correct
67 Correct 744 ms 4892 KB correct
68 Correct 750 ms 4844 KB correct
69 Correct 748 ms 4860 KB correct
70 Correct 2 ms 376 KB correct
71 Correct 737 ms 4800 KB correct
72 Correct 750 ms 4784 KB correct
73 Correct 2 ms 380 KB correct
74 Correct 787 ms 4816 KB correct
75 Correct 742 ms 4848 KB correct
76 Correct 257 ms 2036 KB correct
77 Correct 741 ms 4944 KB correct
78 Correct 754 ms 4840 KB correct
79 Correct 777 ms 4820 KB correct
80 Correct 719 ms 4740 KB correct
81 Correct 596 ms 4180 KB correct
82 Correct 734 ms 4616 KB correct
83 Correct 440 ms 2804 KB correct
84 Correct 227 ms 3440 KB correct
85 Correct 206 ms 2988 KB correct
86 Correct 133 ms 2160 KB correct
87 Correct 104 ms 1648 KB correct
88 Correct 88 ms 1396 KB correct
89 Correct 91 ms 1268 KB correct
90 Correct 77 ms 1144 KB correct
91 Correct 42 ms 504 KB correct
92 Correct 17 ms 460 KB correct
93 Correct 197 ms 3044 KB correct
94 Correct 136 ms 2044 KB correct
95 Correct 130 ms 2012 KB correct
96 Correct 85 ms 1272 KB correct
97 Correct 89 ms 1272 KB correct
98 Correct 104 ms 1816 KB correct
99 Correct 88 ms 1272 KB correct
100 Correct 55 ms 632 KB correct
101 Correct 26 ms 380 KB correct
102 Correct 200 ms 2544 KB correct
103 Correct 211 ms 2548 KB correct
104 Correct 200 ms 2672 KB correct
105 Correct 200 ms 2544 KB correct