oj.uz

Submission #1048523

# Submission time Handle Problem Language Result Execution time Memory
1048523 2024-08-08T08:06:24 Z pcc Simurgh (IOI17_simurgh) C++17
51 / 100
 197 ms 7484 KB 
#include "simurgh.h"
#include <bits/stdc++.h>
using namespace std;

#define pii pair<int,int>
#define fs first
#define sc second

const int mxn = 550;
pii par[mxn];
vector<pii> paths[mxn];
vector<pii> tree[mxn];
vector<int> back_edge;
int tp[mxn*mxn];
vector<pii> edges;
int dep[mxn];
vector<int> tree_edge;
set<int> tree_st;
int normal = 0;

/*
std::vector<int> r(n - 1);
for(int i = 0; i < n - 1; i++)
	r[i] = i;
int common = count_common_roads(r);
if(common == n - 1)
	return r;
r[0] = n - 1;
return r;
*/

struct DSU{
	int dsu[mxn],sz[mxn];
	DSU(){
		iota(dsu,dsu+mxn,0);
		fill(sz,sz+mxn,1);
	}
	int root(int k){
		return k == dsu[k]?k:dsu[k] = root(dsu[k]);
	}
	void onion(int a,int b){
		a = root(a),b = root(b);
		if(a == b)return;
		if(sz[a]<sz[b])swap(a,b);
		sz[a] += sz[b];
		dsu[b] = a;
	}
};
DSU dsu;

void dfs(int now,int fa){
	for(auto &[nxt,id]:paths[now]){
		if(nxt == fa)continue;
		if(par[nxt].fs == -1){
			tree_edge.push_back(id);
			par[nxt] = pii(now,id);
			dep[nxt] = dep[now]+1;
			dfs(nxt,now);
		}
		else{
			back_edge.push_back(id);
		}
	}
	return;
}

int C = 0;

int ask(vector<int> &v){
	C++;
	assert(C<=30000);
	int re = count_common_roads(v);
	return re;
}

int ask(set<int> &st){
	vector<int> v;
	for(auto &i:st)v.push_back(i);
	return ask(v);
}

void solve_cycle(vector<int> &v,int eid){
	vector<int> res;
	auto st = tree_st;
	st.insert(eid);
	for(auto &i:v){
		st.erase(i);
		res.push_back(ask(st));
		st.insert(i);
	}
	st.erase(eid);
	int mn = *min_element(res.begin(),res.end());
	int mx = *max_element(res.begin(),res.end());
	//cerr<<"CYCLE: "<<mx<<' '<<mn<<endl;for(auto &i:v)cerr<<i<<',';cerr<<endl;for(auto &i:res)cerr<<i<<',';cerr<<endl;
	if(mn == mx){
		if(normal == mn){
			tp[eid] = 0;
			for(auto &i:v)tp[i] = 0;
		}
		else if(normal<mn){
			tp[eid] = 1;dsu.onion(edges[eid].fs,edges[eid].sc);
			for(auto &i:v)tp[i] = 0;
		}
		else if(normal>mn){
			tp[eid] = 0;
			for(auto &i:v)tp[i] = 1,dsu.onion(edges[i].fs,edges[i].sc);
		}
	}
	else{
		assert(mx-mn == 1);
		if(mx>normal)tp[eid] = 1;
		else tp[eid] = 0;
		for(int i = 0;i<v.size();i++){
			if(res[i] == mx)tp[v[i]] = 0;
			else tp[v[i]] = 1,dsu.onion(edges[v[i]].fs,edges[v[i]].sc);
		}
	}
	return;
}

void solve(int eid){
	auto [a,b] = edges[eid];
	if(dep[a]>dep[b])swap(a,b);
	if(dsu.root(a) == dsu.root(b)){
		tp[eid] = 0;
		return;
	}
	int tmp = b;
	vector<int> v;
	while(tmp != a){
		v.push_back(par[tmp].sc);
		tmp = par[tmp].fs;
		//cerr<<v.back()<<','<<tmp<<' '<<a<<endl;
	}
	//cerr<<"SOLVE: "<<eid<<"::";for(auto &i:v)cerr<<i<<',';cerr<<endl;
	int checker = -1;
	for(auto &i:v){
		if(tp[i] != -1)checker = i;
	}
	if(checker == -1)solve_cycle(v,eid);
	else{
		auto st = tree_st;
		st.erase(checker);
		st.insert(eid);
		int re = ask(st);
		if(re == normal)tp[eid] = tp[checker];
		else tp[eid] = tp[checker]^1;
		st.erase(eid);
		st.insert(checker);
		//cerr<<"CHECKER: "<<checker<<','<<re<<endl;
		for(auto &i:v){
			if(tp[i] == -1){
				auto [a,b] = edges[i];
				if(dsu.root(a) == dsu.root(b)){
					continue;
				}
				st.erase(i);
				st.insert(eid);
				//cerr<<i<<"::";for(auto &j:st)cerr<<j<<',';cerr<<ask(st)<<endl;
				if(ask(st) == normal)tp[i] = tp[eid];
				else tp[i] = tp[eid]^1;
				if(tp[i]){
					dsu.onion(a,b);
				}
				st.insert(i);
				st.erase(eid);
			}
		}
	}
	//cerr<<"EDGES: ";for(int i = 0;i<edges.size();i++)cerr<<tp[i]<<' ';cerr<<endl;
	return;
}

