oj.uz

Submission #331110

# Submission time Handle Problem Language Result Execution time Memory
331110 2020-11-27T11:41:20 Z Sho10 Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 28 ms 5256 KB 
#include <bits/stdc++.h> //Andrei Alexandru a.k.a Sho10
#define ll long long
#include "grader.h"
#define double long double
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#define all(a) (a).begin(), (a).end()
#define f first
#define s second
#define pb push_back
#define mp make_pair
#define pi pair
#define rc(s) return cout<<s,0
#define endl '\n'
#define mod 1000007
#define PI 3.14159265359
#define MAXN 100005
#define INF 1000000005
#define LINF 1000000000000000005ll
#define CODE_START  ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
using namespace std;
vector<ll>g[200005];
vector<ll>v;
void dfs(ll node,ll par){
v.pb(node);
for(auto it : g[node]){
    if(it==par){
        continue;
    }
    dfs(it,node);
}
}
ll check(ll pos){
vector<int>vv;
for(ll i=1;i<=pos;i++)
{
    vv.pb(v[i]);
}
return query(vv);
}
int findEgg (int N, vector < pair < int, int > > bridges){
ll n=N;
for(ll i=1;i<=n;i++)
{
    g[i].clear();
}
for(auto it : bridges){
    g[it.f].pb(it.s);
    g[it.s].pb(it.f);
}
v.clear();
v.pb(0);
dfs(1,0);
ll l=1,r=n;
while(l<r){
    ll mid=(l+r)/2;
    if(check(mid)){
        r=mid;
    }else l=mid+1;
}
return v[l];
}
/*
int32_t main(){
CODE_START
*/

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4972 KB Number of queries: 4
2 Correct 4 ms 4972 KB Number of queries: 4
3 Correct 4 ms 4972 KB Number of queries: 4
4 Correct 4 ms 4972 KB Number of queries: 4

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 5100 KB Number of queries: 8
2 Correct 16 ms 5100 KB Number of queries: 9
3 Correct 23 ms 5100 KB Number of queries: 9
4 Correct 22 ms 5132 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 28 ms 5228 KB Number of queries: 9
2 Correct 21 ms 5100 KB Number of queries: 9
3 Correct 27 ms 5100 KB Number of queries: 9
4 Correct 20 ms 5256 KB Number of queries: 9