# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
913844 | Nonoze | Art Collections (BOI22_art) | C++17 | 1258 ms | 1672 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<pair<int, int>> vec;
vector<int> a(n);
for (int i=0; i<n; i++) a[i]=i+1;
vec.push_back({publish(a), 1});
int lst=vec.back().first;
int init=lst;
for (int i=1; i<n; i++) {
vector<int> neww;
for (int j=1; j<n; j++) neww.push_back(a[j]);
neww.push_back(i);
a=neww;
lst=publish(a);
vec.back().first-=lst;
vec.push_back({lst, i+1});
}
vec.back().first-=init;
sort(vec.begin(), vec.end());
a.clear();
for (auto u: vec) a.push_back(u.second);
answer(a);
}
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... |