Submission #918157

#	Time	Username	Problem	Language	Result	Execution time	Memory
918157		rahidilbayramli	Easter Eggs (info1cup17_eastereggs)	C++17	0 / 100	2 ms	600 KiB

eastereggs

#include<bits/stdc++.h>
#include "grader.h"
#include<ext/pb_ds/assoc_container.hpp>
#include<ext/pb_ds/tree_policy.hpp>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pii pair<int, int>
#define pll pair<ll, ll>
#define all(v) v.begin(), v.end()
#define pb push_back
#define f first
#define s second
using namespace std;
using namespace __gnu_pbds;
typedef tree<ll, null_type, less<ll>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;
const ll sz = 550;
vector<int>g[sz];
vi order;
int vis[sz];
void dfs(int node)
{
    vis[node] = 1;
    order.pb(node);
    for(auto u : g[node])
    {
        if(!vis[u])
            dfs(u);
    }
}
int findEgg (int N, vector < pair < int, int > > bridges)
{
    for(auto u : bridges)
    {
        int x = u.f;
        int y = u.s;
        g[x].pb(y);
        g[y].pb(x);
    }
    dfs(1);
    int l = 0, r = order.size() - 1;
    while(l <= r)
    {
        int mid = (l + r) / 2;
        int ans = query(vi(order.begin(), order.begin()+mid));
        if(ans)
            r = mid - 1;
        else
            l = mid;
    }
    return order[l];
}

• Subtask 1: 0 / 40
• Subtask 2: 0 / 40
• Subtask 3: 0 / 20