# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
598651 | alexander707070 | Art Collections (BOI22_art) | C++17 | 1 ms | 208 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<bits/stdc++.h>
#include "art.h"
#define MAXN 4007
using namespace std;
vector<int> w;
int inv[MAXN],curr,n;
vector<int> ans;
void solve(int N){
n=N;
for(int i=1;i<=n;i++){
w.clear();
for(int f=i;f<=n+i-1;f++){
w.push_back((f-1)%n+1);
}
inv[i]=publish(w);
}
for(int i=2;i<=n+1;i++){
curr=inv[(i-1)%n+1]-inv[i-1];
curr=-curr; curr+=n+1;
ans.push_back(curr/2);
}
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... |