/ SeriousOJ /

Record Detail

Time Exceeded


  
# Status Time Cost Memory Cost
#1 Accepted 1ms 324.0 KiB
#2 Wrong Answer 1ms 328.0 KiB
#3 Wrong Answer 1ms 320.0 KiB
#4 Wrong Answer 4ms 580.0 KiB
#5 Wrong Answer 750ms 4.617 MiB
#6 Time Exceeded ≥1091ms ≥4.648 MiB
#7 Wrong Answer 52ms 4.684 MiB
#8 Wrong Answer 29ms 624.0 KiB
#9 Wrong Answer 176ms 1.016 MiB
#10 Time Exceeded ≥1089ms ≥4.27 MiB
#11 Time Exceeded ≥1079ms ≥5.168 MiB
#12 Time Exceeded ≥1094ms ≥4.547 MiB
#13 Wrong Answer 564ms 5.277 MiB
#14 Time Exceeded ≥1087ms ≥4.805 MiB
#15 Wrong Answer 133ms 1.312 MiB
#16 Wrong Answer 473ms 4.906 MiB
#17 Wrong Answer 21ms 4.902 MiB
#18 Wrong Answer 20ms 4.898 MiB
#19 Time Exceeded ≥1097ms ≥29.391 MiB
#20 Time Exceeded ≥1091ms ≥29.363 MiB
#21 Wrong Answer 115ms 29.383 MiB
#22 Wrong Answer 91ms 29.586 MiB
#23 Wrong Answer 164ms 29.445 MiB
#24 Time Exceeded ≥1091ms ≥29.379 MiB
#25 Time Exceeded ≥1085ms ≥29.512 MiB
#26 Wrong Answer 51ms 2.012 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;
    cin >> n;
    vector<ll> v(n + 1);
    for (int i = 1; i <= n; i++) {
        ll x; cin >> x;
        v[i] = x;
    }
    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);
    }
    set<ll> st;
    
    while(true) {
        bool ok = 1;
        for(int i = 1; i <= n; i++) {
            if(g[i].size() == 1 && v[i] == 0) {
                g[*g[i].begin()].erase(i);
                g[i].clear();
                ok = 0;
                break;
            }
        }
        if(ok) break;
    }
    ll ans = 0;
    for(int i = 1; i <= n; i++) {
        if(g[i].size()) ++ans;
    }
    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:26:13
Judged At
2024-10-03 13:26:56
Judged By
Score
1
Total Time
≥1097ms
Peak Memory
≥29.586 MiB