oj.uz

Submission #574281

# Submission time Handle Problem Language Result Execution time Memory
574281 2022-06-08T09:36:58 Z moday_morning The Xana coup (BOI21_xanadu) C++17
5 / 100
 1000 ms 16104 KB 
#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() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cin >> n;
    a.resize(n);
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        u--;
        v--;
        a[u].push_back(v);
        a[v].push_back(u);
    }
    point.resize(n);
    for (int i = 0; i < n; i++) {
        cin >> point[i];
    }
    checker(0);
    if (minn >= INF) {
        cout << "impossible\n";
    }
    else {
        cout << minn << "\n";
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 143 ms 316 KB Output is correct
4 Correct 141 ms 300 KB Output is correct
5 Correct 141 ms 212 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 143 ms 316 KB Output is correct
4 Correct 141 ms 300 KB Output is correct
5 Correct 141 ms 212 KB Output is correct
6 Correct 17 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 141 ms 304 KB Output is correct
9 Correct 152 ms 332 KB Output is correct
10 Correct 144 ms 304 KB Output is correct
11 Execution timed out 1085 ms 212 KB Time limit exceeded
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1056 ms 16080 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1058 ms 16104 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 212 KB Output is correct
2 Correct 3 ms 212 KB Output is correct
3 Correct 143 ms 316 KB Output is correct
4 Correct 141 ms 300 KB Output is correct
5 Correct 141 ms 212 KB Output is correct
6 Correct 17 ms 212 KB Output is correct
7 Correct 3 ms 212 KB Output is correct
8 Correct 141 ms 304 KB Output is correct
9 Correct 152 ms 332 KB Output is correct
10 Correct 144 ms 304 KB Output is correct
11 Execution timed out 1085 ms 212 KB Time limit exceeded
12 Halted 0 ms 0 KB -