Submission #579750

#	Time	Username	Problem	Language	Result	Execution time	Memory
579750		wiwiho	Game (APIO22_game)	C++17	100 / 100	1283 ms	71412 KiB

game

#include "game.h"
 
#include <bits/stdc++.h>
#include <bits/extc++.h>
 
#define StarBurstStream ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define iter(a) a.begin(), a.end()
#define riter(a) a.rbegin(), a.rend()
#define lsort(a) sort(iter(a))
#define gsort(a) sort(riter(a))
#define pb(a) push_back(a)
#define eb(a) emplace_back(a)
#define pf(a) push_front(a)
#define ef(a) emplace_front(a)
#define pob pop_back()
#define pof pop_front()
#define mp(a, b) make_pair(a, b)
#define F first
#define S second
#define mt make_tuple
#define gt(t, i) get<i>(t)
#define tomax(a, b) ((a) = max((a), (b)))
#define tomin(a, b) ((a) = min((a), (b)))
#define topos(a) ((a) = (((a) % MOD + MOD) % MOD))
#define uni(a) a.resize(unique(iter(a)) - a.begin())
#define printv(a, b) {bool pvaspace=false; \
for(auto pva : a){ \
    if(pvaspace) b << " "; pvaspace=true;\
    b << pva;\
}\
b << "\n";}
 
using namespace std;
using namespace __gnu_pbds;
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
 
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<ld, ld>;
using tiii = tuple<int, int, int>;
 
const ll MOD = 1000000007;
const ll MAX = 2147483647;
 
template<typename A, typename B>
ostream& operator<<(ostream& o, pair<A, B> p){
    return o << '(' << p.F << ',' << p.S << ')';
}
 
ll ifloor(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a < 0) return (a - b + 1) / b;
    else return a / b;
}
 
ll iceil(ll a, ll b){
    if(b < 0) a *= -1, b *= -1;
    if(a > 0) return (a + b - 1) / b;
    else return a / b;
}
 
int n, k;
vector<int> lk, rk;
vector<vector<int>> g, rg;
int ans = 0;
 
void add(int u, int v){
    if(lk[u] >= rk[v]) return ans = 1, void();
    while((lk[u] + rk[u]) / 2 >= rk[v]){
        rk[u] = (lk[u] + rk[u]) / 2;
        for(int i : rg[u]){
            add(i, u);
            if(ans == 1) return;
        }
    }
    while((lk[v] + rk[v]) / 2 + 1 <= lk[u]){
        lk[v] = (lk[v] + rk[v]) / 2 + 1;
        for(int i : g[v]){
            add(v, i);
            if(ans == 1) return;
        }
    }
}
 
void init(int _n, int _k){
    n = _n;
    k = _k;
    lk.resize(n + 1, 0);
    rk.resize(n + 1, k + 1);
    g.resize(n + 1);
    rg.resize(n + 1);
    for(int i = 1; i <= k; i++){
        lk[i] = rk[i] = i;
        if(i + 1 <= k){
            g[i].eb(i + 1);
            rg[i + 1].eb(i);
        }
    }
}
 
int add_teleporter(int u, int v){
    u++;
    v++;
    g[u].eb(v);
    rg[v].eb(u);
    add(u, v);
    /*cerr << "add " << u << " " << v << "\n";
    printv(lk, cerr);
    printv(rk, cerr);*/
    return ans;
}

• Subtask 1: 2 / 2
• Subtask 2: 10 / 10
• Subtask 3: 18 / 18
• Subtask 4: 30 / 30
• Subtask 5: 40 / 40