oj.uz

Submission #986299

# Submission time Handle Problem Language Result Execution time Memory
986299 2024-05-20T09:19:36 Z dorjderem The Xana coup (BOI21_xanadu) C++17
5 / 100
 1000 ms 5716 KB 
#include <iostream>
#include <vector>
#include <queue>
#include <unordered_map>
#include <bitset>

using namespace std;

#define ull unsigned long long

int main()
{
    int n;
    cin >> n;

    vector<vector<int>> adj(n);
    for (int i = 0; i < n - 1; ++i)
    {
        int a, b;
        cin >> a >> b;
        adj[a - 1].push_back(b - 1);
        adj[b - 1].push_back(a - 1);
    }
    int tree = 0;
    for (int i = 0; i < n; i++)
    {
        int a;
        cin >> a;
        if (a)
            tree |= (1 << i);
    }
    int ans = 1000;
    for (int bit = 0; bit < (1 << n); bit++)
    {
        int a = tree;
        for (int i = 0; i < n; i++)
        {
            if (bit & (1 << i))
            {
                a ^= (1 << i);
                for (int nxt : adj[i])
                {
                    a ^= (1 << nxt);
                }
            }
        }
        if (a == 0)
        {
            ans = min(ans, __builtin_popcount(bit));
        }
    }
    if (ans < 1000)
        cout << ans << endl;
    else
        cout << "impossible";
    return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 77 ms 404 KB Output is correct
4 Correct 79 ms 408 KB Output is correct
5 Correct 77 ms 344 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 77 ms 404 KB Output is correct
4 Correct 79 ms 408 KB Output is correct
5 Correct 77 ms 344 KB Output is correct
6 Correct 10 ms 440 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 78 ms 348 KB Output is correct
9 Correct 80 ms 412 KB Output is correct
10 Correct 79 ms 504 KB Output is correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 10.0

# Verdict Execution time Memory Grader output
1 Execution timed out 1041 ms 5716 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 1041 ms 5716 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 348 KB Output is correct
2 Correct 1 ms 348 KB Output is correct
3 Correct 77 ms 404 KB Output is correct
4 Correct 79 ms 408 KB Output is correct
5 Correct 77 ms 344 KB Output is correct
6 Correct 10 ms 440 KB Output is correct
7 Correct 2 ms 348 KB Output is correct
8 Correct 78 ms 348 KB Output is correct
9 Correct 80 ms 412 KB Output is correct
10 Correct 79 ms 504 KB Output is correct
11 Incorrect 0 ms 344 KB Output isn't correct
12 Halted 0 ms 0 KB -