Submission #1229866

#TimeUsernameProblemLanguageResultExecution timeMemory
1229866avighnaArt Collections (BOI22_art)C++20
0 / 100
0 ms408 KiB
#include <bits/stdc++.h> int publish(std::vector<int>); void answer(std::vector<int>); void solve(int N) { std::vector<int> front(N + 1); for (int i = 1; i <= N; ++i) { std::vector<int> a; for (int j = 1; j <= N; ++j) { if (i != j) { a.push_back(j); } } a.insert(a.begin(), i); front[i] = publish(a); } std::vector<int> ans = {1}; for (int i = 2; i <= N; ++i) { ans.insert(ans.begin() + i - front[1] + front[i] - 1, i); } answer(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...
#Verdict Execution timeMemoryGrader output
Fetching results...