# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
579645 | Josia | Art Collections (BOI22_art) | C++17 | 127 ms | 708 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;
int nPublic;
map<pair<int, int>, bool> dict;
bool compare(int a, int b) {
if (dict.count({a, b})) return dict[{a, b}];
vector<int> ask = {a};
for (int i = 0; i<nPublic; i++) {
if (i+1 == a || i+1 == b) continue;
ask.push_back(i+1);
}
ask.push_back(b);
int AB = publish(ask);
ask[0] = b;
ask[nPublic-1] = a;
int BA = publish(ask);
dict[{a, b}] = AB < BA;
dict[{b, a}] = BA < AB;
return AB < BA;
}
void solve(int n) {
nPublic = n;
vector<int> a;
for (int i=0; i<n; i++) a.push_back(i+1);
sort(a.begin(), a.end(), compare);
answer(a);
}
// signed main() {
// cin.tie(0);
// ios_base::sync_with_stdio(0);
// int n; cin >> n;
// deque<int> a(n);
// for (int i = 0; i<n; i++) cin >> a[i];
// for (int i = 0; i<n; i++) {
// int cnt = 0;
// for (int i = 0; i<n; i++) {
// for (int j = i+1; j<n; j++) {
// if (a[i]>a[j]) cnt++;
// }
// }
// a.push_back(a[0]);
// a.pop_front();
// cout << cnt << "\n";
// }
// return 0;
// }
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... |