Submission #1200131

#TimeUsernameProblemLanguageResultExecution timeMemory
1200131browntoadGame (APIO22_game)C++20
0 / 100
0 ms408 KiB
#include "game.h" #include <bits/stdc++.h> using namespace std; #define ll long long // #define int ll #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define REP(i, n) FOR(i, 0, n) #define REP1(i, n) FOR(i, 1, n+1) #define RREP(i, n) for (int i = (n)-1; i >= 0; i--) #define pii pair<int, int> #define f first #define s second #define pb push_back #define ALL(x) (x).begin(), (x).end() #define SZ(x) (int)((x).size()) namespace{ int n, kay; } void init(int N, int K) { assert(N == K); n = N; kay = K; /*REP(i, k-2){ g[i].pb(i+1); rg[i+1].pb(i); } REP(i, k){ FOR(j, i, k){ ioth[i][j] = 1; } FOR(j, 0, i+1){ othi[i][j] = 1; } } */ } int add_teleporter(int u, int v) { // self-loop: u = v if (u == v){ if (u < kay) return 1; else return 0; } if (u > v) return 1; else return 0; } /* 4 3 4 0 2 0 3 1 3 2 0 1 1 */
#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...