# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
974582 | IUA_Hasin | Game (APIO22_game) | C++17 | 5 ms | 9816 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>
#define endl "\n"
#define ll long long
using namespace std;
const ll N = 3e5+10;
ll NN, K;
std::vector<ll> graph[N];
ll vis[N];
ll vis2[N];
std::vector<ll> nodes;
std::vector<ll> dfs(ll source){
if(vis[source]==0){
vis[source] = 1;
nodes.push_back(source);
for(auto u : graph[source]){
dfs(u);
}
} else {
return nodes;
}
return nodes;
}
void init(int n, int k) {
NN = n;
K = k;
for(int i=0; i<=k-2; i++){
graph[i].push_back(i+1);
// cout << i << " " << i+1 << endl;
}
}
int add_teleporter(int u, int v) {
graph[u].push_back(v);
for(int i=0; i<NN; i++){
vis[i] = 0;
}
nodes.clear();
if(u>=K && v<K){
vis2[u] = 1;
}
if(u>=v){
return 1;
} else {
return 0;
}
if(u<K && v<K){
if(u>=v){
return 1;
}
} else {
std::vector<ll> v = dfs(0);
for(int i=0; i<v.size(); i++){
cout << v[i] << " ";
}
cout<<endl;
ll status = 0;
for(int i=0; i<v.size(); i++){
if(status==1){
break;
} else {
ll a = v[i];
if(vis2[a]==1){
status = 1;
}
}
}
return status;
}
}
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... |