oj.uz

Submission #562657

# Submission time Handle Problem Language Result Execution time Memory
562657 2022-05-14T21:30:44 Z four_specks Easter Eggs (info1cup17_eastereggs) C++17
87 / 100
 22 ms 356 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

int findEgg(int N, vector<pair<int, int>> bridges)
{
    vector<vector<int>> adj(N);
    for (auto [u, v] : bridges)
        adj[u - 1].push_back(v - 1),
        adj[v - 1].push_back(u - 1);

    vector<int> order;

    queue<int> q;
    vector<bool> visited(N, 0);
    for (q.push(0), visited[0] = 1; !q.empty();)
    {
        int u = q.front();
        q.pop();

        order.push_back(u);
        for (int v : adj[u])
        {
            if (!visited[v])
                q.push(v), visited[v] = 1;
        }
    }

    assert((int)order.size() == N);

    int lo = 0, hi = N;
    while (lo < hi)
    {
        int mid = (lo + hi) / 2;

        vector<int> islands;
        for (int i = 0; i <= mid; i++)
            islands.push_back(order[i] + 1);

        if (query(islands))
            hi = mid;
        else
            lo = mid + 1;
    }

    return order[lo] + 1;
}

Subtask #1
32.0 / 40.0

# Verdict Execution time Memory Grader output
1 Partially correct 1 ms 208 KB Number of queries: 5
2 Partially correct 1 ms 208 KB Number of queries: 5
3 Partially correct 1 ms 208 KB Number of queries: 5
4 Partially correct 1 ms 208 KB Number of queries: 5

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 332 KB Number of queries: 8
2 Correct 11 ms 336 KB Number of queries: 9
3 Correct 18 ms 336 KB Number of queries: 9
4 Correct 14 ms 348 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 22 ms 344 KB Number of queries: 10
2 Correct 15 ms 356 KB Number of queries: 9
3 Partially correct 15 ms 336 KB Number of queries: 10
4 Partially correct 16 ms 348 KB Number of queries: 10