제출 #1292922

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1292922		trandaihao5555	Power Plant (JOI20_power)	C++20	100 / 100	141 ms	21372 KiB

power

#include <bits/stdc++.h>

#define int long long

#define debug     cout << "ok\n";
#define SQR(x)    (1LL * ((x) * (x)))
#define MASK(i)   (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)
#define fi        first
#define se        second
#define pb        push_back

#define mp make_pair
#define pii pair<int,int>
#define pli pair<ll,int>
#define vi vector<int>

#define FAST ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef unsigned int ui;

using namespace std;

const int M = 1e9 + 7;
const int INF = 1e9 + 7;
const ll INFLL = (ll)2e18 + 7LL;
const ld PI = acos(-1);

const int dx[] = {1, -1, 0, 0, -1, 1, 1, -1};
const int dy[] = {0, 0, 1, -1, -1, -1, 1, 1};

template<class _, class __>
    bool minimize(_ &x, const __ y){
        if(x > y){
            x = y;
            return true;
        } else return false;
    }
template<class _, class __>
    bool maximize(_ &x, const __ y){
        if(x < y){
            x = y;
            return true;
        } else return false;
    }

template<class _,class __>
    void Add(_ &x, const __ y) {
        x += y;
        if (x >= M) {
            x -= M;
        }
        return;
    }

template<class _,class __>
    void Diff(_ &x, const __ y) {
        x -= y;
        if (x < 0) {
            x += M;
        }
        return;
    }

//--------------------------------------------------------------

const int MaxN = 1e6+7;

int n,f[MaxN],res = 0;
bool ch[MaxN];
vi a[MaxN];

void dfs(int u,int p) {
    for (int v : a[u]) {
        if (v == p) continue;
        dfs(v,u);
    }

    for (int v : a[u]) {
        if (v == p) continue;
        f[u] += f[v];
        if (ch[u]) maximize(res,f[v] + 1);
    }
    if (ch[u]) {
        f[u]--;
        maximize(f[u],1);
    }
    maximize(res,f[u]);
}

void sol() {
    cin >> n;
    for (int i=1;i<n;i++) {
        int u,v;
        cin >> u >> v;
        a[u].pb(v);
        a[v].pb(u);
    }
    int cnt = 0;
    for (int i=1;i<=n;i++) {
        char x; cin >> x;
        if (x == '1') ch[i] = true,cnt++;
        else ch[i] = false;
    }
    dfs(1,-1);
    cout << res;
}

signed main() {
//    freopen("test.inp","r",stdin);
//    freopen("test.out","w",stdout);
    FAST
    int t=1;
//    cin >> t;
    while (t--) sol();
}

• Subtask 1: 6 / 6
• Subtask 2: 41 / 41
• Subtask 3: 53 / 53