Submission #1231906

#TimeUsernameProblemLanguageResultExecution timeMemory
1231906badge881Cave (IOI13_cave)C++20
13 / 100
7 ms328 KiB
#include <bits/stdc++.h> #include "cave.h" using namespace std; void subtask1(int); void subtask2(int); void subtask3(int); void exploreCave(int N) { subtask2(N); } void subtask1(int N) { vector<int> D(N); iota(D.begin(), D.end(), 1); vector<int> S(N, 0); int knowAt = 0; while (knowAt < N) { S[knowAt] ^= 1; int res = tryCombination(S.data()); if (res == -1) answer(S.data(), D.data()); knowAt = res - 1; } } void subtask2(int N) { vector<int> S(N, 0); vector<int> D(N); for (int switchId = 0; switchId < N; switchId++) { S[switchId] = 1; // copy(S.begin(), S.end(), ostream_iterator<int>(cout, " ")); int res = tryCombination(S.data()); // cout << " = " << res << endl; D[switchId] = res; S[switchId] = 0; } answer(S.data(), D.data()); } void subtask3(int N) { // pass }
#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...