제출 #1208084

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1208084		al95ireyiz	Game (APIO22_game)	C++20	60 / 100	4096 ms	41516 KiB

game

//*** 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 = 3e5+5;
ll n,m,k=0;
#include "game.h"
ll l[maxn], r[maxn];
vll g[maxn], rg[maxn];
void init(int _n, int _k){
    n = _n, k = _k;
    for(ll i = 0; i < n; i ++){
        if(i < k) l[i] = r[i] = i;
        else l[i] = -1, r[i] = INF;
    }
}
void dfs1(ll u, ll y){
    if(y <= l[u]) return;
    l[u] = y;
    for(auto v : g[u]){
        dfs1(v, y);
    }
}
void dfs2(ll u, ll y){
    if(y >= r[u]) return;
    r[u] = y;
    for(auto v : rg[u]){
        dfs2(v, y);
    }
}
int add_teleporter(int u, int v){
    if(max(u, v) < k) return u >= v;
    g[u].pb(v), rg[v].pb(u);
    dfs1(v, l[u]), dfs2(u, r[v]);
    return l[u] >= r[v];
}
// 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: 2 / 2
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 30 / 30
• Subtask 5: 0 / 40