Submission #379747

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
379747	2021-03-19T08:21:40 Z	cgiosy	Mergers (JOI19_mergers)	C++17	0 / 100	52 ms	7780 KB

mergers

#include <bits/stdc++.h>
using namespace std;

int main() {
	ios::sync_with_stdio(0);cin.tie(0);
	int N, M, ans=1, t=0;
	cin>>N>>M;
	vector<int> C(N), S(N), L(M, 0x3f3f3f3f), 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);
	}

	function<void(int, int)> f1=[&](int i, int p) {
		S[i]=++t;
		for(int j:G[i]) if(j!=p) f1(j, i);
	};
	f1(0, 0);

	for(int i=0; i<N; i++) {
		cin>>C[i], --C[i];
		L[C[i]]=min(L[C[i]], S[i]);
		R[C[i]]=max(R[C[i]], S[i]);
	}

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

	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	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Incorrect	1 ms	364 KB	Output isn't correct
17	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	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Incorrect	1 ms	364 KB	Output isn't correct
17	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	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Incorrect	1 ms	364 KB	Output isn't correct
17	Halted	0 ms	0 KB	-

Subtask #4

0 / 22.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	52 ms	7012 KB	Output is correct
2	Incorrect	52 ms	7780 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	Correct	1 ms	364 KB	Output is correct
3	Correct	1 ms	384 KB	Output is correct
4	Correct	1 ms	364 KB	Output is correct
5	Correct	1 ms	364 KB	Output is correct
6	Correct	1 ms	364 KB	Output is correct
7	Correct	1 ms	364 KB	Output is correct
8	Correct	1 ms	384 KB	Output is correct
9	Correct	1 ms	364 KB	Output is correct
10	Correct	1 ms	364 KB	Output is correct
11	Correct	1 ms	364 KB	Output is correct
12	Correct	1 ms	364 KB	Output is correct
13	Correct	1 ms	364 KB	Output is correct
14	Correct	1 ms	364 KB	Output is correct
15	Correct	1 ms	364 KB	Output is correct
16	Incorrect	1 ms	364 KB	Output isn't correct
17	Halted	0 ms	0 KB	-