#include<bits/stdc++.h>
#define fi first
#define se second
#define endl "\n"
#define ii pair<int, int>
using namespace std;
const int N = 1e5 + 10;
int n;
bool bug;
vector<int> adj[N];
int f[N], g[N], a[N];
void dfs(int u, int par) {
f[u] = g[u] = 0;
if (a[u] == 1) f[u] = 1e9;
if (a[u] == 2) g[u] = 1e9;
// if (bug && u == 2) {
// cout << f[u] << " " << g[y] << endl
// }
for(int &v : adj[u]) if (v != par) {
dfs(v, u);
f[u] += min(f[v], g[v] + 1);
g[u] += min(g[v], f[v] + 1);
}
}
void initialize (int N, vector<int> A, vector<int> B) {
n = N;
for(int i = 0; i < n - 1; i++) {
adj[A[i]].push_back(B[i]);
adj[B[i]].push_back(A[i]);
}
}
int cat(int v) {
a[v] = 1;
dfs(1, 0);
return min(f[1], g[1]);
}
int dog(int v) {
a[v] = 2;
bug = 1;
dfs(1, 0);
return min(f[1], g[1]);
}
int neighbor(int v) {
a[v] = 0;
dfs(1, 0);
return min(f[1], g[1]);
}
#ifdef ngu
int main() {
freopen ("task.inp", "r", stdin);
freopen ("task.out", "w", stdout);
int n; cin >> n;
vector<int> a(n - 1), b(n - 1);
for(int i = 0; i < n - 1; i++) cin >> a[i] >> b[i];
initialize(n, a, b);
int q; cin >> q;
while (q--) {
int t, v; cin >> t >> v;
if (t == 1) cout << cat(v);
if (t == 2) cout << dog(v);
if (t == 3) cout << neighbor(v);
cout << endl;
}
}
#endif // ngu
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3672 KB |
Output is correct |
2 |
Correct |
1 ms |
3676 KB |
Output is correct |
3 |
Correct |
1 ms |
3780 KB |
Output is correct |
4 |
Correct |
1 ms |
3780 KB |
Output is correct |
5 |
Correct |
1 ms |
3932 KB |
Output is correct |
6 |
Correct |
1 ms |
3672 KB |
Output is correct |
7 |
Correct |
1 ms |
3676 KB |
Output is correct |
8 |
Correct |
1 ms |
3676 KB |
Output is correct |
9 |
Correct |
1 ms |
3672 KB |
Output is correct |
10 |
Correct |
1 ms |
3676 KB |
Output is correct |
11 |
Correct |
1 ms |
3676 KB |
Output is correct |
12 |
Correct |
1 ms |
3676 KB |
Output is correct |
13 |
Correct |
1 ms |
3676 KB |
Output is correct |
14 |
Correct |
2 ms |
3676 KB |
Output is correct |
15 |
Correct |
2 ms |
3676 KB |
Output is correct |
16 |
Correct |
1 ms |
3784 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3672 KB |
Output is correct |
2 |
Correct |
1 ms |
3676 KB |
Output is correct |
3 |
Correct |
1 ms |
3780 KB |
Output is correct |
4 |
Correct |
1 ms |
3780 KB |
Output is correct |
5 |
Correct |
1 ms |
3932 KB |
Output is correct |
6 |
Correct |
1 ms |
3672 KB |
Output is correct |
7 |
Correct |
1 ms |
3676 KB |
Output is correct |
8 |
Correct |
1 ms |
3676 KB |
Output is correct |
9 |
Correct |
1 ms |
3672 KB |
Output is correct |
10 |
Correct |
1 ms |
3676 KB |
Output is correct |
11 |
Correct |
1 ms |
3676 KB |
Output is correct |
12 |
Correct |
1 ms |
3676 KB |
Output is correct |
13 |
Correct |
1 ms |
3676 KB |
Output is correct |
14 |
Correct |
2 ms |
3676 KB |
Output is correct |
15 |
Correct |
2 ms |
3676 KB |
Output is correct |
16 |
Correct |
1 ms |
3784 KB |
Output is correct |
17 |
Correct |
6 ms |
3676 KB |
Output is correct |
18 |
Correct |
7 ms |
3676 KB |
Output is correct |
19 |
Correct |
4 ms |
3676 KB |
Output is correct |
20 |
Correct |
1 ms |
3676 KB |
Output is correct |
21 |
Correct |
2 ms |
3676 KB |
Output is correct |
22 |
Correct |
2 ms |
3676 KB |
Output is correct |
23 |
Correct |
8 ms |
3676 KB |
Output is correct |
24 |
Correct |
7 ms |
3676 KB |
Output is correct |
25 |
Correct |
3 ms |
3676 KB |
Output is correct |
26 |
Correct |
2 ms |
3676 KB |
Output is correct |
27 |
Correct |
2 ms |
3676 KB |
Output is correct |
28 |
Correct |
3 ms |
3676 KB |
Output is correct |
29 |
Correct |
10 ms |
3792 KB |
Output is correct |
30 |
Correct |
2 ms |
3676 KB |
Output is correct |
31 |
Correct |
2 ms |
3788 KB |
Output is correct |
32 |
Correct |
3 ms |
3676 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
3672 KB |
Output is correct |
2 |
Correct |
1 ms |
3676 KB |
Output is correct |
3 |
Correct |
1 ms |
3780 KB |
Output is correct |
4 |
Correct |
1 ms |
3780 KB |
Output is correct |
5 |
Correct |
1 ms |
3932 KB |
Output is correct |
6 |
Correct |
1 ms |
3672 KB |
Output is correct |
7 |
Correct |
1 ms |
3676 KB |
Output is correct |
8 |
Correct |
1 ms |
3676 KB |
Output is correct |
9 |
Correct |
1 ms |
3672 KB |
Output is correct |
10 |
Correct |
1 ms |
3676 KB |
Output is correct |
11 |
Correct |
1 ms |
3676 KB |
Output is correct |
12 |
Correct |
1 ms |
3676 KB |
Output is correct |
13 |
Correct |
1 ms |
3676 KB |
Output is correct |
14 |
Correct |
2 ms |
3676 KB |
Output is correct |
15 |
Correct |
2 ms |
3676 KB |
Output is correct |
16 |
Correct |
1 ms |
3784 KB |
Output is correct |
17 |
Correct |
6 ms |
3676 KB |
Output is correct |
18 |
Correct |
7 ms |
3676 KB |
Output is correct |
19 |
Correct |
4 ms |
3676 KB |
Output is correct |
20 |
Correct |
1 ms |
3676 KB |
Output is correct |
21 |
Correct |
2 ms |
3676 KB |
Output is correct |
22 |
Correct |
2 ms |
3676 KB |
Output is correct |
23 |
Correct |
8 ms |
3676 KB |
Output is correct |
24 |
Correct |
7 ms |
3676 KB |
Output is correct |
25 |
Correct |
3 ms |
3676 KB |
Output is correct |
26 |
Correct |
2 ms |
3676 KB |
Output is correct |
27 |
Correct |
2 ms |
3676 KB |
Output is correct |
28 |
Correct |
3 ms |
3676 KB |
Output is correct |
29 |
Correct |
10 ms |
3792 KB |
Output is correct |
30 |
Correct |
2 ms |
3676 KB |
Output is correct |
31 |
Correct |
2 ms |
3788 KB |
Output is correct |
32 |
Correct |
3 ms |
3676 KB |
Output is correct |
33 |
Execution timed out |
3047 ms |
7772 KB |
Time limit exceeded |
34 |
Halted |
0 ms |
0 KB |
- |