oj.uz

Submission #360161

# Submission time Handle Problem Language Result Execution time Memory
360161 2021-01-27T14:50:24 Z tengiz05 Easter Eggs (info1cup17_eastereggs) C++17
81 / 100
 14 ms 492 KB 
#include <bits/stdc++.h>
#include "grader.h"
#ifndef EVAL
#include "grader.cpp"
#endif
using namespace std;
const int MAXN = 515;
vector<int> edges[MAXN];
int n;
int sz[MAXN];
bool used[MAXN];
void recalc_size(int u, int p=-1){
	sz[u] = 1;
	for(auto v : edges[u]){
		if(v == p || used[v])continue;
		recalc_size(v,u);
		sz[u] += sz[v];
	}
}
int nn;
int find_centroid(int u, int p=-1){
	for(auto v : edges[u]){
		if(!used[v] && v != p && sz[v] > nn/2)return find_centroid(v,u);
	}return u;
}
vector<int> ttt;
void dfs(int u,int p){
	ttt.push_back(u);
	for(auto v : edges[u]){
		if(v == p || used[v])continue;
		dfs(v,u);
	}
}
bool cmp(int a, int b){
	return sz[a] < sz[b];
}
int findEgg(int N, vector<pair<int,int>> bridges){
	n = N;
	for(auto [u, v] : bridges){
		edges[u].push_back(v);
		edges[v].push_back(u);
	}
	int now = 1;
	while(true){
		recalc_size(now);
		nn = sz[now];
		int u = find_centroid(now);
		now = u;
		recalc_size(now);
		if(nn == 2){
			if(query({now}) == 0){
				int x = -1;
				for(auto v : edges[now])if(!used[v])x=v;
				assert(~x);
				now = x;
			}break;
		}else if(nn == 1){
			break;
		}
		//~ ttt.clear();
		//~ dfs(now,now);
		//~ for(auto x : ttt){
			//~ cout << x << ' ';}cout << '\n';
		vector<int> candidates;
		for(auto v : edges[u]){
			if(!used[v])candidates.push_back(v);
		}
		sort(candidates.begin(),candidates.end(), cmp);reverse(candidates.begin(),candidates.end());
		int sum = 0;
		vector<int> f, s;
		for(auto v : candidates){
			if(sum+sz[v] <= nn/2){
				sum += sz[v];
				f.push_back(v);
			}else {
				s.push_back(v);
			}
		}if(!s.size()){
			s.push_back(f.back());
			f.pop_back();
		}
		vector<int> toask = {u};
		ttt.clear();
		for(auto v : f)dfs(v,u);
		for(auto v : ttt)toask.push_back(v);
		if(query(toask) == 1){
			for(auto v : s)used[v] = true;
		}else {
			for(auto v : f)used[v] = true;
		}
	}
	for(int i=1;i<=n;i++){
		edges[i].clear();
	}memset(used,0,sizeof used);
	return now;
}

Subtask #1
32.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 364 KB Number of queries: 5
2 Partially correct 1 ms 364 KB Number of queries: 5
3 Partially correct 1 ms 364 KB Number of queries: 5
4 Partially correct 1 ms 364 KB Number of queries: 5

Subtask #2
34.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 364 KB Number of queries: 9
2 Partially correct 7 ms 364 KB Number of queries: 11
3 Partially correct 12 ms 364 KB Number of queries: 11
4 Partially correct 12 ms 364 KB Number of queries: 10

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 13 ms 364 KB Number of queries: 10
2 Partially correct 14 ms 384 KB Number of queries: 11
3 Partially correct 11 ms 420 KB Number of queries: 11
4 Partially correct 12 ms 492 KB Number of queries: 10