# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
877488 | vjudge1 | Art Collections (BOI22_art) | C++17 | 579 ms | 64228 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;
//#define int long long
#define pb push_back
#define mp make_pair
#define mt make_tuple
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using ll = long long;
using ld = long double;
const int mxn = 4005;
int c[mxn][mxn];
int n;
vector<int> vec;
int og;
bool comp(int a,int b){
if(c[a][b] != -1)return c[a][b];
swap(vec[a-1], vec[b-1]);
int nw = publish(vec);
swap(vec[a-1], vec[b-1]);
return (a < b) ^ (nw < og);
}
void solve(int _n) {
memset(c, -1, sizeof c);
n = _n;
vector<int> v;
for(int i = 1;i<=n;i++){
v.pb(i);
vec.pb(i);
}
og = publish(vec);
stable_sort(all(v), comp);
answer(v);
}
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... |