Submission #1147170

#TimeUsernameProblemLanguageResultExecution timeMemory
1147170feyzaEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
0 ms452 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; void speed() { ios_base::sync_with_stdio(false); cin.tie(nullptr); cout.tie(nullptr); } const int maxn=600; int n; vector<int>v[maxn],euler; bool used[maxn]; void dfs(int node) { euler.push_back(node); used[node]=true; for(int i : v[node]) { if(!used[i]) dfs(i); } } int findEgg(int N, vector < pair < int, int > > bridges) { memset(used,false,sizeof(used)); for(int i=1;i<=512;i++)v[i].clear(); euler.clear(); for(pair<int,int>p : bridges) { v[p.first].push_back(p.second); v[p.second].push_back(p.first); } int l=0,r=euler.size()-1,mid; vector<int>ask; while(l<r) { mid=(l+r)/2; ask.clear(); for(int i=0;i<=mid;i++)ask.push_back(euler[i]); if(query(ask))r=mid; else l=mid+1; } return euler[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...