# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
982815 | 2024-05-14T18:34:19 Z | FZ_Melo | Game (APIO22_game) | C++17 | 0 ms | 344 KB |
#include "game.h" #include <bits/stdc++.h> using namespace std; int esp; vector<vector<int>> adj; bool used[300000]; bool si=0; void dfs(int node, int ini){ if(node<=ini){ si=1; return; } if(used[node]) return; used[node]=1; for(int h: adj[node]){ dfs(h, ini); } } void init(int n, int k) { adj.resize(n); esp=k; for(int i=1; i<esp; i++){ adj[i-1].push_back(i); } si=0; } int add_teleporter(int u, int v) { adj[u].push_back(v); for(int i=0; i<adj.size(); i++) used[i]=0; for(int i=0; i<esp; i++){ for(int j=0; j<adj.size(); j++) used[j]=0; dfs(i, i); } return si; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Wrong Answer[1] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Wrong Answer[1] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Wrong Answer[1] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Wrong Answer[1] |
3 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Correct | 0 ms | 344 KB | Output is correct |
2 | Incorrect | 0 ms | 344 KB | Wrong Answer[1] |
3 | Halted | 0 ms | 0 KB | - |