# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
828624 | Pacybwoah | Art Collections (BOI22_art) | C++17 | 1335 ms | 608 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<iostream>
#include<vector>
#include<algorithm>
#include"art.h"
using namespace std;
void solve(int N){
vector<int> vec(N),ans(N);
for(int i=0;i<N;i++) vec[i]=i+1;
int old=publish(vec);
for(int i=1;i<N;i++){
for(int j=0;j<N;j++) vec[(j-i+N)%N]=j+1;
int unold=publish(vec);
ans[(old-unold+N-1)/2]=i;
old=unold;
}
for(int i=0;i<N;i++) if(ans[i]==0) ans[i]=N;
answer(ans);
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |