# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588309 | 1zaid1 | Art Collections (BOI22_art) | C++17 | 1606 ms | 620 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;
const int M = 1e4+4;
void solve(int n) {
vector<pair<int, int>> ans;
for (int i = 1; i <= n; i++) {
vector<int> a;
for (int j = 1; j <= n; j++) if (j != i) a.push_back(j);
a.push_back(i);
int x = publish(a);
vector<int> b = {i};
for (int j = 1; j <= n; j++) if (j != i) b.push_back(j);
int y = publish(b);
ans.push_back({x-y, i});
} sort(ans.rbegin(), ans.rend());
vector<int> v;
for (auto [a, b]:ans) v.push_back(b);
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... |