oj.uz

답안 #772499

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
772499 2023-07-04T07:31:40 Z Sam_a17 Power Plant (JOI20_power) C++17
100 / 100
 197 ms 28860 KB 
#define _CRT_SECURE_NO_WARNINGS
#include <bits/stdc++.h>
//#include "temp.cpp"
#include <cstdio>
using namespace std;
 
#ifndef ONLINE_JUDGE
#define dbg(x) cerr << #x <<" "; print(x); cerr << endl;
#else
#define dbg(x)
#endif
 
#define sz(x) (int)x.size()
#define len(x) (int)x.length()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define clr(x) (x).clear()
#define uniq(x) x.resize(unique(all(x)) - x.begin());
#define blt __builtin_popcount
 
#define pb push_back
#define popf pop_front
#define popb pop_back
#define ld long double
#define ll long long
 
void print(long long t) {cerr << t;}
void print(int t) {cerr << t;}
void print(string t) {cerr << t;}
void print(char t) {cerr << t;}
void print(double t) {cerr << t;}
void print(long double t) {cerr << t;}
void print(unsigned long long t) {cerr << t;}
 
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
#define nl '\n'
 
// Indexed Set  
template <class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
 
template <class T, class V> void print(pair <T, V> p);
template <class T> void print(vector <T> v);
template <class T> void print(set <T> v);
template <class T, class V> void print(map <T, V> v);
template <class T> void print(multiset <T> v);
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]";}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
// template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(Tree <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]";}
template <class T> void print(deque <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]";}
 
 
// for random generations
mt19937 myrand(chrono::steady_clock::now().time_since_epoch().count());
// mt19937 myrand(131);
 
// for grid problems
int dx[8] = {-1,0,1,0,1,-1,1,-1};
int dy[8] = {0,1,0,-1,1,1,-1,-1};
 
// lowest / (1 << 17) >= 1e5 / (1 << 18) >= 2e5 / (1 << 21) >= 1e6
void fastIO() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr); cout.tie(nullptr);
}
// file in/out
void setIO(string str = "") {
  fastIO();
 
  // if(str == "input") {
    // freopen("input.txt", "r", stdin);
    // freopen("output.txt", "w", stdout);
  // } else if(str != "") {
    // freopen((str + ".in").c_str(), "r", stdin);
    // freopen((str + ".out").c_str(), "w", stdout);
  // }
}

const int N = 2e5 + 10;
vector<int> adj[N];
int n, dp[N], answ;
bool is_bomb[N];

void dfs(int node, int parent) {
  if(parent) {
    if(is_bomb[node]) {
      dp[node] = 1;
    } else {
      dp[node] = 0;
    }
  } else {
    dp[node] = 0;
  }

  for(auto i: adj[node]) {
    if(i == parent) continue;
    dfs(i, node);
  }

  int is_black = 0, ans = 0;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    if(dp[i] > 0) {
      is_black++;
    }
    ans += max(0, dp[i]);
  }

  if(is_black) {
    ans -= dp[node];
  }
  
  if(!parent && is_black >= 2 && is_bomb[node]) {
    ans -= 2;
  }  
  dp[node] = max(dp[node], ans);
}

void dfs1(int node, int parent, int up_dp) {
  int is_black = 0, ans = 0;
  for(auto i: adj[node]) {
    if(i == parent) continue;
    if(dp[i] > 0) {
      is_black++;
    }
    ans += max(0, dp[i]);
  }

  if(up_dp > 0) {
    is_black++;
  }
  ans += max(0, up_dp);

  if(is_black >= 2) {
    answ = max(answ, ans - is_bomb[node]);
  } else {
    answ = max(answ, ans + is_bomb[node]);
  }

  if(is_black) {
    ans -= is_bomb[node];
  }

  for(auto i: adj[node]) {
    if(i == parent) continue;
    int add = 0;
    if(dp[i] > 0) {
      is_black--;
      if(is_black == 0) {
        add = is_bomb[node];
      }
    }
    ans -= max(0, dp[i]);

    int cur = is_bomb[node];
    dfs1(i, node, max(cur, ans + add));

    ans += max(0, dp[i]);
    if(dp[i] > 0) {
      is_black++;
    }
  }

}

void solve_() {
  cin >> n;

  for(int i = 1; i <= n - 1; i++) {
    int a, b; cin >> a >> b;
    adj[a].push_back(b);
    adj[b].push_back(a);
  }

  string s; cin >> s;
  vector<int> can;
  for(int i = 0; i < n; i++) {
    if(s[i] == '1') {
      can.push_back(i + 1);
      is_bomb[i + 1] = true;
    } 
  }

  //
  dfs(1, 0);
  // answ = max(answ, dp[1] + is_bomb[1]);
  dfs1(1, 0, 0);
  
  cout << answ << '\n';
}
 
int main() {
  setIO();
 
  auto solve = [&](int test_case)-> void {
    for(int i = 1; i <= test_case; i++) {
      solve_();
    }
  };
 
  int test_cases = 1;
  // cin >> test_cases;
  solve(test_cases);
 
  return 0;
}

Subtask #1
6.0 / 6.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4924 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct

Subtask #2
41.0 / 41.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4924 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 4 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 5 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5204 KB Output is correct
30 Correct 3 ms 5204 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 4 ms 5076 KB Output is correct
44 Correct 3 ms 5076 KB Output is correct
45 Correct 3 ms 5076 KB Output is correct
46 Correct 3 ms 5076 KB Output is correct
47 Correct 3 ms 5076 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 3 ms 5204 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 2 ms 5096 KB Output is correct
52 Correct 3 ms 5076 KB Output is correct
53 Correct 4 ms 5076 KB Output is correct
54 Correct 3 ms 5076 KB Output is correct
55 Correct 3 ms 5076 KB Output is correct
56 Correct 3 ms 5076 KB Output is correct
57 Correct 3 ms 5204 KB Output is correct
58 Correct 3 ms 5076 KB Output is correct
59 Correct 3 ms 5076 KB Output is correct
60 Correct 3 ms 5076 KB Output is correct
61 Correct 3 ms 5076 KB Output is correct
62 Correct 3 ms 5204 KB Output is correct
63 Correct 3 ms 5076 KB Output is correct

Subtask #3
53.0 / 53.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 3 ms 4924 KB Output is correct
4 Correct 2 ms 4948 KB Output is correct
5 Correct 2 ms 4948 KB Output is correct
6 Correct 2 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 2 ms 4948 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 2 ms 4948 KB Output is correct
11 Correct 2 ms 4948 KB Output is correct
12 Correct 2 ms 4948 KB Output is correct
13 Correct 2 ms 4948 KB Output is correct
14 Correct 2 ms 4948 KB Output is correct
15 Correct 2 ms 4948 KB Output is correct
16 Correct 2 ms 4948 KB Output is correct
17 Correct 2 ms 4948 KB Output is correct
18 Correct 2 ms 4948 KB Output is correct
19 Correct 2 ms 4948 KB Output is correct
20 Correct 3 ms 4948 KB Output is correct
21 Correct 3 ms 4948 KB Output is correct
22 Correct 3 ms 5076 KB Output is correct
23 Correct 4 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 5 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 3 ms 5076 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 3 ms 5204 KB Output is correct
30 Correct 3 ms 5204 KB Output is correct
31 Correct 3 ms 5076 KB Output is correct
32 Correct 3 ms 5076 KB Output is correct
33 Correct 3 ms 5076 KB Output is correct
34 Correct 3 ms 5076 KB Output is correct
35 Correct 3 ms 5076 KB Output is correct
36 Correct 3 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5076 KB Output is correct
39 Correct 3 ms 5076 KB Output is correct
40 Correct 3 ms 5076 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 4 ms 5076 KB Output is correct
44 Correct 3 ms 5076 KB Output is correct
45 Correct 3 ms 5076 KB Output is correct
46 Correct 3 ms 5076 KB Output is correct
47 Correct 3 ms 5076 KB Output is correct
48 Correct 3 ms 5076 KB Output is correct
49 Correct 3 ms 5204 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 2 ms 5096 KB Output is correct
52 Correct 3 ms 5076 KB Output is correct
53 Correct 4 ms 5076 KB Output is correct
54 Correct 3 ms 5076 KB Output is correct
55 Correct 3 ms 5076 KB Output is correct
56 Correct 3 ms 5076 KB Output is correct
57 Correct 3 ms 5204 KB Output is correct
58 Correct 3 ms 5076 KB Output is correct
59 Correct 3 ms 5076 KB Output is correct
60 Correct 3 ms 5076 KB Output is correct
61 Correct 3 ms 5076 KB Output is correct
62 Correct 3 ms 5204 KB Output is correct
63 Correct 3 ms 5076 KB Output is correct
64 Correct 109 ms 13404 KB Output is correct
65 Correct 118 ms 16124 KB Output is correct
66 Correct 87 ms 16024 KB Output is correct
67 Correct 93 ms 15756 KB Output is correct
68 Correct 99 ms 15736 KB Output is correct
69 Correct 81 ms 15504 KB Output is correct
70 Correct 80 ms 15324 KB Output is correct
71 Correct 83 ms 15416 KB Output is correct
72 Correct 78 ms 15224 KB Output is correct
73 Correct 110 ms 28780 KB Output is correct
74 Correct 169 ms 28320 KB Output is correct
75 Correct 76 ms 16052 KB Output is correct
76 Correct 76 ms 15664 KB Output is correct
77 Correct 81 ms 15900 KB Output is correct
78 Correct 77 ms 15624 KB Output is correct
79 Correct 84 ms 15404 KB Output is correct
80 Correct 73 ms 15292 KB Output is correct
81 Correct 81 ms 16700 KB Output is correct
82 Correct 75 ms 15844 KB Output is correct
83 Correct 95 ms 21220 KB Output is correct
84 Correct 112 ms 23144 KB Output is correct
85 Correct 109 ms 22540 KB Output is correct
86 Correct 97 ms 17132 KB Output is correct
87 Correct 99 ms 16260 KB Output is correct
88 Correct 128 ms 17384 KB Output is correct
89 Correct 110 ms 17284 KB Output is correct
90 Correct 154 ms 17028 KB Output is correct
91 Correct 111 ms 16972 KB Output is correct
92 Correct 113 ms 17144 KB Output is correct
93 Correct 126 ms 20112 KB Output is correct
94 Correct 123 ms 22220 KB Output is correct
95 Correct 119 ms 20456 KB Output is correct
96 Correct 115 ms 18796 KB Output is correct
97 Correct 91 ms 17176 KB Output is correct
98 Correct 121 ms 16692 KB Output is correct
99 Correct 71 ms 16396 KB Output is correct
100 Correct 89 ms 19688 KB Output is correct
101 Correct 96 ms 17600 KB Output is correct
102 Correct 98 ms 16848 KB Output is correct
103 Correct 103 ms 16656 KB Output is correct
104 Correct 54 ms 16104 KB Output is correct
105 Correct 197 ms 24548 KB Output is correct
106 Correct 69 ms 17600 KB Output is correct
107 Correct 64 ms 17612 KB Output is correct
108 Correct 168 ms 28560 KB Output is correct
109 Correct 76 ms 16056 KB Output is correct
110 Correct 187 ms 28860 KB Output is correct
111 Correct 138 ms 16032 KB Output is correct