Submission #983829

#	Time	Username	Problem	Language	Result	Execution time	Memory
983829		vjudge1	Game (APIO22_game)	C++17	30 / 100	4043 ms	3860 KiB

game

#include "game.h"
#include<bits/stdc++.h>
using namespace std;
const int N = 3e4 + 100;
vector<int> g[N];
int flag = 0;
int k, visited[N], n;

void dfs(int x) {
    visited[x] = 1;
    for (auto to : g[x]) {
        if (!visited[to])
            dfs(to);
        else if (visited[to] == 1 && to < k)
            flag = 1;
    }
    visited[x] = 2;
}

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

int add_teleporter(int u, int v) {
    g[u].push_back(v);
    for (int i = 0; i < n; i++) {
        visited[i] = 0;
    }
    for (int i = 0; i < k; i++) {
        if (!visited[i])
            dfs(i);
    }
    return flag;
}

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