oj.uz

Submission #918371

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

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 344 KB Number of queries: 5
2 Runtime error 1 ms 452 KB Execution killed with signal 6
3 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 468 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 2 ms 768 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -