| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 115972 | HungAnhGoldIBO2020 | Easter Eggs (info1cup17_eastereggs) | C++14 | 0 ms | 0 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<vector>
#include<string.h>
using namespace std;
const int M=515;
bool used[M];
vector<int> lis,adj[M],lis1;
int now,dem;
bool cac;
void dfs(int x,int p){
lis.push_back(x);
if(!used[x]){
lis1.push_back(x);
dem++;
if(dem==now/2){
cac=true;
return;
}
}
for(int i=0;i<adj[x].size();i++){
if(cac){
return;
}
if(adj[x][i]!=p){
dfs(adj[x][i],x);
}
}
}
int findEgg(int N,vector<pair<int,int> > bridges){
memset(used,false,sizeof(used));
int i,j,k,l;
for(i=1;i<M;i++){
adj[i].clear();
}
for(i=0;i<bridges.size();i++){
adj[bridges[i].first].push_back(bridges[i].second);
adj[bridges[i].second].push_back(bridges[i].first);
}
now=N;
while(now>1){
dem=0;
lis.clear();
lis1.clear();
cac=false;
dfs(1,1);
if(query(lis)){
for(i=1;i<=N;i++){
used[i]=true;
}
for(i=0;i<lis1.size();i++){
used[lis1[i]]=false;
}
now=dem;
}
else{
for(i=0;i<lis1.size();i++){
used[lis1[i]]=true;
}
now=now-dem;
}
}
for(i=1;i<=N;i++){
if(!used[i]){
return i;
}
}
}