# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
97694 | 2019-02-17T18:04:07 Z | KLPP | Easter Eggs (info1cup17_eastereggs) | C++14 | 4 ms | 512 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; typedef pair<int,int> pii; int findEgg (int N, vector < pair < int, int > > bridges) { vector<int> nei[N]; int n=N; for(int i=0;i<bridges.size();i++){ nei[bridges[i].first-1].push_back(bridges[i].second-1); nei[bridges[i].second-1].push_back(bridges[i].first-1); } bool b[n]; for(int i=0;i<n;i++)b[i]=false; vector<int> order; queue<int> q; q.push(0); b[0]=true; while(!q.empty()){ int u=q.front();q.pop(); order.push_back(u); for(int i=0;i<nei[u].size();i++){ int v=nei[u][i]; if(!b[v]){ b[v]=true; q.push(v); } } } /*for(int i=0;i<n;i++){ vector<int> v; v.push_back(i+1); if(query(v))return i+1; }*/ //for(int i=0;i<n;i++)cout<<dist[i].second<<endl; int lo=0; int hi=n; while(hi-lo>1){ int mid=(hi+lo)/2; vector<int> v; for(int i=0;i<mid;i++)v.push_back(order[i]+1); if(query(v)){ hi=mid; }else lo=mid; } return lo+1; return 0; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 452 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 4 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |