/ SeriousOJ /

Record Detail

Wrong Answer


  
# Status Time Cost Memory Cost
#1 Accepted 2ms 332.0 KiB
#2 Accepted 2ms 332.0 KiB
#3 Wrong Answer 2ms 480.0 KiB
#4 Wrong Answer 5ms 692.0 KiB
#5 Wrong Answer 61ms 4.707 MiB
#6 Wrong Answer 120ms 4.809 MiB
#7 Wrong Answer 79ms 4.684 MiB
#8 Wrong Answer 48ms 628.0 KiB
#9 Wrong Answer 106ms 1.016 MiB
#10 Wrong Answer 135ms 4.906 MiB
#11 Wrong Answer 96ms 5.285 MiB
#12 Wrong Answer 118ms 5.387 MiB
#13 Wrong Answer 49ms 5.402 MiB
#14 Wrong Answer 162ms 5.16 MiB
#15 Wrong Answer 60ms 1.25 MiB
#16 Wrong Answer 39ms 5.031 MiB
#17 Wrong Answer 34ms 4.711 MiB
#18 Wrong Answer 35ms 4.844 MiB
#19 Accepted 285ms 30.664 MiB
#20 Wrong Answer 262ms 30.703 MiB
#21 Wrong Answer 220ms 29.375 MiB
#22 Accepted 176ms 35.871 MiB
#23 Wrong Answer 327ms 29.566 MiB
#24 Wrong Answer 324ms 30.176 MiB
#25 Wrong Answer 186ms 30.156 MiB
#26 Accepted 11ms 2.133 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);
    }
    
    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();
        g[u].clear();
        g[v].erase(u);
        // cout << u << " ";
        pq.pop();
        if(g[v].size() == 1 && val[v] == 0) {
            pq.push(v);
        }
    }

    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) ++ans;
            self(v, u, self);
            if(cnt) ++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 16:51:30
Judged At
2024-10-03 13:25:36
Judged By
Score
22
Total Time
327ms
Peak Memory
35.871 MiB