제출 #1231269

#제출 시각아이디문제언어결과실행 시간메모리
1231269omsincoconutArt Collections (BOI22_art)C++17
100 / 100
765 ms488 KiB
#include "art.h" #include <bits/stdc++.h> using namespace std; void solve(int N) { vector<int> df(N); iota(df.begin(), df.end(), 1); int k1 = publish(df); vector<int> p(N); for (int i = 1; i <= N; i++) { vector<int> tmp = df; tmp.erase(find(tmp.begin(), tmp.end(), i)); tmp.insert(tmp.end(), i); int pos; if (i < N) { int k2 = publish(tmp); pos = (k2-k1+N-i)/2; } else pos = 0; for (int j = 0; j < N; j++) { if (p[j] != 0) continue; if (pos == 0) { p[j] = i; break; } else { pos--; } } } reverse(p.begin(), p.end()); answer(p); }
#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...