oj.uz

Submission #330604

# Submission time Handle Problem Language Result Execution time Memory
330604 2020-11-25T23:54:09 Z jovan_b Easter Eggs (info1cup17_eastereggs) C++17
87 / 100
 23 ms 900 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

vector <int> ord;
vector <int> graf[20005];

void dfs(int v, int par){
    ord.push_back(v);
    for(auto c : graf[v]){
        if(c != par) dfs(c, v);
    }
}

int kveri(int x){
    vector <int> qq;
    for(int i=1; i<=x; i++) qq.push_back(ord[i]);
    return query(qq);
}

int findEgg (int N, vector < pair < int, int > > bridges)
{
    for(int i=1; i<=N; i++) graf[i].clear();
    ord.clear();
    ord.push_back(0);
    for(auto c : bridges){
        graf[c.first].push_back(c.second);
        graf[c.second].push_back(c.first);
    }
    dfs(1, 0);
    int res = 0, l = 1, r = N;
    while(l <= r){
        int mid = (l+r)/2;
        if(kveri(mid)){
            r = mid-1;
            res = mid;
        }
        else l = mid+1;
    }
    return ord[res];
}

Subtask #1
32.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 748 KB Number of queries: 5
2 Partially correct 2 ms 748 KB Number of queries: 5
3 Partially correct 2 ms 748 KB Number of queries: 5
4 Partially correct 2 ms 748 KB Number of queries: 5

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 876 KB Number of queries: 9
2 Correct 15 ms 896 KB Number of queries: 9
3 Correct 21 ms 876 KB Number of queries: 9
4 Correct 20 ms 876 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 23 ms 876 KB Number of queries: 10
2 Correct 19 ms 876 KB Number of queries: 9
3 Partially correct 21 ms 876 KB Number of queries: 10
4 Partially correct 22 ms 900 KB Number of queries: 10