Submission #1164592

#TimeUsernameProblemLanguageResultExecution timeMemory
1164592crispxxCave (IOI13_cave)C++20
12 / 100
13 ms516 KiB
#include <bits/stdc++.h> using namespace std; #define all(x) x.begin(), x.end() #define eb emplace_back #define pb push_back #define ar array #define nl '\n' #include "cave.h" // #include "grader.c" void exploreCave(int n) { int S[n]{}, D[n]; for(int i = 0; i < n; i++) { D[i] = i; if(tryCombination(S) == i) { S[i] = 1; } } 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...