# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
574281 | moday_morning | The Xana coup (BOI21_xanadu) | C++17 | 1085 ms | 16104 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>
#define int long long
using namespace std;
const int INF = 1e9, N = 1e5 + 5;
vector <vector <int> > a;
int minn = INF, n;
vector <int> v, point;
void checker (int validator) {
if(validator == n) {
vector <int> p = point;
for (auto i : v) {
p[i] = !p[i];
for (auto pos : a[i]) {
p[pos] = !p[pos];
}
if (all_of(p.begin(), p.end(), [&](int z) { return z == 0; })) {
minn = min(minn, (int)v.size());
}
}
}
else {
v.push_back(validator);
checker(validator + 1);
v.pop_back();
checker(validator + 1);
}
}
signed main() {
# | 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... |