| # | Time | Username | Problem | Language | Result | Execution time | Memory | 
|---|---|---|---|---|---|---|---|
| 579960 | haojiandan | Art Collections (BOI22_art) | C++17 | 1901 ms | 644 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 "art.h"
#include <bits/stdc++.h>
using namespace std;
const int maxn=4010;
int ans[maxn],p[maxn];
void solve(int n) {
    vector<int> ask(n);
    for (int i=1;i<=n;i++) {
        ask[0]=i;
        for (int j=1;j<n;j++) {
            ask[j]=ask[j-1]+1;
            if (ask[j]>n) ask[j]-=n;
        }
        ans[i]=publish(ask);
    }
    ans[n+1]=ans[1];
    for (int i=1;i<=n;i++) p[i]=(n+1)-(ans[i+1]-ans[i]),p[i]>>=1;//,printf("?%d\n",p[i]);
    vector<int> q(n);
    for (int i=1;i<=n;i++) q[p[i]-1]=i;
    answer(q);
}
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... | ||||
