| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 918379 | ayankarimova | Easter Eggs (info1cup17_eastereggs) | C++14 | 1 ms | 852 KiB | 
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#include "grader.h"
#define ll long long
using namespace std;
const ll sz=600;
ll used[sz];
vector<ll>g[sz], vec;
ll dfs(ll u)
{
    vec.push_back(u);
    used[u]=1;
    for(auto v:g[u]){
        if(!used[v]){
            dfs(v);
        }
    }
}
int findEgg (int N, vector < pair < int, int > > br)
{
    /*
    if (query ({1})) return 1;
    return N;*/
    for(auto i:br){
        ll u=i.first;
        ll v=i.second;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1);
    ll l=0, r=N-1;
    while(l<=r){
        ll mid=(l+r)/2;
        vector<int>cur;
        for(int i=l; i<=mid; i++){
            cur.push_back(vec[i]);
        }
        int q=query(cur);
        if(q==1){
            r=mid;
        }
        else{
            l=mid+1;
        }
    }
    return vec[l];
}
Compilation message (stderr)
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
| # | Verdict | Execution time | Memory | Grader output | 
|---|---|---|---|---|
| Fetching results... | ||||
