oj.uz

Submission #961101

# Submission time Handle Problem Language Result Execution time Memory
961101 2024-04-11T13:49:10 Z steveonalex Easter Eggs (info1cup17_eastereggs) C++17
100 / 100
 13 ms 1236 KB 
#include <bits/stdc++.h>
#include "grader.h"

using namespace std;

typedef long long ll;
typedef unsigned long long ull;

#define ALL(v) (v).begin(), (v).end()
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)

// mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng(1);
ll rngesus(ll l, ll r){return ((ull) rng()) % (r - l + 1) + l;}

ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}

ll LASTBIT(ll mask){return mask & (-mask);}
ll pop_cnt(ll mask){return __builtin_popcountll(mask);}
ll ctz(ll mask){return __builtin_ctzll(mask);}
ll clz(ll mask){return __builtin_clzll(mask);}
ll logOf(ll mask){return 63 - clz(mask);}

template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b){a = b; return true;}
        return false;
    }
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b){a = b; return true;}
        return false;
    }
template <class T>
    void printArr(T& a, string separator = " ", string finish = "\n"){
        for(auto i: a) cout << i << separator;
        cout << finish;
    }
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 600;
int n;
vector<int> graph[N];
int num[N];
int dfs_cnt = 0;

void dfs(int u, int p){
    num[++dfs_cnt] = u;
    for(int v: graph[u]) if (v != p) dfs(v, u);
}

// int query(vector<int> S){
//     cout << "? "; printArr(S); cout.flush();
//     int verdict; cin >> verdict; 
//     return verdict;
// }

int findEgg (int _n, vector <pair<int, int>> bridges){
    n = _n;
    for(int i = 1; i<=n; ++i) graph[i].clear();
    for(int i = 0; i<n-1; ++i){
        int u = bridges[i].first, v = bridges[i].second;
        graph[u].push_back(v);
        graph[v].push_back(u);
    }
    dfs_cnt = 0;
    dfs(1, 1);
    int l = 1, r = n;
    while(l < r){
        int mid = (l + r) >> 1;
        vector<int> S;
        for(int i = 1; i<=mid; ++i) S.push_back(num[i]);
        if (query(S)) r = mid;
        else l = mid + 1;
    }
    return num[l];
}



// int main(void){
//     ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

//     cout << findEgg(5, {{1, 2}, {1, 3}, {2, 4}, {4, 5}}) << "\n";

//     return 0;
// }

Subtask #1
40.0 / 40.0

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

Subtask #2
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 1236 KB Number of queries: 8
2 Correct 9 ms 736 KB Number of queries: 9
3 Correct 11 ms 744 KB Number of queries: 9
4 Correct 10 ms 996 KB Number of queries: 9

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 1020 KB Number of queries: 9
2 Correct 12 ms 860 KB Number of queries: 9
3 Correct 11 ms 752 KB Number of queries: 9
4 Correct 10 ms 764 KB Number of queries: 9