oj.uz

Submission #774095

# Submission time Handle Problem Language Result Execution time Memory
774095 2023-07-05T12:00:47 Z Filya Power Plant (JOI20_power) C++14
47 / 100
 1500 ms 13084 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];
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);
        }
        int cur = 0;
        for(int u : g[v]) {
            if(u == p) continue;
            cur += dp[u];
        }
        dp[v] = max(dp[v], 1);
        dp[v] = max(dp[v], cur - 1);
    } else {
        for(int u : g[v]) {
            if(u == p) continue;
            dfs(u, v);
            dp[v] += dp[u];
        }
        if(a[v]) {
            if(dp[v]) dp[v]--;
            dp[v] = max(dp[v], 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
            frrj(1, 1 + n) dp[j] = 0;
            root = i;
            dfs(i, i);
            ans = max(ans, dp[i]);
            // print(dp, n + 1);
        }
    }
    cout << ans;
    return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4908 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 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 4 ms 4948 KB Output is correct
14 Correct 3 ms 5028 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 3 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

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4908 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 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 4 ms 4948 KB Output is correct
14 Correct 3 ms 5028 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 3 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 41 ms 5108 KB Output is correct
23 Correct 41 ms 5076 KB Output is correct
24 Correct 30 ms 5036 KB Output is correct
25 Correct 20 ms 5036 KB Output is correct
26 Correct 20 ms 5076 KB Output is correct
27 Correct 6 ms 5032 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 71 ms 5256 KB Output is correct
30 Correct 36 ms 5252 KB Output is correct
31 Correct 35 ms 5040 KB Output is correct
32 Correct 18 ms 5120 KB Output is correct
33 Correct 38 ms 5076 KB Output is correct
34 Correct 22 ms 5124 KB Output is correct
35 Correct 12 ms 5044 KB Output is correct
36 Correct 9 ms 5024 KB Output is correct
37 Correct 24 ms 5076 KB Output is correct
38 Correct 18 ms 5124 KB Output is correct
39 Correct 50 ms 5184 KB Output is correct
40 Correct 26 ms 5188 KB Output is correct
41 Correct 14 ms 5196 KB Output is correct
42 Correct 22 ms 5076 KB Output is correct
43 Correct 9 ms 5040 KB Output is correct
44 Correct 45 ms 5144 KB Output is correct
45 Correct 32 ms 5164 KB Output is correct
46 Correct 21 ms 5076 KB Output is correct
47 Correct 18 ms 5044 KB Output is correct
48 Correct 43 ms 5076 KB Output is correct
49 Correct 43 ms 5076 KB Output is correct
50 Correct 44 ms 5160 KB Output is correct
51 Correct 49 ms 5144 KB Output is correct
52 Correct 38 ms 5076 KB Output is correct
53 Correct 29 ms 5152 KB Output is correct
54 Correct 42 ms 5036 KB Output is correct
55 Correct 41 ms 5076 KB Output is correct
56 Correct 3 ms 5076 KB Output is correct
57 Correct 3 ms 5168 KB Output is correct
58 Correct 23 ms 5084 KB Output is correct
59 Correct 23 ms 5076 KB Output is correct
60 Correct 3 ms 5204 KB Output is correct
61 Correct 3 ms 5044 KB Output is correct
62 Correct 3 ms 5168 KB Output is correct
63 Correct 31 ms 5076 KB Output is correct

Subtask #3
0.0 / 53.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4948 KB Output is correct
2 Correct 3 ms 4948 KB Output is correct
3 Correct 2 ms 4948 KB Output is correct
4 Correct 3 ms 4948 KB Output is correct
5 Correct 3 ms 5024 KB Output is correct
6 Correct 3 ms 4948 KB Output is correct
7 Correct 2 ms 4948 KB Output is correct
8 Correct 3 ms 4908 KB Output is correct
9 Correct 2 ms 4948 KB Output is correct
10 Correct 3 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 4 ms 4948 KB Output is correct
14 Correct 3 ms 5028 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 3 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 41 ms 5108 KB Output is correct
23 Correct 41 ms 5076 KB Output is correct
24 Correct 30 ms 5036 KB Output is correct
25 Correct 20 ms 5036 KB Output is correct
26 Correct 20 ms 5076 KB Output is correct
27 Correct 6 ms 5032 KB Output is correct
28 Correct 3 ms 5076 KB Output is correct
29 Correct 71 ms 5256 KB Output is correct
30 Correct 36 ms 5252 KB Output is correct
31 Correct 35 ms 5040 KB Output is correct
32 Correct 18 ms 5120 KB Output is correct
33 Correct 38 ms 5076 KB Output is correct
34 Correct 22 ms 5124 KB Output is correct
35 Correct 12 ms 5044 KB Output is correct
36 Correct 9 ms 5024 KB Output is correct
37 Correct 24 ms 5076 KB Output is correct
38 Correct 18 ms 5124 KB Output is correct
39 Correct 50 ms 5184 KB Output is correct
40 Correct 26 ms 5188 KB Output is correct
41 Correct 14 ms 5196 KB Output is correct
42 Correct 22 ms 5076 KB Output is correct
43 Correct 9 ms 5040 KB Output is correct
44 Correct 45 ms 5144 KB Output is correct
45 Correct 32 ms 5164 KB Output is correct
46 Correct 21 ms 5076 KB Output is correct
47 Correct 18 ms 5044 KB Output is correct
48 Correct 43 ms 5076 KB Output is correct
49 Correct 43 ms 5076 KB Output is correct
50 Correct 44 ms 5160 KB Output is correct
51 Correct 49 ms 5144 KB Output is correct
52 Correct 38 ms 5076 KB Output is correct
53 Correct 29 ms 5152 KB Output is correct
54 Correct 42 ms 5036 KB Output is correct
55 Correct 41 ms 5076 KB Output is correct
56 Correct 3 ms 5076 KB Output is correct
57 Correct 3 ms 5168 KB Output is correct
58 Correct 23 ms 5084 KB Output is correct
59 Correct 23 ms 5076 KB Output is correct
60 Correct 3 ms 5204 KB Output is correct
61 Correct 3 ms 5044 KB Output is correct
62 Correct 3 ms 5168 KB Output is correct
63 Correct 31 ms 5076 KB Output is correct
64 Execution timed out 1558 ms 13084 KB Time limit exceeded
65 Halted 0 ms 0 KB -