# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
864318 | vjudge1 | Monster Game (JOI21_monster) | C++17 | 113 ms | 2560 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 {
bool example_variable;
} // namespace
vector<int> Solve(int N) {
if (N == 1) return {0};
vector<int> T(N);
bool win[N + 10][N + 10];
int cnt[N + 10];
memset(cnt, 0, sizeof(cnt));
vector<int> g[N + 10];
for (int i = 0; i < N; i++) {
for (int j = i + 1; j < N; j++) {
win[i][j] = Query(i, j);
if (win[i][j]) {
cnt[i]++;
g[i].push_back(j);
}
else {
cnt[j]++;
g[j].push_back(i);
}
}
}
int zero;
vector<int> v;
for (int i = 0; i < N; i++) {
if (cnt[i] == 1) {
v.push_back(i);
}
}
zero = v[0];
T[v[0]] = 0;
if (v.size() > 1) {
if (win[g[v[0]][0]][g[v[1]][0]]) {}
else {
zero = v[1];
T[v[1]] = 0;
}
}
bool visited[N + 10];
memset(visited, 0, sizeof(visited));
visited[zero] = 1;
queue<int> q;
q.push(zero);
int num = 1;
while (q.size()) {
int f = q.front();
q.pop();
for (auto x : g[f]) {
if (visited[x]) continue;
T[x] = num++;
visited[x] = 1;
q.push(x);
}
}
// for (auto x : T) cout << x << " ";
// cout << endl;
return T;
}
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... |