# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
419454 | model_code | Monster Game (JOI21_monster) | C++17 | 125 ms | 304 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 "monster.h"
using namespace std;
namespace {
mt19937 mt(0x0606);
vector<int> stupid(vector<int> v) {
int N = v.size();
vector<vector<bool>> res(N, vector<bool>(N, false));
for (int i = 0; i < N; i++)
for (int j = i + 1; j < N; j++)
res[j][i] = !(res[i][j] = Query(v[i], v[j]));
vector<pair<int, int>> cnt(N);
for (int i = 0; i < N; i++)
cnt[i] = {count(res[i].begin(), res[i].end(), true), v[i]};
sort(cnt.begin(), cnt.end());
for (int i = 0; i < N; i++) v[i] = cnt[i].second;
if (Query(v[1], v[0])) swap(v[0], v[1]);
if (Query(v[N - 1], v[N - 2])) swap(v[N - 2], v[N - 1]);
return v;
}
vector<int> merge_sort(vector<int> v) {
if (v.size() == 1) return v;
shuffle(v.begin(), v.end(), mt);
int m = v.size() / 2;
vector<int> l(v.begin(), v.begin() + m), r(v.begin() + m, v.end());
l = merge_sort(l);
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... |