Submission #1164597

#TimeUsernameProblemLanguageResultExecution timeMemory
1164597crispxxCave (IOI13_cave)C++20
13 / 100
7 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++) { S[i] = 1; D[i] = tryCombination(S); S[i] = 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...