oj.uz

Submission #95352

# Submission time Handle Problem Language Result Execution time Memory
95352 2019-01-30T14:49:03 Z dalgerok Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 17 ms 632 KB 
#include<bits/stdc++.h>
#include "grader.h"
using namespace std;

vector < int > q, g[10000];

void dfs(int v, int pr = -1){
    q.push_back(v);
    for(int to : g[v]){
        if(to != pr){
            dfs(to, v);
        }
    }
}

int findEgg(int N, vector < pair < int, int > > bridges){
    q.clear();
    for(int i = 1; i <= N; i++){
        g[i].clear();
    }
    for(auto it : bridges){
        g[it.first].push_back(it.second);
        g[it.second].push_back(it.first);
    }
    dfs(1);
    int l = 1, r = N;
    while(l < r){
        int mid = (r + l) >> 1;
        if(query(vector < int >(q.begin(), q.begin() + mid))){
            r = mid;
        }
        else{
            l = mid + 1;
        }
    }
    return q[l - 1];
}

Subtask #1
40.0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 504 KB Number of queries: 8
2 Correct 11 ms 504 KB Number of queries: 9
3 Correct 17 ms 504 KB Number of queries: 9
4 Correct 15 ms 504 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 632 KB Number of queries: 9
2 Correct 15 ms 504 KB Number of queries: 9
3 Correct 12 ms 504 KB Number of queries: 9
4 Correct 15 ms 504 KB Number of queries: 9