Submission #1160655

#	Time	Username	Problem	Language	Result	Execution time	Memory
1160655		Aviansh	Game (APIO22_game)	C++17	0 / 100	3 ms	7232 KiB

game

#include "game.h"

#include <bits/stdc++.h>

using namespace std;

const int maxn = 3e5+12;
vector<int>g[maxn];
int vis[maxn];
int myk;
int myn;

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

int ans = 0;

void dfs(int st){
    vis[st]=1;
    for(int i : g[st]){
        if(vis[i]==2){
            continue;
        }
        if(vis[i]==1){
            if(i<myk){
                ans=1;
            }
            continue;
        }
        dfs(i);
    }
    vis[st]=2;
}

int add_teleporter(int u, int v) {
    if(max(u, v) < myk) {
        if(u >= v) return 1;
    }
    if(ans){
        return 1;
    }
    g[u].push_back(v);
    return 1;
    fill(vis,vis+myn,0);
    dfs(0);
    return ans;
}

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