Submission #652960

#	Time	Username	Problem	Language	Result	Execution time	Memory
652960		aryan12	Game (APIO22_game)	C++17	60 / 100	4011 ms	21908 KiB

game

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

const int N = 3e5 + 5;
vector<int> g[N];
int max_n, max_k;
int aa[N];
bool isCycle = false;

void init(int n, int k)
{
    max_n = n, max_k = k;
    for(int i = 0; i < n; i++)
    {
        aa[i] = (i < k) ? i : -1;
    }
}

void dfs(int node, int val)
{
    if(aa[node] >= val)
    {
        return;
    }
    aa[node] = val;
    for(int to: g[node])
    {
        if(to < max_k)
        {
            if(val >= to)
            {
                isCycle = true;
                break;
            }
            continue;
        }
        dfs(to, val);
    }
}

int add_teleporter(int u, int v)
{
    g[u].push_back(v);
    if((v < max_k && aa[u] >= v) || (u < max_k && v <= u))
    {
        return true;
    }
    if(aa[v] < aa[u])
    {
        dfs(v, aa[u]);
    }
    return isCycle;
}

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