Submission #1236112

#TimeUsernameProblemLanguageResultExecution timeMemory
1236112lioowArt Collections (BOI22_art)C++20
0 / 100
0 ms408 KiB
#include "art.h" #include <bits/stdc++.h> using namespace std; void solve(int N) { vector<int>order; int q[N+5]; for(int i=1;i<=N;i++){ int n=N; order.clear(); while(n--){ order.push_back(i); i++; if(i>N) i=1; } q[i]=publish(order); } vector<int>ans(N); for(int i=1;i<=N;i++){ int sel; if(i==1) sel=-q[1]+q[N]; else sel=-q[i]+q[i-1]; ans[(N+1+sel)/2-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...