# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
361990 | 2021-02-01T14:08:00 Z | keta_tsimakuridze | Easter Eggs (info1cup17_eastereggs) | C++14 | 20 ms | 492 KB |
#include <bits/stdc++.h> #include "grader.h" #define f first #define s second using namespace std; const int N=505; int sz[N],par[N],fix[N],n,Egg[N],cnt,ind[N],timer,ans; vector<int>v,V[N]; void dfs(int u,int p){ timer++; ind[timer]=u; for(int i=0;i<V[u].size();i++){ if(V[u][i]==p) continue; dfs(V[u][i],u); } } int findEgg (int n1, vector < pair < int, int > > b) { n=n1; timer=0; for(int i=1;i<=n;i++)V[i].clear(); for(int i=0;i<b.size();i++){ V[b[i].f].push_back(b[i].s); V[b[i].s].push_back(b[i].f); } dfs(1,0); int l=1,r=n; while(l<=r){ int mid=(l+r)/2; v.clear(); for(int i=1;i<=mid;i++){ v.push_back(ind[i]); } if(query(v)){ ans=ind[mid]; r=mid-1; } else l=mid+1; } return ans; }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Partially correct | 1 ms | 364 KB | Number of queries: 5 |
2 | Partially correct | 1 ms | 364 KB | Number of queries: 5 |
3 | Partially correct | 1 ms | 364 KB | Number of queries: 5 |
4 | Partially correct | 2 ms | 364 KB | Number of queries: 5 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 5 ms | 424 KB | Number of queries: 9 |
2 | Correct | 13 ms | 364 KB | Number of queries: 9 |
3 | Correct | 20 ms | 364 KB | Number of queries: 9 |
4 | Correct | 20 ms | 364 KB | Number of queries: 9 |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 1 ms | 492 KB | Execution killed with signal 11 |
2 | Halted | 0 ms | 0 KB | - |