oj.uz

Submission #744195

# Submission time Handle Problem Language Result Execution time Memory
744195 2023-05-18T09:05:59 Z rahidilbayramli Easter Eggs (info1cup17_eastereggs) C++17
100 / 100
 17 ms 356 KB 
#include "grader.h"
#include<bits/stdc++.h>
#define ll long long
#define ld long double
#define vl vector<ll>
#define vi vector<int>
#define pb push_back
#define f first
#define s second
#define pii pair<int, int>
#define pll pair<ll, ll>
using namespace std;
vector<int>graph[513], ord;
void dfs(int node = 1, int par = 0)
{
    ord.pb(node);
    for(int i : graph[node])
    {
        if(i != par)
            dfs(i, node);
    }
}
int findEgg(int N, vector<pair<int, int>> bridges)
{
    for(int i = 1; i <= N; i++)    graph[i].clear();
    ord.clear();
    for(pii x : bridges){
        graph[x.f].pb(x.s);
        graph[x.s].pb(x.f);
    }
    dfs();
    int l = 0, r = N - 1;
    while(l != r)
    {
        int mid = (l + r + 1) / 2;
        if(query(vi(ord.begin(), ord.begin() + mid)))    r = mid - 1;
        else    l = mid;
    }
    return ord[l];
}

Subtask #1
40.0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 336 KB Number of queries: 8
2 Correct 11 ms 344 KB Number of queries: 9
3 Correct 16 ms 336 KB Number of queries: 9
4 Correct 14 ms 356 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 336 KB Number of queries: 9
2 Correct 12 ms 340 KB Number of queries: 9
3 Correct 15 ms 348 KB Number of queries: 9
4 Correct 14 ms 340 KB Number of queries: 9