제출 #1304959

#제출 시각아이디문제언어결과실행 시간메모리
1304959SofiatpcArt Collections (BOI22_art)C++17
100 / 100
673 ms484 KiB
#include "art.h" #include <bits/stdc++.h> using namespace std; void solve(int n) { vector<int> ans = {1}, cur; for(int i = 1; i <= n; i++)cur.push_back(i); int og = publish(cur); for(int i = 2; i <= n; i++){ for(int j = i-2; j >= 0; j--)swap(cur[j],cur[j+1]); int x = publish(cur)-og; ans.push_back(i); int pos = ans.size()-1; for(int j = i-1; j > x; j-=2){ swap(ans[pos],ans[pos-1]); pos--; } for(int j = 0; j < i-1; j++)swap(cur[j],cur[j+1]); } 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...