oj.uz

Submission #1053964

# Submission time Handle Problem Language Result Execution time Memory
1053964 2024-08-11T23:58:18 Z SulA Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 127 ms 131072 KB 
#include "grader.h"
#include <bits/stdc++.h>
using namespace std;

vector<int> adj[513], preorder;

void dfs(int u = 1, int p = 0) {
    preorder.push_back(u);
    for (int ch : adj[u]) if (ch != p) dfs(ch, u);
}

int findEgg (int n, vector<pair<int,int>> bridges) {
    for (auto pair : bridges) {
        int u = pair.first, v = pair.second;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }

    dfs();
    int l = 0, r = n-1;
    while (r > l) {
        int mid = (l+r)/2;
        vector<int> myquery;
        for (int i = 0; i <= mid; i++) myquery.push_back(preorder[i]);
        bool res = query(myquery) == 1;
//        cout << "MY QUERY IS ";
//        for (int u : myquery) cout << u << " ";
//        cout << '\n';
        if (res) r = mid;
        else l = mid+1;
    }
    return preorder[l];
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 127 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 90 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 91 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -