제출 #1081566

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
1081566	2024-08-30 07:30:34	vjudge1	Mag (COCI16_mag)	C++17	84 / 120	893 ms	262144 KiB

mag

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include<bits/stdc++.h>
using namespace std;
bool operator < (const pair<int, int>& x, const pair<int, int>& y) {
  return 1LL * x.first * y.second < 1LL * x.second * y.first;
}
int main() {
  int n; cin >> n;
  vector<vector<int>> adj(n + 1, vector<int>());
  for (int i = 1, a, b; i < n; i++) {
    cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }
  vector<int> val(n + 1, 0);
  vector<vector<int>> dp(n + 1, vector<int>()), dp_pref(n + 1, vector<int>()), dp_suf(n + 1, vector<int>());
  vector<int> dp2(n + 1, 0);
  for (int i = 1; i <= n; i++) cin >> val[i];
  function<void(int, int)> dfs1 = [&](int u, int par) -> void {
    if (u != 1 && adj[u].size() == 1) {
      dp[u].emplace_back(0);
      dp_pref[u].emplace_back(0);
      dp_suf[u].emplace_back(0);
      return;
    }
    for (int v: adj[u]) {
      if (v == par) { dp[u].push_back(0); continue; }
      dfs1(v, u);
      if (val[v] != 1) dp[u].push_back(0);
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 12 / 12
• Subtask 2: 12 / 12
• Subtask 3: 12 / 12
• Subtask 4: 0 / 12
• Subtask 5: 0 / 12
• Subtask 6: 12 / 12
• Subtask 7: 0 / 12
• Subtask 8: 12 / 12
• Subtask 9: 12 / 12
• Subtask 10: 12 / 12