| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 385732 | 2021-04-04T20:00:50 Z | Iwanttobreakfree | Easter Eggs (info1cup17_eastereggs) | C++17 | 0 ms | 0 KB |
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
vector<int> c;
/*void conexa(vector<vector<int> >& cone,int raiz,int cont,vector<bool>& visto){
c.push_back(raiz);
visto[raiz]=true;
for(int x: cone[raiz]){
if(c.size()==cont){
return;
}
if(!visto[x]){
conexa(cone,x,cont,visto);
}
}
}*/
int findEgg (int N, vector < pair < int, int > > bridges){
vector<vector<int> > cone(513,vector<int>());
for(int i=0;i<N-1;i++){
cone[bridges[i].first].push_back(bridges[i].second);
cone[bridges[i].second].push_back(bridges[i].first);
if(query(bridges[i])){
vector<int> v(1);
v[0]=bridges.first;
if(query(v))return bridges[i].first;
else return bridges[i].second;
}
}
/*int raiz,sol=0;
vector<int> lista(N);
vector<bool> visto(513,false);
conexa(cone,bridges[0].first,N,visto);
lista=c;
vector<bool> posi(513,true);
int cont=N/2;
while(cont>0){
c.clear();
for(int i=0;i<N;i++){
if(posi[lista[i]]){
raiz=lista[i];
break;
}
}
vector<bool> visto(513,false);
conexa(cone,raiz,cont,visto);
if(query(c)){
set<int> s;
for(int i=0;i<c.size();i++)s.insert(c[i]);
for(int i=0;i<N;i++){
if(s.find(lista[i])==s.end())posi[lista[i]]=false;
}
sol=c[0];
cone[c[0]].clear();
posi[c[0]]=false;
cont/=2;
}
else {
for(int i=0;i<c.size();i++)posi[c[i]]=false;
}
}
return sol;*/
}