| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1336304 | Warinchai | Art Collections (BOI22_art) | C++20 | 691 ms | 484 KiB |
#include "art.h"
#include<bits/stdc++.h>
using namespace std;
int val[4005];
void solve(int N) {
int n=N;
for(int i=0;i<n;i++){
vector<int>v;
for(int j=0;j<n;j++){
v.push_back((i+j)%n+1);
}
val[i]=publish(v);
}
vector<int>ans(n);
for(int i=0;i<n;i++){
int s1=val[i];
int s2=val[(i+1)%n];
int inv=(s1+s2-(n-1))/2;
ans[s1-inv]=i+1;
//cerr<<"i:"<<i+1<<" "<<s1<<" "<<s2<<" "<<inv<<" "<<s2-inv<<"\n";
}
answer(ans);
}
| # | 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... | ||||
