# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
982809 |
2024-05-14T18:24:52 Z |
alo_54 |
Game (APIO22_game) |
C++17 |
|
1 ms |
344 KB |
#include "game.h"
#include <bits/stdc++.h>
using namespace std;
struct Nodo
{
vector <int> ady;
bool special = false;
};
vector <Nodo> g;
vector <bool> vis;
bool acPos = 0;
int K;
int dfs(int node)
{
// cout<<"call "<<node<<endl;
vis[node] = true;
int resp = 0;
for (auto i : g[node].ady)
{
//cout<<"check "<<i<<endl;
if (!vis[i])
{
//cout<<"check "<<i<<endl;
resp = dfs(i);
}else
{
if (g[i].special)
{
//cout<<"si"<<endl;
acPos = 1;
resp = 1;
}
}
}
//cout<<"no"<<endl;
return resp;
}
void init(int n, int k)
{
vis.resize(n);
g.resize(n);
K = k;
for (int i = 0; i < k; i++)
{
g[i].special = true;
if (k != k-1)
{
g[i].ady.push_back(i+1);
}
}
}
int add_teleporter(int u, int v)
{
fill(vis.begin(), vis.end(), false);
g[u].ady.push_back(v);
int resp = acPos;
for (int i = 0; i < K; i++)
{
resp = dfs(i);
if (resp == 1)
{
acPos = true;
break;
}
}
if (acPos)
{
resp = true;
}
return resp;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Runtime error |
1 ms |
344 KB |
Execution killed with signal 11 |
2 |
Halted |
0 ms |
0 KB |
- |