oj.uz

Submission #1104781

# Submission time Handle Problem Language Result Execution time Memory
1104781 2024-10-24T12:00:53 Z alexander707070 Simurgh (IOI17_simurgh) C++14
51 / 100
 3000 ms 6012 KB 
#include<bits/stdc++.h>
#include "simurgh.h"

#define MAXN 507
#define MAXM 300007
using namespace std;
 
int n,m,dep[MAXN],edges;
vector< pair<int,int> > v[MAXN];

bool intree[MAXM],vis[MAXN];

pair<int,int> edge[MAXM],parent[MAXN];

int value[MAXM],st[MAXM],sumtree;
vector<int> ans;

unordered_set<int> s;

int questions;

int calc(vector<int> rem,vector<int> add){
	questions++;

	for(int i:rem)s.erase(i);
	for(int i:add)s.insert(i);

	vector<int> w;
	for(int i:s){
		w.push_back(i-1);
	}

	for(int i:rem)s.insert(i);
	for(int i:add)s.erase(i);

	return count_common_roads(w);
}

void dfs(int x){
	vis[x]=true;

	for(int i=0;i<v[x].size();i++){
		if(vis[v[x][i].first])continue;

		dep[v[x][i].first]=dep[x]+1;
		parent[v[x][i].first]={x,v[x][i].second};

		dfs(v[x][i].first);

		intree[v[x][i].second]=true;
		s.insert(v[x][i].second);
	}
}

vector<int> path,toask;
int total;

void dfs2(int x){
	vis[x]=true;

	for(int i=0;i<v[x].size();i++){
		if(vis[v[x][i].first] or !intree[v[x][i].second]){
			continue;
		}

		toask.push_back(v[x][i].second-1);
		total-=(value[v[x][i].second]-1);

		dfs2(v[x][i].first);
	}
}

void up(int x,int y){
	if(x==y)return;

	path.push_back(parent[x].second);
	up(parent[x].first,y);
}

int howmany(int root,int l,int r){
	toask.clear();

	for(int i=1;i<=n;i++)vis[i]=false;

	vis[root]=true;
	for(int i=l;i<=r;i++)vis[v[root][i].first]=true;

	for(int i=l;i<=r;i++){
		toask.push_back(v[root][i].second-1);
	}

	total=0;

	dfs2(root);
	for(int i=l;i<=r;i++){
		dfs2(v[root][i].first);
	}

	total+=count_common_roads(toask);

	return total;
}

void solve(int root,int l,int r){
	if(l==r){
		value[v[root][l].second]=2;
		return;
	}

	int mid=(l+r)/2;
	if(howmany(root,l,mid)!=0){
		solve(root,l,mid);
	}

	if(howmany(root,mid+1,r)!=0){
		solve(root,mid+1,r);
	}
}
 
vector<int> find_roads(int N,vector<int> from,vector<int> to){
	n=N; m=int(from.size());

	for(int i=1;i<=m;i++){
		from[i-1]++; to[i-1]++;

		edge[i]={from[i-1],to[i-1]};

		v[from[i-1]].push_back({to[i-1],i});
		v[to[i-1]].push_back({from[i-1],i});
	}

	dfs(1);
	sumtree=calc({},{});

	for(int i=1;i<=m;i++){
		if(intree[i])continue;

		int u=from[i-1],w=to[i-1];
		if(dep[u]>dep[w])swap(u,w);

		path.clear();
		up(w,u);

		int mins=sumtree,maxs=sumtree,br=0,ask=0;

		for(int f:path){
			if(value[f]==0){
				st[f]=calc({f},{i});
				br++;

				mins=min(mins,st[f]);
				maxs=max(maxs,st[f]);
			}
		}

		if(br==0)continue;

		if(mins==maxs){
			for(int f:path){
				if(value[f]==0)continue;

				st[f]=calc({f},{i});
				ask=value[f];
				
				mins=min(mins,st[f]);
				maxs=max(maxs,st[f]);

				break;
			}
		}

		if(ask==0)ask=1;

		for(int f:path){
			if(value[f]!=0)continue;

			if(mins==maxs)value[f]=ask;
			else{
				if(st[f]==mins)value[f]=2;
				else value[f]=1;
			}
		}
	}

	if(edges>n-1)cout<<1/0;
	///if(questions>2*n)cout<<1/0;
	
	for(int i=1;i<=m;i++){
		if(intree[i] and value[i]==0)value[i]=2;
	}

	for(int i=1;i<=n;i++){
		solve(i,0,v[i].size()-1);
	}

	for(int i=1;i<=m;i++){
		if(value[i]==2){
			ans.push_back(i-1);
		}
	}

	return ans;
}

Compilation message

