oj.uz

Submission #261853

# Submission time Handle Problem Language Result Execution time Memory
261853 2020-08-12T06:40:03 Z dolphingarlic Easter Eggs (info1cup17_eastereggs) C++14
0 / 100
 300 ms 131076 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 (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
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 300 ms 131072 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #2
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 270 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -

Subtask #3
0 / 20.0

# Verdict Execution time Memory Grader output
1 Runtime error 283 ms 131072 KB Execution killed with signal 9 (could be triggered by violating memory limits)
2 Halted 0 ms 0 KB -