# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1128411 | stdfloat | Political Development (BOI17_politicaldevelopment) | C++20 | 3108 ms | 314336 KiB |
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int mx;
vector<int> v;
vector<bool> vis;
vector<vector<bool>> edg;
vector<vector<int>> E;
void dfs(int x) {
mx = max(mx, (int)v.size());
for (auto i : E[x]) {
if (vis[i]) continue;
bool ok = true;
for (auto j : v) {
if (!edg[i][j] || !edg[j][i]) {
ok = false;
break;
}
}
if (!ok) continue;
# | 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... |