Submission #1201845

#	Time	Username	Problem	Language	Result	Execution time	Memory
1201845		adiyer	Game (APIO22_game)	C++20	60 / 100	4096 ms	52084 KiB

game

#include <bits/stdc++.h>

using namespace std;

const int MAXN = 5e5 + 11;

int n, k, ok;
int was[MAXN], r[MAXN], l[MAXN];

vector < int > g[MAXN], rg[MAXN];

void dfs(int v, int st){
    r[v] = max(r[v], st);
    if(r[v] >= l[v]){ ok = 1; return; }
    for(int u : g[v])
        if(r[u] < st) 
            dfs(u, st);
}

void dfs2(int v, int st){
    l[v] = min(l[v], st);
    if(r[v] >= l[v]){ ok = 1; return; }
    for(int u : rg[v])
        if(l[u] > st)
            dfs2(u, st);
}

void init(int _n, int _k) {
    n = _n, k = _k;
    for(int i = 0; i < k - 1; i++) g[i].push_back(i + 1), rg[i + 1].push_back(i);
    for(int i = 0; i < n; i++) r[i] = -1, l[i] = n;
    for(int i = 0; i < k; i++) r[i] = i - 1, l[i] = i + 1;
    l[k - 1] = n;
}

int add_teleporter(int u, int v){
    g[u].push_back(v), rg[v].push_back(u); 
    if(u < k) dfs(v, u);
    else dfs(v, r[u]);
    if(v < k) dfs2(u, v);
    else dfs2(u, l[v]);
    return ok;
}

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