oj.uz

Submission #563551

# Submission time Handle Problem Language Result Execution time Memory
563551 2022-05-17T13:01:04 Z zaneyu Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 21 ms 5160 KB 
/*input
5
1 2
1 3
2 4
3 5
5
1 2 3 4 5

*/
#include<bits/stdc++.h>
#include "grader.h"

#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
//order_of_key #of elements less than x
// find_by_order kth element
typedef long long int ll;
 
#define ld long double
#define pii pair<int,int>
typedef tree<pii, null_type, less<pii>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
#define f first
#define s second
#define pb push_back
#define REP(i,n) for(int i=0;i<n;i++)
#define REP1(i,n) for(int i=1;i<=n;i++)
#define FILL(n,x) memset(n,x,sizeof(n))
#define ALL(_a) _a.begin(),_a.end()
#define sz(x) (int)x.size()
const ll maxn=2e5+5;
const ll maxlg=__lg(maxn)+2;
const ll INF64=4e18;
const int MOD=1e9+7;
const int INF=0x3f3f3f3f;
const ld PI=acos(-1);
const ld eps=1e-9;
#define lowb(x) x&(-x)
#define MNTO(x,y) x=min(x,(__typeof__(x))y)
#define MXTO(x,y) x=max(x,(__typeof__(x))y)
#define SORT_UNIQUE(c) (sort(c.begin(),c.end()), c.resize(distance(c.begin(),unique(c.begin(),c.end()))))
#define GET_POS(c,x) (lower_bound(c.begin(),c.end(),x)-c.begin())+1
template<typename T1,typename T2>
ostream& operator<<(ostream& out,pair<T1,T2> P){
    out<<P.f<<' '<<P.s;
    return out;
}
template<typename T>
ostream& operator<<(ostream& out,vector<T> V){
    REP(i,sz(V)) out<<V[i]<<((i!=sz(V)-1)?"\n":"");
    return out;
}
ll mult(ll a,ll b){
    if(a<0) a+=MOD;
    return (a*b)%MOD;
}
ll mypow(ll a,ll b){
    if(b<=0) return 1;
    ll res=1LL;
    while(b){
        if(b&1) res=mult(res,a);
        a=mult(a,a);
        b>>=1;
    }
    return res;
}

vector<int> vv[maxn];
bool vis[maxn];
int findEgg (int n, vector < pair < int, int > > bridges){
    REP(i,n) vv[i].clear(),vis[i]=0;
    for(auto x:bridges){
        --x.f,--x.s;
        vv[x.f].pb(x.s);
        vv[x.s].pb(x.f);
    }
    queue<int> q;
    q.push(0);
    vis[0]=1;
    vector<int> ord;
    while(sz(q)){
        int u=q.front();
        q.pop();
        ord.pb(u);
        for(int x:vv[u]){
            if(!vis[x]){
                vis[x]=1;
                q.push(x);
            }
        }
    }
    int l=0,r=n-1;
    while(l<r){
        int mid=(l+r)/2;
        vector<int> qq;
        REP(i,mid+1) qq.pb(ord[i]+1);
        if(query(qq)) r=mid;
        else l=mid+1;
    }
    return ord[l]+1;
}

Subtask #1
40.0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 4944 KB Number of queries: 8
2 Correct 13 ms 5052 KB Number of queries: 9
3 Correct 18 ms 5040 KB Number of queries: 9
4 Correct 16 ms 4944 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 5040 KB Number of queries: 9
2 Correct 19 ms 5044 KB Number of queries: 9
3 Correct 20 ms 5040 KB Number of queries: 9
4 Correct 21 ms 5160 KB Number of queries: 9