제출 #986299

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
986299		dorjderem	The Xana coup (BOI21_xanadu)	C++17	5 / 100	1041 ms	5716 KiB

xanadu

#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 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 40
• Subtask 5: 0 / 30