Submission #1145744

#TimeUsernameProblemLanguageResultExecution timeMemory
1145744mitko7Easter Eggs (info1cup17_eastereggs)C++20
0 / 100
0 ms464 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; int n; vector<int> v[600]; int egg = 0; int used[600]; vector<int> bfs(int x) { memset(used, 0, n); used[x]=1; priority_queue<int> q; q.push(x); vector<int> ans; ans.push_back(x); while(!q.empty()) { int c = q.top(); q.pop(); for(int nb : v[c]) { if(!used[nb]) { used[nb] = 1; q.push(nb); ans.push_back(nb); } } } return ans; } void solve(int curr) { if(v[curr].size()==0) { egg = curr; return; } for(int x : v[curr]) { bool is = query(bfs(x)); if(!is) continue; solve(x); } } int findEgg (int N, vector < pair < int, int > > bridges) { //if (query ({1})) return 1; //return N; for(auto x : bridges) { v[x.first].push_back(x.second); } solve(1); return egg; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...