Submission #1237093

#TimeUsernameProblemLanguageResultExecution timeMemory
1237093SG2AlokCave (IOI13_cave)C++20
12 / 100
13 ms328 KiB
#include "cave.h" #include <bits/stdc++.h> using namespace std; void exploreCave(int N) { int a[N], ans[N]; for(int i = 0; i < N; i++) ans[i] = i, a[i] = 0; for(int i = 0; i < N; i++){ int cur = tryCombination(a); if(cur == i){ a[i] = 1; ans[i] = i; } } answer(a, ans); }
#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...