제출 #865004

#제출 시각아이디문제언어결과실행 시간메모리
865004gutzzyEaster Eggs (info1cup17_eastereggs)C++14
100 / 100
13 ms1276 KiB
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int> islands; vector<bool> visited; vector<vector<int>> lst; void dfs(int nodo){ visited[nodo] = true; islands.push_back(nodo); for(int vecino:lst[nodo]){ if(!visited[vecino]) dfs(vecino); } } int findEgg(int n, vector<pair<int, int>>bridges){ // vector 1D de todas las islas lst = vector<vector<int>>(n); for(auto b:bridges){ lst[b.first-1].push_back(b.second-1); lst[b.second-1].push_back(b.first-1); } visited = vector<bool>(n,false); islands.clear(); dfs(0); for(int i=0;i<n;i++) islands[i]++; // binary search int l = 0; int r = n-1; while(l<r){ int m = (l+r)/2; //cout << l << " " << r << " " << m << endl; bool egg = query({islands.begin(),islands.begin()+m+1}); if(egg) r = m; else l = m+1; } return islands[l]; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...