| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 587866 | 1zaid1 | Art Collections (BOI22_art) | C++17 | 133 ms | 1364 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 sum = 0;
vector<int> v;
map<pair<int, int>, int> vis, mp;
int done(int &a, int &b) {
if (!vis[{a, b}]) {
vis[{a, b}] = 1;
vis[{b, a}] = 1;
swap(a, b);
int now = publish(v);
swap(a, b);
mp[{a, b}] = (sum-now) < 0;
mp[{b, a}] = !mp[{a, b}];
} return mp[{a, b}];
}
void solve(int n) {
v.resize(n);
for (int i = 0; i < n; i++) v[i] = i+1;
sum = publish(v);
while (sum) {
for (int i = 0; i < n-1; i++) {
if (!done(v[i], v[i+1])) {
swap(v[i], v[i+1]);
sum--;
}
}
} 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... | ||||
