Submission #951881

# Submission time Handle Problem Language Result Execution time Memory
951881 2024-03-22T21:42:56 Z __Davit__ Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
1 ms 600 KB
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

namespace {

    vector<int> order;
    vector<vector<int>> gp;

    void dfs(int u, int p = -1) {
        order.push_back(u);
        for (auto x: gp[u]) {
            if (x == p)continue;
            dfs(x, u);
        }
    }
}

int findEgg(int N, vector<pair<int, int> > bridges) {
    order.clear();
    gp.clear();
    gp.resize(N);
    for (int i = 0; i < N; i++) {
        gp[--bridges[i].first].push_back(--bridges[i].second);
        gp[bridges[i].second].push_back(bridges[i].first);
    }
    dfs(0);
    int ina = 0, inb = N - 1, ans = order[N - 1];
    while (ina <= inb) {
        int mid = (ina + inb) >> 1;
        vector<int> tmp;
        for (int i = 0; i <= mid; i++)tmp.push_back(order[i] + 1);
        bool ok = query(tmp);
        if (ok) {
            ans = tmp.back();
            inb = mid - 1;
        } else {
            ina = mid + 1;
        }
    }
    return ans;
}
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 344 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -
# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 600 KB Execution killed with signal 11
2 Halted 0 ms 0 KB -