Submission #1314552

#TimeUsernameProblemLanguageResultExecution timeMemory
1314552AgageldiCave (IOI13_cave)C++20
12 / 100
8 ms504 KiB
#include "bits/stdc++.h" // #include "grader.c" #include "cave.h" #define MAXN 500005 int a[MAXN], n, b[MAXN]; void exploreCave(int N) { n = N; for(int i = 0; i < n; i++) { b[i] = i; a[i] = 0; } while(1) { int tr = tryCombination(a); if(tr == -1) break; a[tr] = 1 - a[tr]; } answer(a,b); }
#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...