답안 #760517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
760517	2023-06-17T17:13:36 Z	YENGOYAN	The Xana coup (BOI21_xanadu)	C++17	100 / 100	90 ms	32292 KB

xanadu

#include <iostream>
#include <vector>
#include <algorithm>
#include <set>
#include <cmath>
#include <map>
#include <string>
#include <ios>
#include <iomanip>
#include <deque>
#include <queue>
#include <list> 
#include <stack>

#define FASTIO ios_base::sync_with_stdio(0); cin.tie(NULL);
using ll = long long;
using namespace std;
vector<vector<ll>>gp;
vector<ll>v;
vector<vector<vector<ll>>>dp;
void dfs(ll u, ll p) {
  ll cnt = 1e18, lox = 1e18, ans = 0, ans1 = 0;
  for (ll& x : gp[u]) {
    if (x != p) {
      dfs(x, u);
      dp[u][0][0] += min(dp[x][0][0], dp[x][1][0]);
      dp[u][1][0] += min(dp[x][1][1], dp[x][0][1]);
      if (min(dp[x][0][0], dp[x][1][0]) == dp[x][1][0]) ans++;
      if (min(dp[x][0][1], dp[x][1][1]) == dp[x][1][1]) ans1++;
      cnt = min(cnt, abs(dp[x][0][0] - dp[x][1][0]));
      lox = min(lox, abs(dp[x][1][1] - dp[x][0][1]));
    }

  }
  if (gp[u].size() == 1 && u != 0) {
    if (v[u] == 0) {
      dp[u][0][0] = 0;
      dp[u][0][1] = 1e17;
      dp[u][1][0] = 1e17;
      dp[u][1][1] = 1;
    }
    else {
      dp[u][0][0] = 1e17;
      dp[u][0][1] = 0;
      dp[u][1][0] = 1;
      dp[u][1][1] = 1e17;
    }
  }
  else {

    dp[u][0][1] = dp[u][0][0];
    dp[u][1][1] = dp[u][1][0] + 1;
    dp[u][1][0]++;
    if ((v[u] == 1 && ans % 2 == 0) || (v[u] == 0 && ans % 2 == 1)) {
      dp[u][0][0] += cnt;
    }
    if ((v[u] == 1 && ans % 2 == 1) || (v[u] == 0 && ans % 2 == 0)) {
      dp[u][0][1] += cnt;
    }
    if ((v[u] == 1 && ans1 % 2 == 0) || (v[u] == 0 && ans1 % 2 == 1)) {
      dp[u][1][1] += lox;
    }
    if ((v[u] == 1 && ans1 % 2 == 1) || (v[u] == 0 && ans1 % 2 == 0)) {
      dp[u][1][0] += lox;
    }
  }
  long long inf = 1e18;
  dp[u][0][0] = min(dp[u][0][0], inf);
  dp[u][1][0] = min(dp[u][1][0], inf);
  dp[u][1][1] = min(dp[u][1][1], inf);
  dp[u][0][1] = min(dp[u][0][1], inf);
}
void solve() {
  ll n; cin >> n;
  v = vector<ll>(n);
  gp = vector<vector<ll>>(n);
  dp = vector<vector<vector<ll>>>(n, vector<vector<ll>>(2, vector<ll>(2)));
  for (ll i = 0; i < n - 1; i++) {
    ll u, v; cin >> u >> v;
    --u, --v;
    gp[u].push_back(v);
    gp[v].push_back(u);
  }
  for (ll i = 0; i < n; i++) {
    cin >> v[i];
  }

  dfs(0, -1);
  if (min({ dp[0][0][0],dp[0][1][0] }) > n) {
    cout << "impossible" << endl;
  }
  else  cout << min({ dp[0][0][0],dp[0][1][0] });
}
signed main() {
  FASTIO
    ll t = 1;
  // cin >> t;
  while (t--) {
    solve();
  }
}

Subtask #1
5.0 / 5.0

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

Subtask #2
15.0 / 15.0

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

Subtask #3
10.0 / 10.0

#	결과	실행 시간	메모리	Grader output
1	Correct	53 ms	30552 KB	Output is correct
2	Correct	53 ms	31608 KB	Output is correct
3	Correct	54 ms	32060 KB	Output is correct

Subtask #4
40.0 / 40.0

