Submission #712892

#	Time	Username	Problem	Language	Result	Execution time	Memory
712892		irmuun	Game (APIO22_game)	C++17	30 / 100	4040 ms	10012 KiB

game

#include<bits/stdc++.h>
#include "game.h"
using namespace std;
#define pb push_back
#define ll long long
#define ff first
#define ss second
#define PI 3.1415926535897932384626433
#define all(s) s.begin(),s.end()
vector<ll>dv[300005];
ll df[300005];
ll cur=0;
int n,k;
bool dfs(ll u){
    if(df[u]==2) return true;
    if(df[u]==1) return u>=k;
    df[u]=1;
    for(auto x:dv[u]){
        if(dfs(x)==false){
            return false;
        }
    }
    df[u]=2;
    return true;
}

void init(int N,int K){
    n=N;
    k=K;
    for(int i=0;i<=k-2;i++){
        dv[i].pb(i+1);
    }
}
int add_teleporter(int u,int v){
    dv[u].pb(v);
    for(ll i=0;i<n;i++) df[i]=0;
    bool ok=dfs(0);
    if(ok==false){
        return 1;
    }
    else{
        return 0;
    }
}

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