Submission #743741

#	Time	Username	Problem	Language	Result	Execution time	Memory
743741		Patrick	Game (APIO22_game)	C++17	0 / 100	1 ms	208 KiB

game

#include "game.h"

#include <queue>
#include <vector>
using namespace std;

int N, K;
vector<bool> reach;
vector<vector<int>> es;

void init(int n, int k) {
    reach = vector<bool>(n);
    es = vector<vector<int>>(n);
    N = n, K = k;
}

int markreach(int u) {
    deque<int> q;
    q.push_back(u);
    while (q.size()) {
        int x = q.front();
        q.pop_front();
        for (int e : es[x]) {
            if (!reach[e]) {
                reach[e] = 1;
                q.push_back(e);
                if (e < K) return 1;
            }
        }
    }
    return 0;
}

int add_teleporter(int u, int v) {
    if (u == v) {
        return u < K;
    }
    if (u < K) {
        if (v < K) return 1;
        if (!reach[v]) {
            reach[v] = 1;
            return markreach(v);
        } else {
            return 0;
        }
    } else {
        if (reach[u]) {
            if (v < K) return 1;
            reach[v] = 1;
            return markreach(v);
        } else {
            es[u].push_back(v);
            return 0;
        }
    }
}

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