# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
588736 | Loki_Nguyen | Power Plant (JOI20_power) | C++14 | 4 ms | 7380 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
#define ll long long
#define pb push_back
#define task "test"
#define pll pair<ll, ll>
#define pii pair<ll, pll>
#define fi first
#define se second
#define ull unsigned long long
using namespace std;
const ll mod = 1e15 + 7;
const ll N = 3e5 + 5;
const ll M = 1e6 + 5;
vector<ll> adj[N];
vector<ll> kq;
int n, m, t, k, b[N], lab[N], a[N], ans, tong, d[N];
string s;
pll p[N];
void sol()
{
cin >> n;
for (int i = 1; i < n; i++)
{
int x, y;
cin >> x >> y;
adj[x].pb(y);
adj[y].pb(x);
++d[x];
++d[y];
}
cin >> s;
queue<int> q;
for(int i = 1; i <= n; i ++)if(d[i] == 1)q.push(i);
while(!q.empty())
{
int u = q.front();
q.pop();
if(s[u-1] == '1')
{
++ans;
continue;
}
for(int v: adj[u])
{
--d[v];
if(d[v] == 1)q.push(v);
}
}
cout << ans;
}
int main()
{
if (fopen(task ".in", "r"))
{
freopen(task ".in", "r", stdin);
freopen(task ".out", "w", stdout);
}
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int ntest = 1;
// cin >> ntest;
while (ntest-- > 0)
sol();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |