oj.uz

Submission #778299

# Submission time Handle Problem Language Result Execution time Memory
778299 2023-07-10T08:20:07 Z CSQ31 Simurgh (IOI17_simurgh) C++17
70 / 100
 258 ms 11020 KB 
#include "simurgh.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define fi first
#define se second
#define sz(a) (int)(a.size())
#define all(a) a.begin(),a.end()
typedef long long int ll;
typedef pair<int,int> pii;
const int MAXN = 2e5;
int par[MAXN],szz[MAXN],good[MAXN],tree[MAXN];
vector<pii>adj[MAXN],ed;
int find(int x){
	if(x==par[x])return x;
	return par[x] = find(par[x]);
}
bool unite(int a,int b){
	a = find(a);
	b = find(b);
	if(a==b)return 0;
	if(szz[a] > szz[b])swap(a,b);
	par[a] = b;
	szz[b]+=szz[a];
	return 1;
}
void init(int n){
	for(int i=0;i<n;i++){
		par[i] = i;
		szz[i] = 1;
	}
}
set<int>edges;
vector<int>edge;
int Q = 0;
int ask(){
	Q++;
	assert(Q<=9000);
	vector<int>r;
	if(edges.empty())for(int x:edge)r.pb(x);
	else for(int x:edges)r.pb(x);
	//assert(sz(r)==nn-1);
	return count_common_roads(r);
}
 
pii p[MAXN];
int dep[MAXN],vis[MAXN],glob;
void dfs(int v,int u){
	vis[v] = 1;
	for(pii z:adj[v]){
		int x = z.fi;
		int id = z.se;
		if(vis[x] || x==u)continue;
		tree[id] = 1;
		edges.insert(id);
		dep[x] = dep[v]+1;
		p[x] = {v,id};
		dfs(x,v);
	}
}
void dfs2(int v,int u){
	
	for(pii z:adj[v]){
		int x = z.fi;
		int id = z.se;
		if(tree[id]){
			if(x!=u)dfs2(x,v);
			continue;
		}
		if(dep[x] > dep[v])continue; //go downwards
		
		vector<int>path,res;
		int cur = v;
		while(cur != x){
			path.pb(p[cur].se);
			cur = p[cur].fi;
		}
		//for(int e:path)cout<<e<<" ";
		//cout<<'\n';
		int have = 0;
		for(int e:path)have += (good[e] == -1);
		if(!have)continue; //if all tree edge part of this cycle is known,skip
		edges.insert(id);
		if(have == sz(path)){ //everything is unknown
			//cout<<"case 1"<<'\n';
			for(int e:path){
				edges.erase(e);
				res.pb(ask());
				edges.insert(e);
			}
			path.pb(id);
			res.pb(glob);
			int s = sz(path);
			for(int i=0;i<s;i++){
				int j = (i+s-1) % s;
				if(res[i] == res[j])continue;
				good[path[i]] = 1;
				good[path[j]] = 0;
				if(res[i] > res[j])swap(good[path[i]],good[path[j]]);
			}
			for(int i=0;i<s;i++){
				int j = (i+s-1) % s;
				if(good[path[j]] >= 0 && res[i] == res[j])good[path[i]] = good[path[j]];
			}
			for(int i=s-1;i>=0;i--){
				int j = (i+1) % s;
				if(good[path[j]] >= 0 && res[i] == res[j])good[path[i]] = good[path[j]];
			}
			for(int x:path){
				if(good[x] == -1)good[x] = 0;
			}
		}else{
			//cout<<"case 2"<<'\n';
			if(good[id] == -1){
				for(int e:path){
					if(good[e] == -1)continue;
					edges.erase(e);
					int res2 = ask();
					edges.insert(e);
					if(res2 == glob)good[id] = good[e];
					else if(res2 > glob)good[id] = 1; 
					else good[id] = 0;
					break;
				}
			}
			//cout<<good[id]<<'\n';
			for(int e:path){
				if(good[e] != -1)continue;
				edges.erase(e);
				int res2 = ask();
				edges.insert(e);
				if(res2 == glob)good[e] = good[id];
				else if(res2 > glob)good[e] = 0;
				else good[e] = 1;
			}
		}
		edges.erase(id);
	}
}
vector<int>e,solved;
void solve(vector<int>e,int n){
	init(n);
	edge.clear();
	for(int x:e){
		unite(ed[x].fi,ed[x].se);
		edge.pb(x);
	}
	int tot = 0;
	for(int i:solved){
		if(unite(ed[i].fi,ed[i].se)){
			edge.pb(i);
			tot+=good[i];
		}
		
	}
	int res = ask();
	edge.clear();
	if(res == tot){
		for(int x:e)good[x] = 0;
		return;
	}else if(res == tot + sz(e)){
		for(int x:e)good[x] = 1;
		return;
	}
	int m = sz(e);
	if(m==1)return;
	vector<int>l,r;
	for(int i=0;i<m/2;i++)l.pb(e[i]);
	for(int i=m/2;i<m;i++)r.pb(e[i]);
	solve(l,n);
	solve(r,n);
	
	
}
mt19937 seed(chrono::high_resolution_clock::now().time_since_epoch().count());
vector<int> find_roads(int N,vector<int> u,vector<int> v) {
	int n = N;
	int m = sz(u);
	for(int i=0;i<m;i++)ed.pb({v[i],u[i]});
	for(int i=0;i<m;i++){
		good[i] = -1;
		adj[u[i]].pb({v[i],i});
		adj[v[i]].pb({u[i],i});
	}
	dfs(0,-1);
	glob = ask();
	dfs2(0,-1);
	assert(Q<=1000);
 
	for(int x:edges){
		if(good[x]==-1)good[x] = 1; //this is a bridge	
	}
	for(int i=0;i<m;i++){
		if(good[i]>=0)solved.pb(i);
	}
	edges.clear();
	for(int i=0;i<n;i++){
		e.clear();
		for(pii x:adj[i]){
			if(good[x.se] == -1 && x.fi < i)e.pb(x.se);
		}
		if(e.empty())continue;
		solve(e,n);
	}
	vector<int>ans;
	for(int i=0;i<m;i++){
		if(good[i] == 1)ans.pb(i);
	}
	return ans;
}

