Submission #718430

#TimeUsernameProblemLanguageResultExecution timeMemory
718430vjudge1게임 (APIO22_game)C++17
0 / 100
1 ms592 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; const int N = 3e4 + 5; int n, k; bitset <N> bs[N]; void init(int N, int K){ n = N; k = K; for(int i = 0; i < k - 1; ++i){ bs[i].set(i + 1); } } int add_teleporter(int u, int v){ bs[u] |= bs[v]; if (u < k && (bs[u][u] == 1 || u == v)){ return 1; } else 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...