Submission #1139542

#TimeUsernameProblemLanguageResultExecution timeMemory
1139542AgageldiEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
6 ms14560 KiB
#include <bits/stdc++.h> #include "grader.h" 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> v[N]; void solve(int x) { if(answer) return; vis[x] = 1; int find = query({x}); if(find) { answer = x; return; } for(auto i : v[x]) { if(vis[i]) continue; solve(i); } } int findEgg(int n, vector<pair<int,int>> bridges) { for(auto i : bridges) { v[i.ff].pb(i.ss); v[i.ss].pb(i.ff); } answer = 0; solve(1); return answer; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...