Submission #1195645

#TimeUsernameProblemLanguageResultExecution timeMemory
1195645NonbangkokCave (IOI13_cave)C++17
13 / 100
7 ms516 KiB
#include <bits/stdc++.h> #include "cave.h" #define coutf(n, m) cout << fixed << setprecision(n) << m #define forr(i, a, n) for (int i = a; i < n; i++) #define forl(i, a, n) for (int i = a; i > n; i--) #define macos ios::sync_with_stdio(0);cin.tie(0);cout.tie(0) #define endll "\n" #define sp " " typedef long long ll; using namespace std; void exploreCave(int n) { int a[n] = {}, b[n] = {}; for (int i = 0; i < n; i++) { a[i] = 1; b[i] = tryCombination(a); a[i] = 0; } 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...