oj.uz

Submission #918562

# Submission time Handle Problem Language Result Execution time Memory
918562 2024-01-30T06:46:20 Z HaciyevAlik Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 11 ms 1260 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
const int mx=550;
vector<int> g[mx],order;
void dfs(int u,int p) {
    order.push_back(u);
    for(int v:g[u]) {
        if(v!=p) dfs(v,u);
    }
}
int findEgg (int N,vector<pair<int,int>> bridges){
    order.clear();
    for(int i=0;i<mx;++i) g[i].clear();
    for(int i=0;i<N-1;++i) {
        int u=bridges[i].first,v=bridges[i].second;
        g[u].push_back(v);
        g[v].push_back(u);
    }
    dfs(1,0);
    int l=0,r=N-1;
    while(l<r) {
        int mid=(l+r)/2;
        vector<int> temp;
        for(int i=0;i<=mid;++i) {
            temp.push_back(order[i]);
        }
        if(query(temp)) {
            r=mid;
        } else {
            l=mid+1;
        }
    }
    return order[l];
}

Subtask #1
40.0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 720 KB Number of queries: 8
2 Correct 7 ms 744 KB Number of queries: 9
3 Correct 11 ms 496 KB Number of queries: 9
4 Correct 10 ms 736 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 1004 KB Number of queries: 9
2 Correct 9 ms 472 KB Number of queries: 9
3 Correct 11 ms 984 KB Number of queries: 9
4 Correct 10 ms 1260 KB Number of queries: 9