std::vector<int> find_roads(int n, std::vector<int> u, std::vector<int> v) {
	memset(tp,-1,sizeof(tp));
	for(auto &i:par)i = pii(-1,-1);
	for(int i = 0;i<u.size();i++){
		int a = u[i],b = v[i];
		edges.push_back(pii(a,b));
		paths[a].push_back(pii(b,i));
		paths[b].push_back(pii(a,i));
	}
	par[0] = pii(0,-1);
	dfs(0,0);
	sort(back_edge.begin(),back_edge.end());
	back_edge.resize(unique(back_edge.begin(),back_edge.end())-back_edge.begin());
	for(auto &i:tree_edge)tree_st.insert(i);
	//cerr<<"TREE :";for(auto &i:tree_edge)cerr<<i<<',';cerr<<endl;
	normal = ask(tree_edge);
	//cerr<<"NORMAL: "<<normal<<endl;
	for(auto &i:back_edge)solve(i);
	vector<int> ans;
	for(int i = 0;i<edges.size();i++)if(tp[i] != 0)ans.push_back(i);
	//cerr<<C<<" ASKS"<<endl;
	//cerr<<"ANS: ";for(auto &i:ans)cerr<<i<<',';cerr<<endl;
	return ans;
}

Compilation message

simurgh.cpp: In function 'void solve_cycle(std::vector<int>&, int)':
simurgh.cpp:113:18: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  113 |   for(int i = 0;i<v.size();i++){
      |                 ~^~~~~~~~~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:177:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  177 |  for(int i = 0;i<u.size();i++){
      |                ~^~~~~~~~~
simurgh.cpp:193:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  193 |  for(int i = 0;i<edges.size();i++)if(tp[i] != 0)ans.push_back(i);
      |                ~^~~~~~~~~~~~~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB correct
2 Correct 1 ms 1628 KB correct
3 Correct 1 ms 1628 KB correct
4 Correct 1 ms 1628 KB correct
5 Correct 0 ms 1628 KB correct
6 Correct 1 ms 1628 KB correct
7 Correct 0 ms 1628 KB correct
8 Correct 0 ms 1628 KB correct
9 Correct 1 ms 1628 KB correct
10 Correct 0 ms 1628 KB correct
11 Correct 1 ms 1628 KB correct
12 Correct 0 ms 1628 KB correct
13 Correct 1 ms 1628 KB correct
14 Correct 3 ms 1624 KB correct
15 Correct 3 ms 1628 KB correct
16 Correct 3 ms 1628 KB correct
17 Correct 2 ms 1520 KB correct
18 Correct 2 ms 1628 KB correct
19 Correct 2 ms 1628 KB correct
20 Correct 2 ms 1628 KB correct
21 Correct 2 ms 1628 KB correct
22 Correct 2 ms 1628 KB correct
23 Correct 2 ms 1628 KB correct
24 Correct 1 ms 1628 KB correct
25 Correct 1 ms 1628 KB correct
26 Correct 1 ms 1712 KB correct
27 Correct 2 ms 1628 KB correct
28 Correct 1 ms 1628 KB correct
29 Correct 1 ms 1628 KB correct
30 Correct 2 ms 1628 KB correct
31 Correct 2 ms 1628 KB correct
32 Correct 1 ms 1628 KB correct
33 Correct 1 ms 1628 KB correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB correct
2 Correct 1 ms 1628 KB correct
3 Correct 1 ms 1628 KB correct
4 Correct 1 ms 1628 KB correct
5 Correct 0 ms 1628 KB correct
6 Correct 1 ms 1628 KB correct
7 Correct 0 ms 1628 KB correct
8 Correct 0 ms 1628 KB correct
9 Correct 1 ms 1628 KB correct
10 Correct 0 ms 1628 KB correct
11 Correct 1 ms 1628 KB correct
12 Correct 0 ms 1628 KB correct
13 Correct 1 ms 1628 KB correct
14 Correct 3 ms 1624 KB correct
15 Correct 3 ms 1628 KB correct
16 Correct 3 ms 1628 KB correct
17 Correct 2 ms 1520 KB correct
18 Correct 2 ms 1628 KB correct
19 Correct 2 ms 1628 KB correct
20 Correct 2 ms 1628 KB correct
21 Correct 2 ms 1628 KB correct
22 Correct 2 ms 1628 KB correct
23 Correct 2 ms 1628 KB correct
24 Correct 1 ms 1628 KB correct
25 Correct 1 ms 1628 KB correct
26 Correct 1 ms 1712 KB correct
27 Correct 2 ms 1628 KB correct
28 Correct 1 ms 1628 KB correct
29 Correct 1 ms 1628 KB correct
30 Correct 2 ms 1628 KB correct
31 Correct 2 ms 1628 KB correct
32 Correct 1 ms 1628 KB correct
33 Correct 1 ms 1628 KB correct
34 Correct 193 ms 3544 KB correct
35 Correct 184 ms 3560 KB correct
36 Correct 123 ms 3112 KB correct
37 Correct 7 ms 1632 KB correct
38 Correct 185 ms 3600 KB correct
39 Correct 173 ms 3284 KB correct
40 Correct 128 ms 3028 KB correct
41 Correct 184 ms 3588 KB correct
42 Correct 197 ms 3540 KB correct
43 Correct 94 ms 2648 KB correct
44 Correct 77 ms 2392 KB correct
45 Correct 92 ms 2652 KB correct
46 Correct 68 ms 2396 KB correct
47 Correct 34 ms 1884 KB correct
48 Correct 2 ms 1628 KB correct
49 Correct 10 ms 1628 KB correct
50 Correct 28 ms 1884 KB correct
51 Correct 89 ms 2396 KB correct
52 Correct 75 ms 2396 KB correct
53 Correct 65 ms 2396 KB correct
54 Correct 94 ms 2648 KB correct
55 Correct 91 ms 2652 KB correct
56 Correct 94 ms 2648 KB correct
57 Correct 91 ms 2652 KB correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB correct
2 Correct 1 ms 1628 KB correct
3 Incorrect 156 ms 7484 KB WA in grader: NO
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 1628 KB correct
2 Correct 1 ms 1628 KB correct
3 Correct 1 ms 1628 KB correct
4 Correct 1 ms 1628 KB correct
5 Correct 0 ms 1628 KB correct
6 Correct 1 ms 1628 KB correct
7 Correct 0 ms 1628 KB correct
8 Correct 0 ms 1628 KB correct
9 Correct 1 ms 1628 KB correct
10 Correct 0 ms 1628 KB correct
11 Correct 1 ms 1628 KB correct
12 Correct 0 ms 1628 KB correct
13 Correct 1 ms 1628 KB correct
14 Correct 3 ms 1624 KB correct
15 Correct 3 ms 1628 KB correct
16 Correct 3 ms 1628 KB correct
17 Correct 2 ms 1520 KB correct
18 Correct 2 ms 1628 KB correct
19 Correct 2 ms 1628 KB correct
20 Correct 2 ms 1628 KB correct
21 Correct 2 ms 1628 KB correct
22 Correct 2 ms 1628 KB correct
23 Correct 2 ms 1628 KB correct
24 Correct 1 ms 1628 KB correct
25 Correct 1 ms 1628 KB correct
26 Correct 1 ms 1712 KB correct
27 Correct 2 ms 1628 KB correct
28 Correct 1 ms 1628 KB correct
29 Correct 1 ms 1628 KB correct
30 Correct 2 ms 1628 KB correct
31 Correct 2 ms 1628 KB correct
32 Correct 1 ms 1628 KB correct
33 Correct 1 ms 1628 KB correct
34 Correct 193 ms 3544 KB correct
35 Correct 184 ms 3560 KB correct
36 Correct 123 ms 3112 KB correct
37 Correct 7 ms 1632 KB correct
38 Correct 185 ms 3600 KB correct
39 Correct 173 ms 3284 KB correct
40 Correct 128 ms 3028 KB correct
41 Correct 184 ms 3588 KB correct
42 Correct 197 ms 3540 KB correct
43 Correct 94 ms 2648 KB correct
44 Correct 77 ms 2392 KB correct
45 Correct 92 ms 2652 KB correct
46 Correct 68 ms 2396 KB correct
47 Correct 34 ms 1884 KB correct
48 Correct 2 ms 1628 KB correct
49 Correct 10 ms 1628 KB correct
50 Correct 28 ms 1884 KB correct
51 Correct 89 ms 2396 KB correct
52 Correct 75 ms 2396 KB correct
53 Correct 65 ms 2396 KB correct
54 Correct 94 ms 2648 KB correct
55 Correct 91 ms 2652 KB correct
56 Correct 94 ms 2648 KB correct
57 Correct 91 ms 2652 KB correct
58 Correct 1 ms 1628 KB correct
59 Correct 1 ms 1628 KB correct
60 Incorrect 156 ms 7484 KB WA in grader: NO
61 Halted 0 ms 0 KB -