oj.uz

Submission #1097034

# Submission time Handle Problem Language Result Execution time Memory
1097034 2024-10-05T21:07:53 Z bvv23 Easter Eggs (info1cup17_eastereggs) C++14
87 / 100
 12 ms 740 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;
const int N = 600;
vector <int> g[N];
vector <int> path;

void dfs(int node, int p = - 1) {
    path.push_back(node);
    for (auto v : g[node]) {
        if (v != p) {
            dfs(v, node);
        }
    }
}
int findEgg (int n, vector <pair<int, int >> edges)
{
    path.clear();
    for (int i = 0; i <= n; i++) {
        g[i].clear();
    }
    for (auto v : edges) {
        g[v.first].push_back(v.second);
        g[v.second].push_back(v.first);
    }
    dfs(1);
    int l = 0, r = n - 1;
    // if this current path is ok, then look for more min answer
    int ans = 0;
    vector <int> lst;
    while (l <= r) {
        int mid = (l + r) >> 1;
        lst.clear();
        for (int i = 0; i <= mid; i++) {
            lst.push_back(path[i]);
        }
        if (query(lst)) {
            r = mid - 1;
            ans = lst[mid];
        }
        else {
            l = mid + 1;
        }
    }
    return ans;
}

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 1 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 3 ms 344 KB Number of queries: 9
2 Correct 6 ms 496 KB Number of queries: 9
3 Correct 11 ms 592 KB Number of queries: 9
4 Correct 12 ms 740 KB Number of queries: 9

Subtask #3
15.0 / 20.0

# Verdict Execution time Memory Grader output
1 Partially correct 9 ms 344 KB Number of queries: 10
2 Correct 12 ms 480 KB Number of queries: 9
3 Partially correct 11 ms 500 KB Number of queries: 10
4 Partially correct 8 ms 592 KB Number of queries: 10