답안 #577603

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
577603	2022-06-15T06:22:43 Z	jiahng	The Xana coup (BOI21_xanadu)	C++14	100 / 100	126 ms	25036 KB

xanadu

#include <bits/stdc++.h>
using namespace std;

typedef long long ll;
#define int ll
typedef pair<int32_t, int32_t> pi;
typedef vector <int> vi;
typedef vector <pi> vpi;
typedef pair<pi, ll> pii;
typedef set <ll> si;
typedef long double ld;
#define f first
#define s second
#define mp make_pair
#define FOR(i,s,e) for(int i=s;i<=int(e);++i)
#define DEC(i,s,e) for(int i=s;i>=int(e);--i)
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define lbd(x, y) lower_bound(all(x), y)
#define ubd(x, y) upper_bound(all(x), y)
#define aFOR(i,x) for (auto i: x)
#define mem(x,i) memset(x,i,sizeof x)
#define fast ios_base::sync_with_stdio(false),cin.tie(0),cout.tie(0)
#define maxn 100010
#define INF (ll)1e9
#define MOD 1000000007
typedef pair <vi, int> pvi;
typedef pair <int,pi> ipi;
typedef vector <pii> vpii;

int N,A[maxn];
vi adj[maxn];
int a,b;
int dp[maxn][2][2];
int dpf(int i,int j,int k,int p){
    // i is the node, j is current state and k is whether node is selected
    if (dp[i][j][k] != -1) return dp[i][j][k];
    vi v;

    int cur = 0;
    aFOR(x,adj[i]) if (x != p){
       v.pb(dpf(x,k^A[x]^1,1,i)+1 - dpf(x,k^A[x],0,i));
       cur += dpf(x,k^A[x],0,i);
    }
    sort(all(v)); int ptr = 0;
    if (j){
        if (v.empty()) return dp[i][j][k] = INF;
        cur += v[ptr]; ptr++;
    }
    dp[i][j][k] = cur;
    while (ptr + 1 < (int)v.size()){
        cur += v[ptr] + v[ptr+1];
        ptr += 2;
        dp[i][j][k] = min(dp[i][j][k], cur);
    }
    assert(dp[i][j][k] >= 0);
    // cout << i << ' ' << j << ' ' << dp[i][j][k] << '\n';        
    return dp[i][j][k];
}
int32_t main(){
	fast;
	cin >> N;
	FOR(i,1,N-1){
        cin >> a >> b;
        adj[a].pb(b); adj[b].pb(a);
    }
    mem(dp,-1);
    FOR(i,1,N) cin >> A[i];	
    int ans = min(dpf(1,A[1],0,-1), dpf(1,!A[1],1,-1) + 1);
    if (ans >= INF) cout << "impossible";
    else cout << ans;
}

Subtask #1
5.0 / 5.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5716 KB	Output is correct
2	Correct	3 ms	5716 KB	Output is correct
3	Correct	3 ms	5716 KB	Output is correct
4	Correct	4 ms	5716 KB	Output is correct
5	Correct	4 ms	5716 KB	Output is correct

Subtask #2
15.0 / 15.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5716 KB	Output is correct
2	Correct	3 ms	5716 KB	Output is correct
3	Correct	3 ms	5716 KB	Output is correct
4	Correct	4 ms	5716 KB	Output is correct
5	Correct	4 ms	5716 KB	Output is correct
6	Correct	3 ms	5784 KB	Output is correct
7	Correct	4 ms	5716 KB	Output is correct
8	Correct	3 ms	5716 KB	Output is correct
9	Correct	3 ms	5716 KB	Output is correct
10	Correct	3 ms	5716 KB	Output is correct
11	Correct	3 ms	5716 KB	Output is correct
12	Correct	3 ms	5716 KB	Output is correct
13	Correct	3 ms	5716 KB	Output is correct
14	Correct	3 ms	5716 KB	Output is correct
15	Correct	3 ms	5716 KB	Output is correct
16	Correct	3 ms	5748 KB	Output is correct

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	88 ms	23680 KB	Output is correct
2	Correct	92 ms	23396 KB	Output is correct
3	Correct	95 ms	23788 KB	Output is correct

