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 "coprobber.h"
#include <iostream>
#include <bitset>
#include <vector>
using namespace std;
bitset<MAX_N> edg[MAX_N];
bitset<MAX_N> redg[MAX_N];
int bad_edg_cnt[2][MAX_N][MAX_N];
int best_edg[MAX_N][MAX_N];
int n;
int C;
int start(int N, bool A[MAX_N][MAX_N]) {
n = N;
int deg[MAX_N];
for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
edg[i][j] = redg[j][i] = A[i][j];
}
for (int i = 0; i < N; ++i)
deg[i] = edg[i].count();
for (int i = 0; i < N; ++i) for (int j = 0; j < N; ++j) {
bad_edg_cnt[0][i][j] = 1;
bad_edg_cnt[1][i][j] = deg[i];
}
vector<vector<int>> q;
for (int i = 0; i < N; ++i) {
bad_edg_cnt[0][i][i] = bad_edg_cnt[1][i][i] = 0;
q.push_back({0, i, i});
q.push_back({1, i, i});
}
while (q.size()) {
int t = q.back()[0];
int u = q.back()[1];
int v = q.back()[2];
q.pop_back();
bitset<MAX_N> cedg;
if (t == 0)
cedg = redg[v];
else {
cedg = redg[u];
cedg[u] = 1;
}
for (int i = cedg._Find_first(); i < n; i = cedg._Find_next(i)) {
int nu = u;
int nv = v;
if (t == 0)
nv = i;
else
nu = i;
if (--bad_edg_cnt[t ^ 1][nu][nv] == 0) {
q.push_back({t ^ 1, nu, nv});
if (t == 1)
best_edg[nu][nv] = u;
}
}
}
for (int u = 0; u < n; ++u) {
bool isok = true;
for (int v = 0; v < n; ++v) {
isok &= bad_edg_cnt[0][u][v] <= 0;
}
if (isok)
return C = u;
}
return -1;
}
int nextMove(int R) {
return best_edg[C][R];
}
# | 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... |