Subtask #1
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB correct
2 Correct 2 ms 4948 KB correct
3 Correct 2 ms 4948 KB correct
4 Correct 2 ms 4948 KB correct
5 Correct 2 ms 4948 KB correct
6 Correct 2 ms 4948 KB correct
7 Correct 2 ms 4948 KB correct
8 Correct 2 ms 4948 KB correct
9 Correct 2 ms 4948 KB correct
10 Correct 2 ms 4948 KB correct
11 Correct 2 ms 4948 KB correct
12 Correct 3 ms 4924 KB correct
13 Correct 3 ms 5000 KB correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB correct
2 Correct 2 ms 4948 KB correct
3 Correct 2 ms 4948 KB correct
4 Correct 2 ms 4948 KB correct
5 Correct 2 ms 4948 KB correct
6 Correct 2 ms 4948 KB correct
7 Correct 2 ms 4948 KB correct
8 Correct 2 ms 4948 KB correct
9 Correct 2 ms 4948 KB correct
10 Correct 2 ms 4948 KB correct
11 Correct 2 ms 4948 KB correct
12 Correct 3 ms 4924 KB correct
13 Correct 3 ms 5000 KB correct
14 Correct 4 ms 5204 KB correct
15 Correct 4 ms 5076 KB correct
16 Correct 3 ms 5076 KB correct
17 Correct 3 ms 5076 KB correct
18 Correct 3 ms 5076 KB correct
19 Correct 4 ms 5076 KB correct
20 Correct 4 ms 5076 KB correct
21 Correct 4 ms 5112 KB correct
22 Correct 3 ms 5076 KB correct
23 Correct 3 ms 5076 KB correct
24 Correct 3 ms 5088 KB correct
25 Correct 2 ms 4948 KB correct
26 Correct 3 ms 5076 KB correct
27 Correct 3 ms 5076 KB correct
28 Correct 3 ms 5028 KB correct
29 Correct 3 ms 4948 KB correct
30 Correct 3 ms 5076 KB correct
31 Correct 3 ms 5064 KB correct
32 Correct 3 ms 5076 KB correct
33 Correct 4 ms 5076 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB correct
2 Correct 2 ms 4948 KB correct
3 Correct 2 ms 4948 KB correct
4 Correct 2 ms 4948 KB correct
5 Correct 2 ms 4948 KB correct
6 Correct 2 ms 4948 KB correct
7 Correct 2 ms 4948 KB correct
8 Correct 2 ms 4948 KB correct
9 Correct 2 ms 4948 KB correct
10 Correct 2 ms 4948 KB correct
11 Correct 2 ms 4948 KB correct
12 Correct 3 ms 4924 KB correct
13 Correct 3 ms 5000 KB correct
14 Correct 4 ms 5204 KB correct
15 Correct 4 ms 5076 KB correct
16 Correct 3 ms 5076 KB correct
17 Correct 3 ms 5076 KB correct
18 Correct 3 ms 5076 KB correct
19 Correct 4 ms 5076 KB correct
20 Correct 4 ms 5076 KB correct
21 Correct 4 ms 5112 KB correct
22 Correct 3 ms 5076 KB correct
23 Correct 3 ms 5076 KB correct
24 Correct 3 ms 5088 KB correct
25 Correct 2 ms 4948 KB correct
26 Correct 3 ms 5076 KB correct
27 Correct 3 ms 5076 KB correct
28 Correct 3 ms 5028 KB correct
29 Correct 3 ms 4948 KB correct
30 Correct 3 ms 5076 KB correct
31 Correct 3 ms 5064 KB correct
32 Correct 3 ms 5076 KB correct
33 Correct 4 ms 5076 KB correct
34 Correct 47 ms 6500 KB correct
35 Correct 48 ms 6472 KB correct
36 Correct 50 ms 6232 KB correct
37 Correct 11 ms 5176 KB correct
38 Correct 55 ms 6448 KB correct
39 Correct 42 ms 6352 KB correct
40 Correct 36 ms 6224 KB correct
41 Correct 25 ms 6500 KB correct
42 Correct 23 ms 6480 KB correct
43 Correct 14 ms 5972 KB correct
44 Correct 13 ms 5716 KB correct
45 Correct 14 ms 5716 KB correct
46 Correct 12 ms 5588 KB correct
47 Correct 8 ms 5332 KB correct
48 Correct 4 ms 5076 KB correct
49 Correct 6 ms 5192 KB correct
50 Correct 8 ms 5332 KB correct
51 Correct 14 ms 5776 KB correct
52 Correct 12 ms 5624 KB correct
53 Correct 12 ms 5560 KB correct
54 Correct 17 ms 6020 KB correct
55 Correct 17 ms 5788 KB correct
56 Correct 17 ms 5716 KB correct
57 Correct 17 ms 5716 KB correct

