// Subtask 1
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
constexpr int N=105;
int n,k;
vector<int> g[N],tg[N];
bool vi[N];
queue<int> q;
void init(int _n, int _k){
n=_n,k=_k;
for(int i=0;i<k-1;++i){
g[i].emplace_back(i+1);
tg[i+1].emplace_back(i);
}
}
int add_teleporter(int u,int v){
g[u].emplace_back(v);
tg[v].emplace_back(u);
memset(vi,0,sizeof vi);
for(int i=k-1;i>=0;--i){
q.emplace(i);
while(q.size()){
int x=q.front(); q.pop();
for(auto&y:g[x]) if(!vi[y]){
q.emplace(y); vi[y]=1;
}
}
if(vi[i]) return 1;
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |