# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
763185 | t6twotwo | Werewolf (IOI18_werewolf) | C++17 | 4026 ms | 73024 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 "werewolf.h"
#include <bits/stdc++.h>
using namespace std;
vector<int> check_validity(int N, vector<int> X, vector<int> Y, vector<int> S, vector<int> E, vector<int> L, vector<int> R) {
vector<vector<int>> adj(N);
for (int i = 0; i < X.size(); i++) {
adj[X[i]].push_back(Y[i]);
adj[Y[i]].push_back(X[i]);
}
bool line = 1;
for (int i = 0; i < N; i++) {
if (adj[i].size() > 2) {
line = 0;
}
}
int Q = S.size();
vector<int> ans(Q);
if (line) {
int x = 0;
while (adj[x].size() == 2) {
x++;
}
vector<int> a{x, adj[x][0]};
for (int i = 0; i < N - 2; i++) {
a.push_back(adj[a[i + 1]][0] ^ adj[a[i + 1]][1] ^ a[i]);
}
vector<int> pos(N);
for (int i = 0; i < N; i++) {
pos[a[i]] = i;
}
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... |