제출 #546560

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
546560		d4xn	The Xana coup (BOI21_xanadu)	C++17	0 / 100	54 ms	7396 KiB

xanadu

#pragma GCC optimize ("Ofast")
#pragma GCC target ("avx2")
#include <bits/stdc++.h>
using namespace std;
 
//#define int long long
#define ll long long
#define ld long double
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define LB lower_bound
#define UB upper_bound
#define ii pair<int, int>
#define ff first
#define ss second
#define mp make_pair
#define pb push_back
#define ppb pop_back
#define vi vector<int>
#define vvi vector<vi>
#define vb vector<bool>
#define vvb vector<vb>
#define vs vector<string>
#define vii vector<ii>
#define vvii vector<vii>
#define vll vector<ll>
#define vld vector<ld>
 
int n;
vvi adj;
vi v;

signed main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
 
    cin >> n;
    adj.resize(n);
    v.resize(n);
    for (int i = 0; i < n-1; i++) {
        int a, b;
        cin >> a >> b;
        a--; b--;
        adj[a].pb(b);
        adj[b].pb(a);
    }
    bool o = 0;
    for (int i = 0; i < n; i++) {
        cin >> v[i];
        if (v[i]) o = 1;
    }
    
    cout << (o ? "impossible\n" : "0\n");

    return 0;
}

• Subtask 1: 0 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 10
• Subtask 4: 0 / 40
• Subtask 5: 0 / 30