oj.uz

Submission #772460

# Submission time Handle Problem Language Result Execution time Memory
772460 2023-07-04T06:48:44 Z Sam_a17 Power Plant (JOI20_power) C++17
47 / 100
 1500 ms 13396 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];
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) {
    ans -= 2;
  }  
  dp[node] = max(dp[node], ans);
}
 
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;
    } 
  }
 
  int answ = 0;
  for(int i = 1; i <= n; i++) {
    dfs(i, 0);
    answ = max(answ, dp[i] + is_bomb[i]);
  }
 
  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

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 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 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 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 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 47 ms 5076 KB Output is correct
23 Correct 60 ms 5076 KB Output is correct
24 Correct 57 ms 5076 KB Output is correct
25 Correct 48 ms 5104 KB Output is correct
26 Correct 46 ms 5076 KB Output is correct
27 Correct 47 ms 5104 KB Output is correct
28 Correct 46 ms 5076 KB Output is correct
29 Correct 71 ms 5272 KB Output is correct
30 Correct 66 ms 5244 KB Output is correct
31 Correct 41 ms 5076 KB Output is correct
32 Correct 42 ms 5076 KB Output is correct
33 Correct 46 ms 5076 KB Output is correct
34 Correct 48 ms 5076 KB Output is correct
35 Correct 47 ms 5092 KB Output is correct
36 Correct 46 ms 5076 KB Output is correct
37 Correct 38 ms 5076 KB Output is correct
38 Correct 43 ms 5076 KB Output is correct
39 Correct 60 ms 5176 KB Output is correct
40 Correct 64 ms 5076 KB Output is correct
41 Correct 67 ms 5204 KB Output is correct
42 Correct 59 ms 5076 KB Output is correct
43 Correct 56 ms 5128 KB Output is correct
44 Correct 46 ms 5076 KB Output is correct
45 Correct 53 ms 5076 KB Output is correct
46 Correct 48 ms 5132 KB Output is correct
47 Correct 45 ms 5076 KB Output is correct
48 Correct 45 ms 5208 KB Output is correct
49 Correct 47 ms 5184 KB Output is correct
50 Correct 46 ms 5076 KB Output is correct
51 Correct 56 ms 5076 KB Output is correct
52 Correct 48 ms 5116 KB Output is correct
53 Correct 44 ms 5076 KB Output is correct
54 Correct 45 ms 5144 KB Output is correct
55 Correct 45 ms 5076 KB Output is correct
56 Correct 27 ms 5076 KB Output is correct
57 Correct 64 ms 5204 KB Output is correct
58 Correct 26 ms 5084 KB Output is correct
59 Correct 26 ms 5076 KB Output is correct
60 Correct 62 ms 5264 KB Output is correct
61 Correct 27 ms 5076 KB Output is correct
62 Correct 64 ms 5236 KB Output is correct
63 Correct 50 ms 5100 KB Output is correct

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 4948 KB Output is correct
3 Correct 2 ms 4948 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 2 ms 4948 KB Output is correct
21 Correct 2 ms 4948 KB Output is correct
22 Correct 47 ms 5076 KB Output is correct
23 Correct 60 ms 5076 KB Output is correct
24 Correct 57 ms 5076 KB Output is correct
25 Correct 48 ms 5104 KB Output is correct
26 Correct 46 ms 5076 KB Output is correct
27 Correct 47 ms 5104 KB Output is correct
28 Correct 46 ms 5076 KB Output is correct
29 Correct 71 ms 5272 KB Output is correct
30 Correct 66 ms 5244 KB Output is correct
31 Correct 41 ms 5076 KB Output is correct
32 Correct 42 ms 5076 KB Output is correct
33 Correct 46 ms 5076 KB Output is correct
34 Correct 48 ms 5076 KB Output is correct
35 Correct 47 ms 5092 KB Output is correct
36 Correct 46 ms 5076 KB Output is correct
37 Correct 38 ms 5076 KB Output is correct
38 Correct 43 ms 5076 KB Output is correct
39 Correct 60 ms 5176 KB Output is correct
40 Correct 64 ms 5076 KB Output is correct
41 Correct 67 ms 5204 KB Output is correct
42 Correct 59 ms 5076 KB Output is correct
43 Correct 56 ms 5128 KB Output is correct
44 Correct 46 ms 5076 KB Output is correct
45 Correct 53 ms 5076 KB Output is correct
46 Correct 48 ms 5132 KB Output is correct
47 Correct 45 ms 5076 KB Output is correct
48 Correct 45 ms 5208 KB Output is correct
49 Correct 47 ms 5184 KB Output is correct
50 Correct 46 ms 5076 KB Output is correct
51 Correct 56 ms 5076 KB Output is correct
52 Correct 48 ms 5116 KB Output is correct
53 Correct 44 ms 5076 KB Output is correct
54 Correct 45 ms 5144 KB Output is correct
55 Correct 45 ms 5076 KB Output is correct
56 Correct 27 ms 5076 KB Output is correct
57 Correct 64 ms 5204 KB Output is correct
58 Correct 26 ms 5084 KB Output is correct
59 Correct 26 ms 5076 KB Output is correct
60 Correct 62 ms 5264 KB Output is correct
61 Correct 27 ms 5076 KB Output is correct
62 Correct 64 ms 5236 KB Output is correct
63 Correct 50 ms 5100 KB Output is correct
64 Execution timed out 1584 ms 13396 KB Time limit exceeded
65 Halted 0 ms 0 KB -