oj.uz

Submission #1029634

# Submission time Handle Problem Language Result Execution time Memory
1029634 2024-07-21T06:48:43 Z coolboy19521 Easter Eggs (info1cup17_eastereggs) C++17
87 / 100
 12 ms 856 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 (int i = 1; i <= N; i ++)
        aj[i].clear();

    pt.clear();

    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
32.0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 344 KB Number of queries: 9
2 Correct 5 ms 340 KB Number of queries: 9
3 Correct 11 ms 740 KB Number of queries: 9
4 Correct 12 ms 344 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 12 ms 856 KB Number of queries: 10
2 Correct 10 ms 600 KB Number of queries: 9
3 Partially correct 7 ms 344 KB Number of queries: 10
4 Partially correct 9 ms 600 KB Number of queries: 10