oj.uz

Submission #379759

# Submission time Handle Problem Language Result Execution time Memory
379759 2021-03-19T08:46:22 Z cgiosy Mergers (JOI19_mergers) C++17
0 / 100
 55 ms 7396 KB 
#include <bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(0);cin.tie(0);
	int N, M, ans=0, t=0, r=0;
	cin>>N>>M;
	vector<int> C(N), L(M), R(M);
	vector<vector<int>> G(N);
	for(int i=1; i<N; i++) {
		int x, y;
		cin>>x>>y; --x, --y;
		G[x].push_back(y);
		G[y].push_back(x);
	}
	for(int i=0; i<N; i++) cin>>C[i], --C[i], r=G[r].size()<G[i].size() ? r : i;

	function<void(int, int)> f=[&](int i, int p) {
		++t;
		L[C[i]]=L[C[i]]?:t;
		for(int j:G[i]) if(j!=p) f(j, i);
		R[C[i]]=t;
	};
	f(r, r);

	t=0;
	function<pair<int, int>(int, int)> g=[&](int i, int p) {
		++t;
		int a=L[C[i]], b=R[C[i]], s=t;
		for(int j:G[i]) if(j!=p) {
			auto[c,d]=g(j, i);
			a=min(a, c);
			b=max(b, d);
		}
		if(s==a && b==t) ans++, a=0;
		return make_pair(a, b);
	};
	g(r, r);

	cout<<ans/2<<'\n';
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 50 ms 6628 KB Output is correct
2 Incorrect 55 ms 7396 KB Output isn't correct
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Incorrect 1 ms 364 KB Output isn't correct
3 Halted 0 ms 0 KB -