# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
796760 | fuad27 | Art Collections (BOI22_art) | C++17 | 1870 ms | 63604 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;
int n;
map<vector<int>, int> mp;
int get(vector<int> v) {
if(mp.find(v)!=mp.end())return mp[v];
return (mp[v]=publish(v));
}
void solve(int N) {
n=N;
vector<int> def(N);
iota(def.begin(),def.end(),1);
vector<int> smaller(N+1);
for(int i = 1;i<=n;i++) {
vector<int> v;
for(int j = 1;j<=n;j++) {
if(j!=i)v.push_back(j);
}
v.push_back(i);
int smaller_left=((n-i)-(get(v)-get(def)))/2;
smaller[i]+=smaller_left;
}
vector<int> res;
res.push_back(n);
for(int i = n-1;i>=1;i--) {
res.insert(res.begin()+smaller[i],i);
}
answer(res);
}
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... |