simurgh.cpp: In function 'void dfs(int)':
simurgh.cpp:42:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   42 |  for(int i=0;i<v[x].size();i++){
      |              ~^~~~~~~~~~~~
simurgh.cpp: In function 'void dfs2(int)':
simurgh.cpp:61:15: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |  for(int i=0;i<v[x].size();i++){
      |              ~^~~~~~~~~~~~
simurgh.cpp: In function 'std::vector<int> find_roads(int, std::vector<int>, std::vector<int>)':
simurgh.cpp:185:22: warning: division by zero [-Wdiv-by-zero]
  185 |  if(edges>n-1)cout<<1/0;
      |                     ~^~

Subtask #1
13.0 / 13.0

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

Subtask #2
17.0 / 17.0

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

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB correct
2 Correct 1 ms 2384 KB correct
3 Correct 1 ms 2384 KB correct
4 Correct 1 ms 2384 KB correct
5 Correct 1 ms 2552 KB correct
6 Correct 1 ms 2384 KB correct
7 Correct 1 ms 2384 KB correct
8 Correct 1 ms 2384 KB correct
9 Correct 1 ms 2384 KB correct
10 Correct 1 ms 2384 KB correct
11 Correct 1 ms 2384 KB correct
12 Correct 1 ms 2384 KB correct
13 Correct 1 ms 2384 KB correct
14 Correct 10 ms 2584 KB correct
15 Correct 8 ms 2384 KB correct
16 Correct 8 ms 2384 KB correct
17 Correct 8 ms 2384 KB correct
18 Correct 3 ms 2384 KB correct
19 Correct 9 ms 2384 KB correct
20 Correct 7 ms 2384 KB correct
21 Correct 9 ms 2384 KB correct
22 Correct 5 ms 2384 KB correct
23 Correct 3 ms 2384 KB correct
24 Correct 3 ms 2384 KB correct
25 Correct 1 ms 2384 KB correct
26 Correct 4 ms 2556 KB correct
27 Correct 4 ms 2384 KB correct
28 Correct 2 ms 2384 KB correct
29 Correct 2 ms 2384 KB correct
30 Correct 4 ms 2556 KB correct
31 Correct 4 ms 2384 KB correct
32 Correct 4 ms 2384 KB correct
33 Correct 4 ms 2384 KB correct
34 Correct 1477 ms 3656 KB correct
35 Correct 1354 ms 3676 KB correct
36 Correct 886 ms 3516 KB correct
37 Correct 29 ms 2384 KB correct
38 Correct 1524 ms 3712 KB correct
39 Correct 1108 ms 3408 KB correct
40 Correct 795 ms 3484 KB correct
41 Correct 957 ms 3656 KB correct
42 Correct 977 ms 3688 KB correct
43 Correct 382 ms 3152 KB correct
44 Correct 238 ms 3068 KB correct
45 Correct 302 ms 2896 KB correct
46 Correct 203 ms 3064 KB correct
47 Correct 66 ms 2640 KB correct
48 Correct 7 ms 2384 KB correct
49 Correct 19 ms 2384 KB correct
50 Correct 63 ms 2808 KB correct
51 Correct 291 ms 2896 KB correct
52 Correct 252 ms 2896 KB correct
53 Correct 183 ms 2896 KB correct
54 Correct 346 ms 3152 KB correct
55 Correct 386 ms 2896 KB correct
56 Correct 393 ms 3144 KB correct
57 Correct 402 ms 2896 KB correct

Subtask #4
0 / 19.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB correct
2 Correct 1 ms 2384 KB correct
3 Execution timed out 3090 ms 6012 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2384 KB correct
2 Correct 1 ms 2384 KB correct
3 Correct 1 ms 2384 KB correct
4 Correct 1 ms 2384 KB correct
5 Correct 1 ms 2552 KB correct
6 Correct 1 ms 2384 KB correct
7 Correct 1 ms 2384 KB correct
8 Correct 1 ms 2384 KB correct
9 Correct 1 ms 2384 KB correct
10 Correct 1 ms 2384 KB correct
11 Correct 1 ms 2384 KB correct
12 Correct 1 ms 2384 KB correct
13 Correct 1 ms 2384 KB correct
14 Correct 10 ms 2584 KB correct
15 Correct 8 ms 2384 KB correct
16 Correct 8 ms 2384 KB correct
17 Correct 8 ms 2384 KB correct
18 Correct 3 ms 2384 KB correct
19 Correct 9 ms 2384 KB correct
20 Correct 7 ms 2384 KB correct
21 Correct 9 ms 2384 KB correct
22 Correct 5 ms 2384 KB correct
23 Correct 3 ms 2384 KB correct
24 Correct 3 ms 2384 KB correct
25 Correct 1 ms 2384 KB correct
26 Correct 4 ms 2556 KB correct
27 Correct 4 ms 2384 KB correct
28 Correct 2 ms 2384 KB correct
29 Correct 2 ms 2384 KB correct
30 Correct 4 ms 2556 KB correct
31 Correct 4 ms 2384 KB correct
32 Correct 4 ms 2384 KB correct
33 Correct 4 ms 2384 KB correct
34 Correct 1477 ms 3656 KB correct
35 Correct 1354 ms 3676 KB correct
36 Correct 886 ms 3516 KB correct
37 Correct 29 ms 2384 KB correct
38 Correct 1524 ms 3712 KB correct
39 Correct 1108 ms 3408 KB correct
40 Correct 795 ms 3484 KB correct
41 Correct 957 ms 3656 KB correct
42 Correct 977 ms 3688 KB correct
43 Correct 382 ms 3152 KB correct
44 Correct 238 ms 3068 KB correct
45 Correct 302 ms 2896 KB correct
46 Correct 203 ms 3064 KB correct
47 Correct 66 ms 2640 KB correct
48 Correct 7 ms 2384 KB correct
49 Correct 19 ms 2384 KB correct
50 Correct 63 ms 2808 KB correct
51 Correct 291 ms 2896 KB correct
52 Correct 252 ms 2896 KB correct
53 Correct 183 ms 2896 KB correct
54 Correct 346 ms 3152 KB correct
55 Correct 386 ms 2896 KB correct
56 Correct 393 ms 3144 KB correct
57 Correct 402 ms 2896 KB correct
58 Correct 1 ms 2384 KB correct
59 Correct 1 ms 2384 KB correct
60 Execution timed out 3090 ms 6012 KB Time limit exceeded
61 Halted 0 ms 0 KB -