oj.uz

Submission #824426

# Submission time Handle Problem Language Result Execution time Memory
824426 2023-08-14T06:05:54 Z arush_agu Power Plant (JOI20_power) C++17
100 / 100
 128 ms 34492 KB 
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstring>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <list>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <sstream>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

#ifdef DEBUG
#include <time.h>
#endif

#define all(a) (a).begin(), (a).end()
#define rev(a) (a).rbegin(), (a).rend()
#define F first
#define S second
int recur_depth = 0;
#ifdef DEBUG
#define dbg(x)                                                                 \
  {                                                                            \
    ++recur_depth;                                                             \
    auto x_ = x;                                                               \
    --recur_depth;                                                             \
    cerr << string(recur_depth, '\t') << "\e[91m" << __func__ << ":"           \
         << __LINE__ << "\t" << #x << " = " << x_ << "\e[39m" << endl;         \
  }
#else
#define dbg(x)
#endif

using namespace std;
using namespace __gnu_pbds;

typedef pair<int, int> ii;

typedef long long ll;
typedef long double ld;
typedef pair<ll, ll> llll;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<pair<int, int>> vii;
typedef vector<vii> vvii;

typedef vector<ll> vl;
typedef vector<vl> vvl;
typedef vector<pair<ll, ll>> vll;
typedef vector<vll> vvll;

typedef vector<bool> vb;

template <class type1>
using ordered_set = tree<type1, null_type, less<type1>, rb_tree_tag,
                         tree_order_statistics_node_update>;

template <typename A, typename B>
ostream &operator<<(ostream &os, const pair<A, B> &p) {
  return os << '(' << p.first << ", " << p.second << ')';
}
template <typename T_container, typename T = typename enable_if<
                                    !is_same<T_container, string>::value,
                                    typename T_container::value_type>::type>
ostream &operator<<(ostream &os, const T_container &v) {
  os << '{';
  string sep;
  for (const T &x : v)
    os << sep << x, sep = ", ";
  return os << '}';
}

const ll MOD = 1e9 + 7;
// const ll MOD = 998244353;
const ll INF = 1e9;
const ld EPS = 1e-9;

void solve() {
  int n;
  cin >> n;
  vvi adj(n);
  for (int i = 0; i < n - 1; i++) {
    int u, v;
    cin >> u >> v;
    u--, v--;
    adj[u].push_back(v);
    adj[v].push_back(u);
  }
  string s;
  cin >> s;

  int cnt_1 = count(all(s), '1');
  if (cnt_1 < 2) {
    cout << cnt_1 << "\n";
    return;
  }

  int ans = 2;
  vi dp(n);
  function<void(int, int)> f = [&](int u, int p) {
    int sum = 0, mx = 0;
    for (int &v : adj[u])
      if (v != p) {
        f(v, u);
        sum += max(dp[v], 0);
        mx = max(mx, dp[v]);
      }

    int x = s[u] == '1';
    dp[u] = max(x, sum - x);
    ans = max(ans, dp[u]);
    if (x)
      ans = max(ans, mx + 1);
  };
  f(0, -1);

  cout << ans << "\n";
}

int main() {
  ios_base::sync_with_stdio(0);
  cin.tie(NULL);

  clock_t start = clock();

  int test_cases = 1;
  // cin >> test_cases;

  while (test_cases--)
    solve();

#ifdef DEBUG
  cerr << fixed << setprecision(10)
       << "\nTime Taken: " << (double)(clock() - start) / CLOCKS_PER_SEC
       << "s\n";
#endif
  return 0;
}

Compilation message

power.cpp: In function 'int main()':
power.cpp:138:11: warning: unused variable 'start' [-Wunused-variable]
  138 |   clock_t start = clock();
      |           ^~~~~

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 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 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct

