oj.uz

Submission #668010

# Submission time Handle Problem Language Result Execution time Memory
668010 2022-12-02T14:21:39 Z finn__ Easter Eggs (info1cup17_eastereggs) C++17
40 / 100
 16 ms 464 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

void get_preorder(vector<vector<int>> const &g, int u, int p, vector<int> &trav)
{
    trav.push_back(u + 1);

    for (int const &v : g[u])
        if (v != p)
            get_preorder(g, v, u, trav);
}

int findEgg(int n, vector<pair<int, int>> edges)
{
    vector<vector<int>> g(n);
    for (auto const &[u, v] : edges)
    {
        g[u - 1].push_back(v - 1);
        g[v - 1].push_back(u - 1);
    }

    vector<int> preorder;
    get_preorder(g, 0, -1, preorder);

    size_t a = 0, b = n;
    while (a < b)
    {
        size_t mid = (a + b) / 2;
        if (query(vector<int>(preorder.begin(), preorder.begin() + mid)))
            b = mid;
        else
            a = mid + 1;
    }

    return preorder[a - 1];
}

Subtask #1
0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 348 KB Number of queries: 8
2 Correct 12 ms 336 KB Number of queries: 9
3 Correct 16 ms 352 KB Number of queries: 9
4 Correct 13 ms 360 KB Number of queries: 9

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 16 ms 336 KB Number of queries: 9
2 Correct 14 ms 336 KB Number of queries: 9
3 Runtime error 6 ms 464 KB Execution killed with signal 6
4 Halted 0 ms 0 KB -