Submission #955528

#	Time	Username	Problem	Language	Result	Execution time	Memory
955528		HorizonWest	Power Plant (JOI20_power)	C++17	100 / 100	110 ms	25488 KiB

power

#include <bits/stdc++.h>
using namespace std;

#define endl '\n'
#define db double
#define ll __int128
#define int long long
#define pb push_back
#define fs first
#define sd second
#define Mod long(1e9 + 7)
#define all(x) x.begin(), x.end()
#define unvisited long(-1)
#define Eps double(1e-9)
#define _for(i, n) for(int i = 0; i < (n); i++)
#define dbg(x) cout << #x ": " << x << endl;

const int Max = 1e6 + 7, Inf = 1e9 + 7;

void print(bool x) { cout << (x ? "YES" : "NO") << endl; }

string tostring (__int128 x)
{
    string ans = "";
    while(x > 0)
    {
        ans += (x % 10 + '0');
        x /= 10;
    }
    reverse(all(ans));
    return ans;
}

vector <vector<int>> v;
string s; int ans;

int dfs(int node, int parent)
{
    int sum = 0, me = s[node] - '0';
    for(auto& u : v[node]) if(u != parent)
    {
        int w = dfs(u, node); 
        sum += w; ans = max(ans, w + me);
    }

    sum = sum - me;
    sum = max(sum, me);
    ans = max(ans, sum);
    return sum;
}

void solve()
{
    int n; cin >> n; 
    v.assign(n+1, vector <int> ());
    for(int i = 0; i < n-1; i++)
    {
        int a, b; cin >> a >> b; a--; b--;
        v[a].pb(b); v[b].pb(a); 
    }

    cin >> s;

    for(int i= 0; i < n; i++)
        ans += (s[i] - '0');

    ans = min(ans, 2LL); dfs(0, -1);

    cout << ans << endl;
}

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

    int Q = 1; //cin >> Q;

    while (Q--)
    {
        solve();
    }

    return 0;
}

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