oj.uz

Submission #782824

# Submission time Handle Problem Language Result Execution time Memory
782824 2023-07-14T09:56:53 Z christinelynn The Xana coup (BOI21_xanadu) C++17
5 / 100
 125 ms 6232 KB 
#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define ld long double
#define fi first
#define se second

vector<int> adj[100005];
int a[100005];

int main() { 
    ios_base::sync_with_stdio(false); cin.tie(NULL);
    int n;
    cin >> n;
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int i = 1; i <= n; i++) cin >> a[i];
    if (n <= 20) {
        for (int i = 1; i <= n; i++) adj[i].push_back(i);
        int ans = n + 1;
        for (int i = 0; i < (1 << n); i++) {
            int tm = 0;
            for (int j = 0; j < n; j++) {
                if ((1 << j) & i) for (auto x : adj[j + 1]) tm ^= (1 << (x - 1));
            }
            for (int j = 0; j < n; j++) if (a[j + 1]) tm ^= (1 << j);
            if (tm != 0) continue;
            int cnt = 0;
            for (int j = 0; j < n; j++) if ((1 << j) & i) cnt++;
            ans = min(ans, cnt);
        }
        if (ans == n + 1) cout << "impossible\n";
        else cout << ans << "\n";
    }
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2644 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 106 ms 2664 KB Output is correct
4 Correct 125 ms 2652 KB Output is correct
5 Correct 121 ms 2668 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2644 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 106 ms 2664 KB Output is correct
4 Correct 125 ms 2652 KB Output is correct
5 Correct 121 ms 2668 KB Output is correct
6 Correct 14 ms 2644 KB Output is correct
7 Correct 3 ms 2676 KB Output is correct
8 Correct 110 ms 2652 KB Output is correct
9 Correct 118 ms 2652 KB Output is correct
10 Correct 109 ms 2656 KB Output is correct
11 Incorrect 1 ms 2644 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Incorrect 28 ms 6232 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #4
0 / 40.0

# Verdict Execution time Memory Grader output
1 Incorrect 26 ms 6204 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 2644 KB Output is correct
2 Correct 3 ms 2680 KB Output is correct
3 Correct 106 ms 2664 KB Output is correct
4 Correct 125 ms 2652 KB Output is correct
5 Correct 121 ms 2668 KB Output is correct
6 Correct 14 ms 2644 KB Output is correct
7 Correct 3 ms 2676 KB Output is correct
8 Correct 110 ms 2652 KB Output is correct
9 Correct 118 ms 2652 KB Output is correct
10 Correct 109 ms 2656 KB Output is correct
11 Incorrect 1 ms 2644 KB Output isn't correct
12 Halted 0 ms 0 KB -