oj.uz

Submission #775652

# Submission time Handle Problem Language Result Execution time Memory
775652 2023-07-06T17:42:37 Z Filya Power Plant (JOI20_power) C++14
100 / 100
 129 ms 33232 KB 
//♥God will make a way♥
 
//#include <bits/stdc++.h>
#define _CRT_SECURE_NO_WARNINGS
#include <iostream>
#include <string>
#include <algorithm>
#include <cmath>
#include <cstring>
#include <cassert>
#include <set>
#include <map>
#include <unordered_map>
#include <vector>
#include <stack>
#include <queue>
#include <iomanip>
#include <bitset>
#include <stdio.h>
#include <climits>
#include <numeric>
using namespace std;
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
//using namespace __gnu_pbds;
//template <typename T>
//using ordered_set = tree <T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
/////////////////////define/////////////////////
#define ci(x) if(x) cout << "YES" << '\n'; else cout << "NO" << '\n';
#define cii(x) if(check(x))
#define MOD 1000000007
#define MOD2 998244353
#define oo 1e9
#define ool 1e18L
#define pii pair<int, int>
#define pll pair<long long, long long>
#define mii map<int, int>
#define vi vector<int>
#define vpi vector<pair<int, int>>
#define vll vector <ll>
#define ff first
#define ss second
#define mp make_pair
#define ll long long
#define ld long double
#define pb push_back
#define eb emplace_back
#define pob pop_back
#define lb lower_bound
#define ub upper_bound
#define bs binary_search
#define sz(x) (int((x).size()))
#define all(x) (x).begin(), (x).end()
#define alll(x) (x), (x) + n
#define clr(x) (x).clear();
#define fri(x) for(int i = 0; i < x; ++i)
#define frj(x) for(int j = 0; j < x; ++j)
#define frp(x) for(int p = 0; p < x; ++p)
#define frr(a, b) for(int i = a; i < b; ++i)
#define frrj(a, b) for(int j = a; j < b; ++j)
#define fra(x) for(int i = 0; i < x; ++i) cin >> a[i];
#define frb(x) for(int i = 0; i < x; ++i) cin >> b[i];
#define frs(x) for(auto it = x.begin(); it != x.end(); ++it)
#define fr(x) for(auto it : x) //el
#define fastio ios_base::sync_with_stdio(false); cin.tie(0);
#define dbg(x) cerr << #x << ": " << x << endl;
#define ce(x) cout << x << endl;
#define uniq(x) x.resize(unique(all(x)) - x.begin()); //make all one after sorting
#define blt __builtin_popcount
/////////////////////print array, vector, deque, set, multiset, pair, map /////////////////////
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;}
template <class T, class V> void print(pair <T, V> p) {cerr << "{"; print(p.first); cerr << ","; print(p.second); cerr << "}";}
template <class T, class V> void print(T v[],V n) {cerr << "["; for(int i = 0; i < n; i++) {print(v[i]); cerr << " "; } cerr << "]"; cout << endl;}
template <class T> void print(vector <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(set <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(multiset <T> v) {cerr << "[ "; for (T i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(stack <T> v) {cerr << "[ "; stack<T> s = v; while(s.size()) {T i = s.top(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(queue <T> v) {cerr << "[ "; queue<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T> void print(deque <T> v) {cerr << "[ "; deque<T> s = v; while(s.size()) {T i = s.front(); print(i); s.pop_front(); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
template <class T, class V> void print(unordered_map <T, V> v) {cerr << "[ "; for (auto i : v) {print(i); cerr << " ";} cerr << "]"; cout << endl;}
/////////////////////de/////////////////////
bool a[200005];
vi g[200005];
int dp[200005], sum[200005], answ[200005], up[200005];
int root;
void dfs(int v, int p) { //amen gagati hamar fixvac unenq vor ira verevy gagat ka => ete dpn 0chi minus 1 enq anum
    if(v == root) {
        for(int u : g[v]) {
            if(u == p) continue;
            dfs(u, v);
            dp[v] = max(dp[v], dp[u] + 1);
            sum[v] += dp[u];
        }
    } else {
        for(int u : g[v]) {
            if(u == p) continue;
            dfs(u, v);
            dp[v] += dp[u];
            sum[v] += dp[u];
        }
        if(a[v] && dp[v]) dp[v]--;
    }
    if(a[v]) dp[v] = max(dp[v], 1);
}
void dfs1(int v, int p) { //amen gagati hamar fixvac unenq vor ira verevy gagat ka => ete dpn 0chi minus 1 enq anum
    if(v == root) {
        answ[v] = dp[v];
    } else {
        up[v] = up[p] + sum[p] - dp[v];
        if(a[p]) up[v]--;
        answ[v] = max(dp[v], up[v] + 1);
    }
    for(int u : g[v]) {
        if(u == p) continue;
        dfs1(u, v);
        answ[v] = max(answ[v], dp[u] + 1);
    }
}
int main() {
    fastio; int n, x, y; cin >> n;
    fri(n-1) {
        cin >> x >> y;
        g[x].pb(y);
        g[y].pb(x);
    }
    string s; cin >> s; 
    fri(n) a[i+1] = s[i]-'0';
    int ans = 0;
    frr(1, 1 + n) {
        if(a[i]) { //fixenq ayn gagy vory hastat miacaca
            root = i;
            dfs(i, i);
            dfs1(i, i);
            break;
        }
    }
    frr(1, 1 + n) if(a[i]) ans = max(ans, answ[i]);
    cout << ans;
    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 5036 KB Output is correct
3 Correct 2 ms 4988 KB Output is correct
4 Correct 2 ms 5040 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 5036 KB Output is correct
3 Correct 2 ms 4988 KB Output is correct
4 Correct 2 ms 5040 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 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 4 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 5084 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 5028 KB Output is correct
36 Correct 2 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5060 KB Output is correct
39 Correct 3 ms 5204 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 3 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 4 ms 5076 KB Output is correct
48 Correct 3 ms 5204 KB Output is correct
49 Correct 3 ms 5204 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 3 ms 5076 KB Output is correct
52 Correct 3 ms 5076 KB Output is correct
53 Correct 3 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 5136 KB Output is correct
57 Correct 3 ms 5204 KB Output is correct
58 Correct 2 ms 5076 KB Output is correct
59 Correct 3 ms 5076 KB Output is correct
60 Correct 4 ms 5204 KB Output is correct
61 Correct 2 ms 5076 KB Output is correct
62 Correct 2 ms 5204 KB Output is correct
63 Correct 3 ms 5076 KB Output is correct

Subtask #3
53.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4948 KB Output is correct
2 Correct 2 ms 5036 KB Output is correct
3 Correct 2 ms 4988 KB Output is correct
4 Correct 2 ms 5040 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 3 ms 5076 KB Output is correct
23 Correct 3 ms 5076 KB Output is correct
24 Correct 3 ms 5076 KB Output is correct
25 Correct 3 ms 5076 KB Output is correct
26 Correct 3 ms 5076 KB Output is correct
27 Correct 4 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 5084 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 5028 KB Output is correct
36 Correct 2 ms 5076 KB Output is correct
37 Correct 3 ms 5076 KB Output is correct
38 Correct 3 ms 5060 KB Output is correct
39 Correct 3 ms 5204 KB Output is correct
40 Correct 3 ms 5204 KB Output is correct
41 Correct 3 ms 5076 KB Output is correct
42 Correct 3 ms 5076 KB Output is correct
43 Correct 3 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 4 ms 5076 KB Output is correct
48 Correct 3 ms 5204 KB Output is correct
49 Correct 3 ms 5204 KB Output is correct
50 Correct 3 ms 5076 KB Output is correct
51 Correct 3 ms 5076 KB Output is correct
52 Correct 3 ms 5076 KB Output is correct
53 Correct 3 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 5136 KB Output is correct
57 Correct 3 ms 5204 KB Output is correct
58 Correct 2 ms 5076 KB Output is correct
59 Correct 3 ms 5076 KB Output is correct
60 Correct 4 ms 5204 KB Output is correct
61 Correct 2 ms 5076 KB Output is correct
62 Correct 2 ms 5204 KB Output is correct
63 Correct 3 ms 5076 KB Output is correct
64 Correct 79 ms 14992 KB Output is correct
65 Correct 93 ms 17664 KB Output is correct
66 Correct 120 ms 17712 KB Output is correct
67 Correct 127 ms 17676 KB Output is correct
68 Correct 112 ms 17692 KB Output is correct
69 Correct 104 ms 17672 KB Output is correct
70 Correct 104 ms 17800 KB Output is correct
71 Correct 81 ms 17724 KB Output is correct
72 Correct 101 ms 17724 KB Output is correct
73 Correct 113 ms 30348 KB Output is correct
74 Correct 126 ms 25484 KB Output is correct
75 Correct 105 ms 17684 KB Output is correct
76 Correct 97 ms 17564 KB Output is correct
77 Correct 128 ms 17612 KB Output is correct
78 Correct 95 ms 17620 KB Output is correct
79 Correct 85 ms 17600 KB Output is correct
80 Correct 113 ms 17716 KB Output is correct
81 Correct 67 ms 18068 KB Output is correct
82 Correct 75 ms 17752 KB Output is correct
83 Correct 107 ms 22816 KB Output is correct
84 Correct 102 ms 24928 KB Output is correct
85 Correct 116 ms 25396 KB Output is correct
86 Correct 81 ms 18700 KB Output is correct
87 Correct 129 ms 18624 KB Output is correct
88 Correct 121 ms 18896 KB Output is correct
89 Correct 80 ms 18968 KB Output is correct
90 Correct 111 ms 18720 KB Output is correct
91 Correct 109 ms 19120 KB Output is correct
92 Correct 81 ms 19320 KB Output is correct
93 Correct 111 ms 21656 KB Output is correct
94 Correct 80 ms 23376 KB Output is correct
95 Correct 114 ms 22164 KB Output is correct
96 Correct 90 ms 20312 KB Output is correct
97 Correct 96 ms 18688 KB Output is correct
98 Correct 70 ms 18236 KB Output is correct
99 Correct 109 ms 18080 KB Output is correct
100 Correct 99 ms 21308 KB Output is correct
101 Correct 82 ms 19192 KB Output is correct
102 Correct 78 ms 18468 KB Output is correct
103 Correct 79 ms 18208 KB Output is correct
104 Correct 52 ms 17044 KB Output is correct
105 Correct 113 ms 33232 KB Output is correct
106 Correct 78 ms 17652 KB Output is correct
107 Correct 50 ms 17612 KB Output is correct
108 Correct 116 ms 33168 KB Output is correct
109 Correct 51 ms 17004 KB Output is correct
110 Correct 110 ms 33228 KB Output is correct
111 Correct 107 ms 17552 KB Output is correct