제출 #1145891

#제출 시각아이디문제언어결과실행 시간메모리
1145891tishoEaster Eggs (info1cup17_eastereggs)C++20
0 / 100
105 ms196608 KiB
#include <iostream> #include <vector> #include <algorithm> #include <cmath> #include <set> #include "grader.h" #define endl '\n' #define ll long long vector<int>v[1005]; vector<int>b; bool used[1005]; void dfs(int a) { used[a]=true; b.push_back(a); for(auto i:v[a]) { if(!used[i]) { dfs(a); } } } int findEgg(int n, vector<pair<int,int>>bridges) { for(int i=0;i<bridges.size();i++) { int x,y; x=bridges[i].first; y=bridges[i].second; v[x].push_back(y); } for(int i=1;i<=n;i++) { if(!used[i]) { dfs(i); } } int l=0,r=b.size()-1,ans=0,m; while(l<=r) { m=l+(r-l)/2; vector<int>cur; for(int i=1;i<=m;i++) { cur.push_back(i); } int isThere=query(cur); if(isThere==1) { r=m-1; } else { l=m+1; } } return m; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...