# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
992939 | MarwenElarbi | Art Collections (BOI22_art) | C++17 | 0 ms | 344 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 <bits/stdc++.h>
#include "art.h"
using namespace std;
#define fi first
#define se second
#define ll long long
#define pb push_back
const int nax=1e6;
vector<int> tab;
int ans;
void daq(int l,int r){
if(l==r) return;
int mid=(r+l)/2;
daq(l,mid);
daq(mid+1,r);
int j=mid+1;
vector<int> current;
for (int i = l; i <= mid; ++i)
{
while(j<=r){
swap(tab[i],tab[j]);
int cur=publish(tab);
if(ans>cur){
current.pb(tab[i]);
ans=cur;
swap(tab[i],tab[j]);
j++;
continue;
}
swap(tab[i],tab[j]);
break;
}
current.pb(tab[i]);
}
while(j<=r){
current.pb(tab[j]);
j++;
}
for (int i = l; i <= r; ++i)
{
tab[i]=current[i-l];
}
ans=publish(tab);
return;
}
void solve(int N){
for (int i = 0; i < N; ++i)
{
tab.pb(i+1);
}
ans=publish(tab);
daq(0,N-1);
answer(tab);
}
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... |