oj.uz

Submission #1029633

# Submission time Handle Problem Language Result Execution time Memory
1029633 2024-07-21T06:47:11 Z coolboy19521 Easter Eggs (info1cup17_eastereggs) C++17
0 / 100
 207 ms 131072 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

const int sz = 600;

vector<int> aj[sz];
vector<int> pt;

void dfs(int v, int p = -1) {
    pt.push_back(v);
    for (int u : aj[v]) if (u != p)
        dfs(u, v);
}

int findEgg (int N, vector < pair < int, int > > bridges)
{
    for (auto& [v, u] : bridges) {
        aj[v].push_back(u);
        aj[u].push_back(v);
    }

    dfs(1);

    int le = 0, ri = N + 1;

    while (1 < ri - le) {
        int mi = le + (ri - le) / 2;
        vector<int> q;
        for (int i = 1; i <= mi; i ++)
            q.push_back(pt[i - 1]);
        int r = query(q);
        if (r) ri = mi;
        else le = mi;
    }

    return pt[ri - 1];
}

Subtask #1
0 / 40.0

# Verdict Execution time Memory Grader output
1 Runtime error 207 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 160 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 166 ms 131072 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -