# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982842 | vjudge1 | Game (APIO22_game) | C++17 | 1 ms | 344 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
int esp;
queue<int> q;
vector<vector<int>> adj;
bool used[300000];
bool si=0;
void bfs(){
int t;
while(!q.empty()){
t=q.front(); q.pop();
if(t<esp && used[t]){
si=1;
return;
}
if(used[t])
continue;
used[t]=1;
for(int h: adj[t]){
q.push(h);
}
}
}
void init(int n, int k) {
adj.resize(n);
esp=k;
for(int i=1; i<esp; i++){
adj[i-1].push_back(i);
}
for(int i=0; i<esp; i++)
used[i]=1;
si=0;
}
int add_teleporter(int u, int v) {
adj[u].push_back(v);
for(int i=esp; i<adj.size(); i++){
used[i]=0;
}
for(int i=0; i<esp; i++){
for(int h: adj[i]){
if(h<esp){
if(h>i)
continue;
q.push(h);
}
else
q.push(h);
}
}
bfs();
return si;
}
Compilation message (stderr)
# | 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... |