# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
985408 |
2024-05-17T18:45:02 Z |
SuPythony |
Game (APIO22_game) |
C++17 |
|
3448 ms |
262144 KB |
#include <bits/stdc++.h>
#include "game.h"
using namespace std;
int n,k;
vector<vector<int>> al;
void init(int N, int K) {
n=N; k=K;
al.assign(n,vector<int>());
for (int i=0; i<k-1; i++) al[i].push_back(i+1);
}
bool dfs(int u, int i) {
for (int v: al[u]) {
if (v==i) return true;
if (dfs(v,i)) return true;
}
return false;
}
int add_teleporter(int u, int v) {
al[u].push_back(v);
for (int i=0; i<k; i++) {
if (dfs(i,i)) return 1;
}
return 0;
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Runtime error |
3448 ms |
262144 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Runtime error |
3448 ms |
262144 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Runtime error |
3448 ms |
262144 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Runtime error |
3448 ms |
262144 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Runtime error |
3448 ms |
262144 KB |
Execution killed with signal 9 |
3 |
Halted |
0 ms |
0 KB |
- |