Submission #1225118

#	Time	Username	Problem	Language	Result	Execution time	Memory
1225118		SpyrosAliv	Game (APIO22_game)	C++20	0 / 100	0 ms	320 KiB

game

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

// for each node store the latest special node it can be reached from (from[u])
// and the earliest special node it can reach (to[u])
// when connecting u and v such that to[v] <= from[u] answer is 1

int n, k;

void init(int N, int K) {
    n = N;
    k = K;
    assert(k == n);
}

int add_teleporter(int u, int v) {
    u++;
    v++;
    if (u >= v) return 1;
    return 0;
}

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