제출 #1253082

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1253082		al95ireyiz	Easter Eggs (info1cup17_eastereggs)	C++20	10 / 100	16 ms	1216 KiB

eastereggs

//*** Bismillah ***//
#pragma GCC optimize("O3", "fast-math", "unroll-loops", "no-stack-protector")
#include <bits/stdc++.h>
using namespace std;
#if !defined(ONLINE_JUDGE) and !defined(EVAL)
#include "template/debug.h"
#else
#define d(x...)
#endif
#define fr first
#define er erase
#define sc second
#define in insert
#define ll long long
#define pb push_back
#define vll vector<ll>
#define pll pair<ll,ll>
#define ull unsigned ll
#define vpll vector<pll>
#define len(x) (ll) x.size()
#define all(x) x.begin(),x.end()
const ll INF = 1e9;
const ll INFL = 1e18;
const ll MOD = 1e9+7;
// const ll MOD = 998244353;
const ll maxn = 600+5;
ll n,m,k=0;
#include "grader.h"
ll cv;
vll g[maxn];
vector<int> ch[maxn];
bitset<maxn>bt;
void prep(ll u, ll p = -1){
    ch[u].pb(u);
    for(auto v : g[u]){
        if(v == p) continue;
        prep(v, u);
        for(auto x : ch[v]) ch[u].pb(x);
    }
}
ll dfs(ll u, ll p, ll dep){
    if(dep == 1){
        if(query(ch[u])){
            cv = u;
            return 1;
        }
        bt[u] = 1;
        return 0;
    }
    ll f = 0;
    for(auto v : g[u]){
        if(v == p) continue;
        if(bt[v]) continue;
        if(dfs(v, u, dep - 1)){
            return 1;
        }
    }
    bt[u] = 0;
    return 0;
}
int findEgg(int _n, vector<pair<int, int>>_g){
    n = _n;
    for(ll i = 1; i <= n; i ++){
        g[i].clear(), ch[i].clear();
    }
    bt.reset();
    for(auto [x, y] : _g){
        g[x].pb(y);
        g[y].pb(x);
    }
    prep(1);
    ll l = 1, r = n;
    while(l <= r){
        ll md = (l + r) >> 1;
        if(dfs(1, -1, md)){
            l = md + 1;
        }
        else{
            r = md - 1;
        }
    }
    return cv;
}
// void _(ll &tt){

// }
// signed main() {
//     ll tm = clock();
//     cin.tie(0)->sync_with_stdio(0);
//     ll t = 1;
//     cin >> t;
//     for(ll tt = 1; tt <= t; tt ++) {
//         _(tt);
//     }
//     cerr << "\n\033[1;31mTime: \033[1;30m" \
//          << (double)(clock()-tm)/1000000 << "\033[1;32m seconds\n";
// }

• Subtask 1: 10 / 40
• Subtask 2: 0 / 40
• Subtask 3: 0 / 20