Submission #644812

#	Time	Username	Problem	Language	Result	Execution time	Memory
644812		Tenis0206	Game (APIO22_game)	C++17	60 / 100	4059 ms	28552 KiB

game

#include <bits/stdc++.h>

#include "game.h"

using namespace std;

int n,k;

int l[500005];

bool ok = false;

vector<int> G[500005];

void init(int N,  int K)
{
    n = N;
    k = K;
    for(int i=0;i<n;i++)
    {
        l[i] = -1;
    }
    for(int i=0; i<k; i++)
    {
        l[i] = i;
    }
}

void dfs(int nod, int val)
{
    l[nod] = val;
    for(auto it : G[nod])
    {
        if(it < k)
        {
            if(val >= it)
            {
                ok = true;
                break;
            }
            continue;
        }
        if(l[it] >= val)
        {
            continue;
        }
        dfs(it,val);
    }
}

int add_teleporter(int x, int y)
{
    G[x].push_back(y);
    if(x < k && y <= x)
    {
        ok = true;
        return ok;
    }
    if(y < k && l[x]>=y)
    {
        ok = true;
        return ok;
    }
    if(l[y] < l[x])
    {
        dfs(y,l[x]);
    }
    return ok;
}

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