| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 963565 | NotLinux | Art Collections (BOI22_art) | C++17 | 1236 ms | 1628 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;
void solve(int n){
vector < int > perm(n);
iota(perm.begin() , perm.end() , 1);
int newres1 = publish(perm);
for(int i = 2;i<=n;i++){
vector < int > nperm = perm;
nperm.erase(find(nperm.begin() , nperm.end() , i));
nperm.insert(nperm.begin() , i);
// cout << "perm : ";for(auto itr : perm)cout << itr << " ";cout << endl;
// cout << "nperm : ";for(auto itr : nperm)cout << itr << " ";cout << endl;
// cout << endl;
int res1 = newres1;
int res2 = publish(nperm);
int diff = res2 - res1;
int indx = (i - 1 - diff) / 2 + diff;
newres1 = res2 - indx;
// cout << "res1 : " << res1 << " , res2 : " << res2 << " , diff : " << diff << " , indx : " << indx << endl;
// cout << endl;
perm.erase(find(perm.begin() , perm.end() , i));
perm.insert(perm.begin() + indx , i);
}
answer(perm);
}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... | ||||
