Submission #605465

#TimeUsernameProblemLanguageResultExecution timeMemory
605465AugustinasJucasGame (APIO22_game)C++17
0 / 100
0 ms288 KiB
#include "game.h" const int dydis = 5001; bool can[dydis][dydis] = {}; int n, k; void init(int N, int K) { n = N; k = K; for(int i = 0; i < k-1; i++) { for(int j = i; j < k; j++) { can[i][j] = true; } } } int add_teleporter(int u, int v) { for(int i = 0; i < n; i++) { if(can[i][u]) can[i][v] = 1; } if(v < k) { if(can[v][u]) return 1; } return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...