Subtask #4
19.0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB correct
2 Correct 2 ms 4948 KB correct
3 Correct 151 ms 9212 KB correct
4 Correct 255 ms 10948 KB correct
5 Correct 257 ms 10936 KB correct
6 Correct 149 ms 10848 KB correct
7 Correct 224 ms 10956 KB correct
8 Correct 218 ms 10928 KB correct
9 Correct 250 ms 10944 KB correct
10 Correct 252 ms 10948 KB correct
11 Correct 245 ms 10904 KB correct
12 Correct 258 ms 10848 KB correct
13 Correct 2 ms 4948 KB correct
14 Correct 218 ms 11020 KB correct
15 Correct 255 ms 10936 KB correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB correct
2 Correct 2 ms 4948 KB correct
3 Correct 2 ms 4948 KB correct
4 Correct 2 ms 4948 KB correct
5 Correct 2 ms 4948 KB correct
6 Correct 2 ms 4948 KB correct
7 Correct 2 ms 4948 KB correct
8 Correct 2 ms 4948 KB correct
9 Correct 2 ms 4948 KB correct
10 Correct 2 ms 4948 KB correct
11 Correct 2 ms 4948 KB correct
12 Correct 3 ms 4924 KB correct
13 Correct 3 ms 5000 KB correct
14 Correct 4 ms 5204 KB correct
15 Correct 4 ms 5076 KB correct
16 Correct 3 ms 5076 KB correct
17 Correct 3 ms 5076 KB correct
18 Correct 3 ms 5076 KB correct
19 Correct 4 ms 5076 KB correct
20 Correct 4 ms 5076 KB correct
21 Correct 4 ms 5112 KB correct
22 Correct 3 ms 5076 KB correct
23 Correct 3 ms 5076 KB correct
24 Correct 3 ms 5088 KB correct
25 Correct 2 ms 4948 KB correct
26 Correct 3 ms 5076 KB correct
27 Correct 3 ms 5076 KB correct
28 Correct 3 ms 5028 KB correct
29 Correct 3 ms 4948 KB correct
30 Correct 3 ms 5076 KB correct
31 Correct 3 ms 5064 KB correct
32 Correct 3 ms 5076 KB correct
33 Correct 4 ms 5076 KB correct
34 Correct 47 ms 6500 KB correct
35 Correct 48 ms 6472 KB correct
36 Correct 50 ms 6232 KB correct
37 Correct 11 ms 5176 KB correct
38 Correct 55 ms 6448 KB correct
39 Correct 42 ms 6352 KB correct
40 Correct 36 ms 6224 KB correct
41 Correct 25 ms 6500 KB correct
42 Correct 23 ms 6480 KB correct
43 Correct 14 ms 5972 KB correct
44 Correct 13 ms 5716 KB correct
45 Correct 14 ms 5716 KB correct
46 Correct 12 ms 5588 KB correct
47 Correct 8 ms 5332 KB correct
48 Correct 4 ms 5076 KB correct
49 Correct 6 ms 5192 KB correct
50 Correct 8 ms 5332 KB correct
51 Correct 14 ms 5776 KB correct
52 Correct 12 ms 5624 KB correct
53 Correct 12 ms 5560 KB correct
54 Correct 17 ms 6020 KB correct
55 Correct 17 ms 5788 KB correct
56 Correct 17 ms 5716 KB correct
57 Correct 17 ms 5716 KB correct
58 Correct 3 ms 4948 KB correct
59 Correct 2 ms 4948 KB correct
60 Correct 151 ms 9212 KB correct
61 Correct 255 ms 10948 KB correct
62 Correct 257 ms 10936 KB correct
63 Correct 149 ms 10848 KB correct
64 Correct 224 ms 10956 KB correct
65 Correct 218 ms 10928 KB correct
66 Correct 250 ms 10944 KB correct
67 Correct 252 ms 10948 KB correct
68 Correct 245 ms 10904 KB correct
69 Correct 258 ms 10848 KB correct
70 Correct 2 ms 4948 KB correct
71 Correct 218 ms 11020 KB correct
72 Correct 255 ms 10936 KB correct
73 Correct 2 ms 4948 KB correct
74 Incorrect 241 ms 10932 KB WA in grader: NO
75 Halted 0 ms 0 KB -