oj.uz

Submission #835606

# Submission time Handle Problem Language Result Execution time Memory
835606 2023-08-23T16:35:15 Z VMaksimoski008 Easter Eggs (info1cup17_eastereggs) C++14
100 / 100
 18 ms 492 KB 
#include <bits/stdc++.h>
#include "grader.h"

#define pb push_back
#define eb emplace_back
#define sz(x) (int)x.size()
#define all(x) x.begin(), x.end()
#define uniq(x) x.erase(unique(all(x)), x.end())
#define rall(x) x.rbegin(), x.rend()
//#define int long long

using namespace std;

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;

const int mod = 1e9 + 7;
const int LOG = 20;
const int maxn = 1e5 + 5;
const double eps = 1e-9;

void setIO() {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
}

vector<vector<int> > graph;
vector<int> euler;

void dfs(int u, int p) {
    euler.push_back(u);
    for(int &v : graph[u]) {
        if(v == p) continue;
        dfs(v, u);
    }
}

int findEgg(int n, vector<pair<int, int> > edges) {
    graph.clear();
    euler.clear();
    graph.resize(n+1);
    for(auto &x : edges) {
        graph[x.first].push_back(x.second);
        graph[x.second].push_back(x.first);
    }

    dfs(1, 0);
    int l=0, r=n-1;

    while(l != r) {
        int mid = (l + r + 1) / 2; 
        vector<int> to_query(euler.begin(), euler.begin() + mid);

        if(query(to_query))
            r = mid - 1;
        else
            l = mid;
    }

    return euler[l];
}

Subtask #1
40.0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 388 KB Number of queries: 8
2 Correct 12 ms 336 KB Number of queries: 9
3 Correct 14 ms 360 KB Number of queries: 9
4 Correct 13 ms 336 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 472 KB Number of queries: 9
2 Correct 12 ms 372 KB Number of queries: 9
3 Correct 18 ms 492 KB Number of queries: 9
4 Correct 18 ms 336 KB Number of queries: 9