Subtask #2
41.0 / 41.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 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 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 452 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 428 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 428 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 424 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 448 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 1 ms 464 KB Output is correct
53 Correct 1 ms 424 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 464 KB Output is correct
62 Correct 1 ms 540 KB Output is correct
63 Correct 1 ms 340 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 324 KB Output is correct
4 Correct 1 ms 212 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 0 ms 212 KB Output is correct
7 Correct 1 ms 212 KB Output is correct
8 Correct 1 ms 212 KB Output is correct
9 Correct 0 ms 316 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 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 0 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 1 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 1 ms 340 KB Output is correct
23 Correct 1 ms 468 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 340 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 596 KB Output is correct
30 Correct 1 ms 468 KB Output is correct
31 Correct 1 ms 460 KB Output is correct
32 Correct 1 ms 340 KB Output is correct
33 Correct 1 ms 452 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 460 KB Output is correct
36 Correct 1 ms 340 KB Output is correct
37 Correct 1 ms 468 KB Output is correct
38 Correct 1 ms 428 KB Output is correct
39 Correct 1 ms 468 KB Output is correct
40 Correct 2 ms 460 KB Output is correct
41 Correct 1 ms 460 KB Output is correct
42 Correct 1 ms 468 KB Output is correct
43 Correct 1 ms 468 KB Output is correct
44 Correct 1 ms 428 KB Output is correct
45 Correct 1 ms 468 KB Output is correct
46 Correct 1 ms 468 KB Output is correct
47 Correct 1 ms 424 KB Output is correct
48 Correct 1 ms 468 KB Output is correct
49 Correct 1 ms 468 KB Output is correct
50 Correct 1 ms 448 KB Output is correct
51 Correct 1 ms 468 KB Output is correct
52 Correct 1 ms 464 KB Output is correct
53 Correct 1 ms 424 KB Output is correct
54 Correct 1 ms 468 KB Output is correct
55 Correct 1 ms 468 KB Output is correct
56 Correct 1 ms 468 KB Output is correct
57 Correct 1 ms 596 KB Output is correct
58 Correct 1 ms 468 KB Output is correct
59 Correct 1 ms 468 KB Output is correct
60 Correct 1 ms 468 KB Output is correct
61 Correct 1 ms 464 KB Output is correct
62 Correct 1 ms 540 KB Output is correct
63 Correct 1 ms 340 KB Output is correct
64 Correct 80 ms 15192 KB Output is correct
65 Correct 99 ms 15220 KB Output is correct
66 Correct 71 ms 15112 KB Output is correct
67 Correct 74 ms 15316 KB Output is correct
68 Correct 70 ms 15132 KB Output is correct
69 Correct 78 ms 15164 KB Output is correct
70 Correct 68 ms 15208 KB Output is correct
71 Correct 78 ms 15128 KB Output is correct
72 Correct 60 ms 14440 KB Output is correct
73 Correct 92 ms 32840 KB Output is correct
74 Correct 128 ms 32744 KB Output is correct
75 Correct 83 ms 15092 KB Output is correct
76 Correct 70 ms 15040 KB Output is correct
77 Correct 79 ms 15060 KB Output is correct
78 Correct 69 ms 14988 KB Output is correct
79 Correct 93 ms 14988 KB Output is correct
80 Correct 70 ms 14984 KB Output is correct
81 Correct 59 ms 15540 KB Output is correct
82 Correct 67 ms 15196 KB Output is correct
83 Correct 104 ms 22324 KB Output is correct
84 Correct 122 ms 25372 KB Output is correct
85 Correct 83 ms 24932 KB Output is correct
86 Correct 71 ms 17092 KB Output is correct
87 Correct 72 ms 16264 KB Output is correct
88 Correct 86 ms 16644 KB Output is correct
89 Correct 77 ms 16720 KB Output is correct
90 Correct 71 ms 16400 KB Output is correct
91 Correct 69 ms 16624 KB Output is correct
92 Correct 101 ms 17200 KB Output is correct
93 Correct 71 ms 20568 KB Output is correct
94 Correct 82 ms 23048 KB Output is correct
95 Correct 77 ms 21164 KB Output is correct
96 Correct 100 ms 18688 KB Output is correct
97 Correct 92 ms 16440 KB Output is correct
98 Correct 89 ms 15800 KB Output is correct
99 Correct 66 ms 15548 KB Output is correct
100 Correct 80 ms 19988 KB Output is correct
101 Correct 91 ms 17128 KB Output is correct
102 Correct 65 ms 16000 KB Output is correct
103 Correct 68 ms 15708 KB Output is correct
104 Correct 50 ms 16056 KB Output is correct
105 Correct 94 ms 28324 KB Output is correct
106 Correct 46 ms 15832 KB Output is correct
107 Correct 45 ms 15912 KB Output is correct
108 Correct 89 ms 33848 KB Output is correct
109 Correct 46 ms 15984 KB Output is correct
110 Correct 105 ms 34492 KB Output is correct
111 Correct 66 ms 15004 KB Output is correct