Submission #973792

#	Time	Username	Problem	Language	Result	Execution time	Memory
973792		Pannda	Game (APIO22_game)	C++17	60 / 100	4091 ms	38416 KiB

game

#include "game.h"

#include <bits/stdc++.h>
using namespace std;

int n, k;
vector<vector<int>> adj;
vector<vector<int>> rev;
vector<int> highest;

void init(int n, int k) {
    ::n = n;
    ::k = k;
    adj.resize(n);
    rev.resize(n);
    highest.resize(n, k);
    for (int u = 0; u + 1 < k; u++) {
        int v = u + 1;
        adj[u].push_back(v);
        rev[v].push_back(u);
        highest[u] = v;
    }
}

int add_teleporter(int u, int v) {
    if (u == v && u < k) return 1;
    if (u == v) return 0;
    adj[u].push_back(v);
    rev[v].push_back(u);
    int h = v < k ? v : highest[v];
    bool wowie = false;
    auto dfs = [&](auto self, int u) -> void {
        if (highest[u] <= h) return;
        highest[u] = h;
        if (u < k && highest[u] <= u) wowie = true;
        for (int v : rev[u]) {
            self(self, v);
        }
    };
    dfs(dfs, u);
    return wowie;
}

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