| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1368088 | lizi14 | Art Collections (BOI22_art) | C++20 | 516 ms | 63264 KiB |
#include <bits/stdc++.h>
#include "art.h"
using namespace std;
void solve(int N){
int n=N;
vector<int>v[N];
vector<int>a(n);
for(int i=0; i<n; i++){
a[i]=i+1;
}
v[0]=a;
for(int i=1; i<n; i++){
int k=a[0];
for(int j=0; j<n-1; j++){
a[j]=a[j+1];
}
a[n-1]=k;
v[i]=a;
}
vector<int>ans(N,0);
vector<int>x(N);
for(int i=0; i<N; i++){
int xx=publish(v[i]);
x[i]=xx;
// //int y=publish(v[i+1]);
// int z=y-x;
// y=n-1-z;z=y/2;
//ans[i+z]=i+1;
}
for(int i=0; i<n; i++){
int a=x[i];
int b=0;
if(i<n-1)b=x[i+1];
else b=x[0];
int z=b-a;
b=n-1-z;z=b/2;
ans[z]=i+1;
//ans[i+z]=i+1;
}
answer(ans);
// vector<int> order = {1, 2, 3};
// publish(order);
// order = {2, 3, 1};
// publish(order);
// order = {1, 3, 2};
// answer(order);
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
