# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
1139551 | Agageldi | Easter Eggs (info1cup17_eastereggs) | C++20 | 0 ms | 0 KiB |
#include <bits/stdc++.h>
#include "grader.h"
#include "grader.cpp"
using namespace std;
#define ll long long
#define N 600005
#define pb push_back
#define ff first
#define ss second
#define all(x) x.begin(),x.end()
ll a[N], t,answer, vis[N];
vector <int> f[N];
int findEgg (int n, vector < pair < int, int > > bridges)
{
for(auto i : bridges) {
f[i.ff].pb(i.ss);
f[i.ss].pb(i.ff);
}
for(int i=1;i<=n;i++) {
if(query({i})) {
return i;
}
}
}