# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
660271 | 2022-11-21T11:46:04 Z | BlancaHM | Easter Eggs (info1cup17_eastereggs) | C++14 | 3 ms | 592 KB |
#include <bits/stdc++.h> #include "grader.h" using namespace std; vector<int> order; vector<vector<int>> listaAdy; void dfs(int nodo, int padre){ order.push_back(nodo); for(int vecino: listaAdy[nodo]){ if(vecino == padre) continue; dfs(vecino, nodo); } } int findEgg (int N, vector < pair < int, int > > bridges) { listaAdy = vector<vector<int>>(N+1); for(pair<int, int> bridge: bridges){ listaAdy[bridge.second].push_back(bridge.first); listaAdy[bridge.first].push_back(bridge.second); } dfs(1, -1); int ans = 1; int lo = 1; int hi = N; vector<int> ask((N)/2); for(int i = 0; i < (N)/2; ++i) ask[i] = order[i]; while(hi > lo){ int mid = (hi + lo)/2; while(ask.size() < (mid)){ ask.push_back(order[ask.size()]); } while(ask.size() > (mid)) ask.pop_back(); if(query(ask)){ hi = mid-1; ans = mid; } else{ lo = mid+1; } } return order[ans-1]; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 464 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 2 ms | 464 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 3 ms | 592 KB | Execution killed with signal 6 |
2 | Halted | 0 ms | 0 KB | - |