Submission #1246226

#TimeUsernameProblemLanguageResultExecution timeMemory
1246226svtkArt Collections (BOI22_art)C++20
20 / 100
54 ms396 KiB
#include "art.h" using namespace std; void solve(int N) { vector<int> order; for(int i=1; i<=N; i++){ order.push_back(i); } int last_ans = publish(order); int i=0; int j = 0; while(last_ans > 0){ int i=0; while(i<N-1){ swap(order[i], order[i+1]); int new_ans = publish(order); if(new_ans > last_ans){ swap(order[i], order[i+1]); } else { last_ans = new_ans; } i++; } j++; } answer(order); }
#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...