oj.uz

Submission #261854

# Submission time Handle Problem Language Result Execution time Memory
261854 2020-08-12T06:41:04 Z dolphingarlic Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 25 ms 384 KB 
#include <bits/stdc++.h>
#include "grader.h"
using namespace std;

vector<int> graph[513], dfs_order;

void dfs(int node = 1, int parent = 0) {
    dfs_order.push_back(node);
    for (int i : graph[node]) if (i != parent) dfs(i, node);
}

int findEgg(int N, vector<pair<int, int>> bridges) {
    for (int i = 1; i <= N; i++) graph[i].clear();
    dfs_order.clear();
    for (pair<int, int> i : bridges) {
        graph[i.first].push_back(i.second);
        graph[i.second].push_back(i.first);
    }
    dfs();
    int l = 0, r = N - 1;
    while (l != r) {
        int mid = (l + r + 1) / 2;
        if (query(vector<int>(dfs_order.begin(), dfs_order.begin() + mid))) r = mid - 1;
        else l = mid;
    }
    return dfs_order[l];
}

Subtask #1
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 384 KB Number of queries: 4
2 Correct 1 ms 384 KB Number of queries: 4
3 Correct 1 ms 384 KB Number of queries: 4
4 Correct 1 ms 384 KB Number of queries: 4

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Number of queries: 8
2 Correct 11 ms 384 KB Number of queries: 9
3 Correct 20 ms 384 KB Number of queries: 9
4 Correct 18 ms 384 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 384 KB Number of queries: 9
2 Correct 16 ms 384 KB Number of queries: 9
3 Correct 25 ms 384 KB Number of queries: 9
4 Correct 17 ms 384 KB Number of queries: 9