#	결과	실행 시간	메모리	Grader output
1	Correct	54 ms	30644 KB	Output is correct
2	Correct	60 ms	31628 KB	Output is correct
3	Correct	56 ms	32292 KB	Output is correct
4	Correct	64 ms	21084 KB	Output is correct
5	Correct	71 ms	23140 KB	Output is correct
6	Correct	69 ms	23684 KB	Output is correct
7	Correct	1 ms	340 KB	Output is correct
8	Correct	25 ms	7900 KB	Output is correct
9	Correct	77 ms	23004 KB	Output is correct
10	Correct	90 ms	23372 KB	Output is correct
11	Correct	75 ms	23372 KB	Output is correct
12	Correct	80 ms	24036 KB	Output is correct
13	Correct	67 ms	22500 KB	Output is correct
14	Correct	71 ms	23884 KB	Output is correct

Subtask #5
30.0 / 30.0

#	결과	실행 시간	메모리	Grader output
1	Correct	1 ms	212 KB	Output is correct
2	Correct	1 ms	316 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	212 KB	Output is correct
5	Correct	1 ms	212 KB	Output is correct
6	Correct	1 ms	212 KB	Output is correct
7	Correct	1 ms	320 KB	Output is correct
8	Correct	1 ms	324 KB	Output is correct
9	Correct	1 ms	212 KB	Output is correct
10	Correct	1 ms	212 KB	Output is correct
11	Correct	1 ms	212 KB	Output is correct
12	Correct	1 ms	212 KB	Output is correct
13	Correct	1 ms	212 KB	Output is correct
14	Correct	1 ms	212 KB	Output is correct
15	Correct	1 ms	212 KB	Output is correct
16	Correct	1 ms	212 KB	Output is correct
17	Correct	53 ms	30552 KB	Output is correct
18	Correct	53 ms	31608 KB	Output is correct
19	Correct	54 ms	32060 KB	Output is correct
20	Correct	54 ms	30644 KB	Output is correct
21	Correct	60 ms	31628 KB	Output is correct
22	Correct	56 ms	32292 KB	Output is correct
23	Correct	64 ms	21084 KB	Output is correct
24	Correct	71 ms	23140 KB	Output is correct
25	Correct	69 ms	23684 KB	Output is correct
26	Correct	1 ms	340 KB	Output is correct
27	Correct	25 ms	7900 KB	Output is correct
28	Correct	77 ms	23004 KB	Output is correct
29	Correct	90 ms	23372 KB	Output is correct
30	Correct	75 ms	23372 KB	Output is correct
31	Correct	80 ms	24036 KB	Output is correct
32	Correct	67 ms	22500 KB	Output is correct
33	Correct	71 ms	23884 KB	Output is correct
34	Correct	1 ms	212 KB	Output is correct
35	Correct	0 ms	320 KB	Output is correct
36	Correct	0 ms	212 KB	Output is correct
37	Correct	1 ms	212 KB	Output is correct
38	Correct	1 ms	316 KB	Output is correct
39	Correct	0 ms	212 KB	Output is correct
40	Correct	0 ms	212 KB	Output is correct
41	Correct	0 ms	320 KB	Output is correct
42	Correct	1 ms	212 KB	Output is correct
43	Correct	1 ms	312 KB	Output is correct
44	Correct	1 ms	320 KB	Output is correct
45	Correct	55 ms	31996 KB	Output is correct
46	Correct	56 ms	31596 KB	Output is correct
47	Correct	65 ms	32076 KB	Output is correct
48	Correct	61 ms	21196 KB	Output is correct
49	Correct	65 ms	23136 KB	Output is correct
50	Correct	68 ms	23608 KB	Output is correct
51	Correct	1 ms	340 KB	Output is correct
52	Correct	20 ms	7964 KB	Output is correct
53	Correct	89 ms	22980 KB	Output is correct
54	Correct	74 ms	23388 KB	Output is correct
55	Correct	86 ms	23392 KB	Output is correct
56	Correct	80 ms	24032 KB	Output is correct
57	Correct	66 ms	22376 KB	Output is correct
58	Correct	66 ms	23976 KB	Output is correct
59	Correct	16 ms	7892 KB	Output is correct
60	Correct	63 ms	20908 KB	Output is correct
61	Correct	72 ms	22788 KB	Output is correct
62	Correct	73 ms	23396 KB	Output is correct
63	Correct	74 ms	23372 KB	Output is correct
64	Correct	73 ms	23292 KB	Output is correct
65	Correct	67 ms	23856 KB	Output is correct
66	Correct	73 ms	23796 KB	Output is correct
67	Correct	61 ms	23556 KB	Output is correct
68	Correct	77 ms	23572 KB	Output is correct
69	Correct	76 ms	23488 KB	Output is correct
70	Correct	59 ms	23564 KB	Output is correct

답안 #760517

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