oj.uz

Submission #918146

# Submission time Handle Problem Language Result Execution time Memory
918146 2024-01-29T13:16:52 Z Elvin_Fritl Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 8 ms 10052 KB 
#include <bits/stdc++.h>
using namespace std;
 
#define ll long long
 
const int N=2e5+5, mod=1e9+7;

int n;

#include "grader.h"

vector<int> d , g[N];

void dfs(int s,int p) {
    d.push_back(s);
    for(auto i: g[s]) {
        if(i == p) {
            continue;
        }
        dfs(i,s);
    }
}

int findEgg(int M , vector<pair<int , int>> a) {
    d.clear();
    n = M;
    for(int i=0;i<=n;i++) {
        g[i].clear();
    }
    for(int i=0;i<(int)a.size();i++) {
        g[a[i].first].push_back(a[i].second);
        g[a[i].second].push_back(a[i].first);
    }
    dfs(1 , 0);
    int l = 0 , r = n - 1 , best = -1;
    while(l < r) {
        int mid = (l + r)/2;
        vector<int> q;
        for(int i=0;i<=mid;i++) {
            q.push_back(d[i]);
        }
        if(query(q) >= 1) {
            r = mid;
            best = mid;
        }
        else {
            l = mid + 1;
        }
    }
    return best;
}

Subtask #1
0 / 40.0

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

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 6 ms 10020 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 8 ms 10052 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -