Submission #1307849

#TimeUsernameProblemLanguageResultExecution timeMemory
1307849ayazCave (IOI13_cave)C++20
12 / 100
8 ms496 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; #define all(x) (x).begin(), (x).end() #define isz(x) int(x.size()) using vi = vector<int>; using ll = long long; using pii = pair<int, int>; const int inf = 1e9; void exploreCave(int N) { int n = N; int s[n], d[n]; fill(s, s + n, 1); iota(d, d + n, 0); for (int i = 0; i < n; i++) { if (i == n - 1) { s[i] = 0; if (tryCombination(s) != -1) { s[i] = 1; } } else { s[i] = 0; if (tryCombination(s) == i) { s[i] = 1; } } } assert(count(d, d + n, inf) == 0); answer(s, d); }
#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...