Subtask #4
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	94 ms	23704 KB	Output is correct
2	Correct	91 ms	23408 KB	Output is correct
3	Correct	100 ms	23680 KB	Output is correct
4	Correct	78 ms	9996 KB	Output is correct
5	Correct	122 ms	11808 KB	Output is correct
6	Correct	122 ms	11908 KB	Output is correct
7	Correct	4 ms	5756 KB	Output is correct
8	Correct	34 ms	7812 KB	Output is correct
9	Correct	111 ms	11500 KB	Output is correct
10	Correct	98 ms	11636 KB	Output is correct
11	Correct	106 ms	12524 KB	Output is correct
12	Correct	112 ms	12848 KB	Output is correct
13	Correct	110 ms	11820 KB	Output is correct
14	Correct	116 ms	12156 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	3 ms	5716 KB	Output is correct
2	Correct	3 ms	5716 KB	Output is correct
3	Correct	3 ms	5716 KB	Output is correct
4	Correct	4 ms	5716 KB	Output is correct
5	Correct	4 ms	5716 KB	Output is correct
6	Correct	3 ms	5784 KB	Output is correct
7	Correct	4 ms	5716 KB	Output is correct
8	Correct	3 ms	5716 KB	Output is correct
9	Correct	3 ms	5716 KB	Output is correct
10	Correct	3 ms	5716 KB	Output is correct
11	Correct	3 ms	5716 KB	Output is correct
12	Correct	3 ms	5716 KB	Output is correct
13	Correct	3 ms	5716 KB	Output is correct
14	Correct	3 ms	5716 KB	Output is correct
15	Correct	3 ms	5716 KB	Output is correct
16	Correct	3 ms	5748 KB	Output is correct
17	Correct	88 ms	23680 KB	Output is correct
18	Correct	92 ms	23396 KB	Output is correct
19	Correct	95 ms	23788 KB	Output is correct
20	Correct	94 ms	23704 KB	Output is correct
21	Correct	91 ms	23408 KB	Output is correct
22	Correct	100 ms	23680 KB	Output is correct
23	Correct	78 ms	9996 KB	Output is correct
24	Correct	122 ms	11808 KB	Output is correct
25	Correct	122 ms	11908 KB	Output is correct
26	Correct	4 ms	5756 KB	Output is correct
27	Correct	34 ms	7812 KB	Output is correct
28	Correct	111 ms	11500 KB	Output is correct
29	Correct	98 ms	11636 KB	Output is correct
30	Correct	106 ms	12524 KB	Output is correct
31	Correct	112 ms	12848 KB	Output is correct
32	Correct	110 ms	11820 KB	Output is correct
33	Correct	116 ms	12156 KB	Output is correct
34	Correct	3 ms	5716 KB	Output is correct
35	Correct	3 ms	5696 KB	Output is correct
36	Correct	3 ms	5756 KB	Output is correct
37	Correct	3 ms	5716 KB	Output is correct
38	Correct	4 ms	5716 KB	Output is correct
39	Correct	3 ms	5716 KB	Output is correct
40	Correct	4 ms	5752 KB	Output is correct
41	Correct	4 ms	5716 KB	Output is correct
42	Correct	4 ms	5748 KB	Output is correct
43	Correct	3 ms	5748 KB	Output is correct
44	Correct	4 ms	5716 KB	Output is correct
45	Correct	126 ms	25036 KB	Output is correct
46	Correct	110 ms	24784 KB	Output is correct
47	Correct	97 ms	25016 KB	Output is correct
48	Correct	94 ms	11272 KB	Output is correct
49	Correct	108 ms	11700 KB	Output is correct
50	Correct	92 ms	11856 KB	Output is correct
51	Correct	3 ms	5716 KB	Output is correct
52	Correct	41 ms	7888 KB	Output is correct
53	Correct	88 ms	11620 KB	Output is correct
54	Correct	109 ms	11804 KB	Output is correct
55	Correct	88 ms	12492 KB	Output is correct
56	Correct	101 ms	12704 KB	Output is correct
57	Correct	83 ms	11808 KB	Output is correct
58	Correct	83 ms	12188 KB	Output is correct
59	Correct	24 ms	7756 KB	Output is correct
60	Correct	68 ms	10984 KB	Output is correct
61	Correct	85 ms	11540 KB	Output is correct
62	Correct	90 ms	11684 KB	Output is correct
63	Correct	90 ms	11824 KB	Output is correct
64	Correct	91 ms	11596 KB	Output is correct
65	Correct	73 ms	12060 KB	Output is correct
66	Correct	70 ms	12108 KB	Output is correct
67	Correct	75 ms	13620 KB	Output is correct
68	Correct	71 ms	13676 KB	Output is correct
69	Correct	78 ms	13672 KB	Output is correct
70	Correct	66 ms	13616 KB	Output is correct

답안 #577603

Compilation message

Subtask #1 5.0 / 5.0

Subtask #2 15.0 / 15.0

Subtask #3 10.0 / 10.0

Subtask #4 40.0 / 40.0

Subtask #5 30.0 / 30.0

Subtask #1
5.0 / 5.0

Subtask #2
15.0 / 15.0

Subtask #3
10.0 / 10.0

Subtask #4
40.0 / 40.0

Subtask #5
30.0 / 30.0