/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Wrong Answer 1ms 320.0 KiB
#3 Wrong Answer 1ms 320.0 KiB
#4 Wrong Answer 3ms 580.0 KiB
#5 Wrong Answer 45ms 4.73 MiB
#6 Wrong Answer 85ms 4.984 MiB
#7 Wrong Answer 60ms 4.809 MiB
#8 Wrong Answer 30ms 608.0 KiB
#9 Wrong Answer 68ms 1.012 MiB
#10 Wrong Answer 124ms 4.688 MiB
#11 Wrong Answer 77ms 5.281 MiB
#12 Wrong Answer 79ms 5.375 MiB
#13 Wrong Answer 36ms 5.398 MiB
#14 Wrong Answer 122ms 5.156 MiB
#15 Wrong Answer 41ms 1.098 MiB
#16 Wrong Answer 29ms 5.008 MiB
#17 Wrong Answer 28ms 4.902 MiB
#18 Wrong Answer 26ms 4.77 MiB
#19 Accepted 170ms 30.59 MiB
#20 Wrong Answer 150ms 30.68 MiB
#21 Wrong Answer 127ms 29.445 MiB
#22 Accepted 99ms 36.051 MiB
#23 Wrong Answer 184ms 29.359 MiB
#24 Wrong Answer 189ms 30.066 MiB
#25 Wrong Answer 105ms 30.133 MiB
#26 Accepted 7ms 2.219 MiB

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, cnt = 0;
    cin >> n;
    vector<ll> val(n + 1);
    for (int i = 1; i <= n; i++) {
        ll x; cin >> x;
        val[i] = x;
        if(x) ++cnt;
    }
    vector<set<ll>> g(n + 1);
    for(int i = 0; i + 1 < n; i++) {
        ll u, v; cin >> u >> v;
        g[u].insert(v);
        g[v].insert(u);
    }
    if(cnt == 0) {
        cout << 0 << endl;
        return;
    }

    priority_queue<ll> pq;
    for(int i = 1; i <= n; i++) {
        if(g[i].size() == 1 && val[i] == 0) pq.push(i);
    }
    while(pq.size()) {
        ll u = pq.top();
        ll v = *g[u].begin();
        pq.pop();
        if(g[v].size() == 1 && val[v] == 0) {
            pq.push(v);
        }
        g[u].clear();
        g[v].erase(u);
    }

    ll ans = 0;
    auto dfs = [&](int u, int par, auto&& self) -> void {
        if(val[u] > 0) --cnt; 
        for(auto &v: g[u]) {
            if(v == par) continue;
            // cout << u << " " << v << endl;
            if(cnt > 0) ++ans;
            self(v, u, self);
            if(cnt > 0) ++ans;
        }
        // cout << u << " => " << c << endl;
    };
    for(int i = 1; i <= n; i++) {
        if(g[i].size() == 1) {
            ans = 0;
            dfs(i, -1, dfs);
            break;
        }
        // cout << i << " = ";
        // coutall(g[i]);
    }
    cout << ans << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1078 Apple on Tree
Contest
Bangladesh 2.0
Language
C++20 (G++ 13.2.0)
Submit At
2024-08-16 17:01:12
Judged At
2024-10-03 13:24:36
Judged By
Score
19
Total Time
189ms
Peak Memory
36.051 MiB