# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
533341 | qwerasdfzxcl | Cats or Dogs (JOI18_catdog) | C++14 | 0 ms | 0 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>
typedef long long ll;
using namespace std;
constexpr int INF = 1e9;
vector<int> adj[100100];
int c[100100], dp[100100][2];
void dfs(int s, int pa = -1){
dp[s][0] = dp[s][1] = 0;
for (auto &v:adj[s]) if (v!=pa) dfs(v, s);
if (c[s]!=1){
for (auto &v:adj[s]) if (v!=pa){
dp[s][0] += min(dp[v][0], dp[v][1] + 1);
}
}
else dp[s][0] = INF;
if (c[s]!=0){
for (auto &v:adj[s]) if (v!=pa){
dp[s][1] += min(dp[v][1], dp[v][0] + 1);
}
}
else dp[s][1] = INF;
}
int main(){
int n, q;
scanf("%d", &n);
for (int i=0;i<n-1;i++){
int x, y;
scanf("%d %d", &x, &y);
adj[x].push_back(y);
adj[y].push_back(x);
}
fill(c+1, c+n+1, -1);
scanf("%d", &q);
while(q--){
int op, x;
scanf("%d %d", &op, &x);
if (op==1) c[x] = 1;
else if (op==2) c[x] = 0;
else c[x] = -1;
dfs(1);
printf("%d\n", min(dp[1][0], dp[1][1]));
}
return 0;
}