oj.uz

Submission #374714

# Submission time Handle Problem Language Result Execution time Memory
374714 2021-03-08T01:28:19 Z guka415 Mergers (JOI19_mergers) C++14
10 / 100
 196 ms 72412 KB 
#define fast ios::sync_with_stdio(false); cin.tie(0)
#define foru(i, k, n) for (int i = k; i < n; i++)
#define ford(i, k, n) for (int i = k; i >= n; i--)
#define pb push_back
#define mp make_pair

#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <bitset>

using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

template<class T>
struct rmq {
	vector<vector<T>> a;
	vector<int> logs;
	int dep, len;
	rmq(vector<T> arr) {
		len = arr.size();
		dep = 0;
		int tmp = len;
		while (tmp) {
			tmp >>= 1;
			dep++;
		}
		a.resize(dep);
		foru(i, 0, dep) {
			a[i].resize(len);
			for (int j = 0; j + (1 << i) <= len; j++) {
				if (!i)a[i][j] = arr[j];
				else a[i][j] = min(a[i - 1][j], a[i - 1][j + (1 << (i - 1))]);
			}
		}
		initLogs();
	}
	void initLogs() {
		logs.resize(len + 1);
		logs[1] = 0;
		foru(i, 2, len + 1)logs[i] = logs[i >> 1] + 1;
	}
	T query(int l, int r) {
		int mylen = logs[r - l + 1];
		return min(a[mylen][l], a[mylen][r - (1 << mylen) + 1]);
	}
};
struct lca {
	vector<vector<int>> adj;
	vector<int> appear;
	vector<pii> dep;
	rmq<pii>* tree;
	int sz;
	lca(vector<vector<int>> adjacency) {
		adj = adjacency;
		sz = adjacency.size();
		appear.resize(sz);
		dfsscan(0, -1, 0);
		tree = new rmq<pii>(dep);
	}
	void dfsscan(int src, int prev, int currdep) {
		appear[src] = dep.size();
		dep.pb(mp(currdep, src));
		for (auto x : adj[src]) {
			if (x == prev)continue;
			dfsscan(x, src, currdep + 1);
			dep.pb(mp(currdep, src));
		}
	}
	int query(int a, int b) {
		int x = min(appear[a], appear[b]), y = max(appear[a], appear[b]);
		return tree->query(x, y).second;
	}
};

const int sz = 5e5 + 5;
int cntreg[sz], reg[sz], reglca[sz], n, k, dep[sz];
vector<vector<int>> adj;
vector<int> myreg[sz];
bitset<sz> isFull, isUpFull;

void dfsdep(int src, int prv) {
	for (int x : adj[src]) {
		if (x != prv) {
			dep[x] = dep[src] + 1;
			dfsdep(x, src);
		}
	}
}

int dfs(int src, int prv) {
	int curmaxlca = reglca[reg[src]];
	for (int x : adj[src]) {
		if (x != prv) {
			int tmp = dfs(x, src);
			if (dep[tmp] < dep[curmaxlca])
				curmaxlca = tmp;
		}
	}
	isFull[src] = (curmaxlca == src);
	return curmaxlca;
}

bool dfs2(int src, int prv) {
	bool found = 0;
	for (int x : adj[src]) {
		if (x != prv)
			found |= dfs2(x, src);
	}
	isUpFull[src] = (!found&&isFull[src]);
	return found || isFull[src];
}

int main() {
	fast;
	cin >> n >> k;
	adj.resize(n);
	foru(i, 0, n - 1) {
		int x, y;
		cin >> x >> y;
		adj[--x].pb(--y);
		adj[y].pb(x);
	}
	foru(i, 0, n)
		cin >> reg[i], cntreg[reg[i]]++, myreg[reg[i]].pb(i);
	dfsdep(0, -1);
	lca tre(adj);
	for (int i = 1; i <= k; i++) {
		reglca[i] = myreg[i][0];
		for (int j = 1; j < myreg[i].size(); j++)
			reglca[i] = tre.query(reglca[i], myreg[i][j]);
	}
	dfs(0, -1);
	dfs2(0, -1);
	isUpFull[0] = 0;
	if (adj[0].size() == 1)
		isUpFull[0] = isFull[adj[0][0]];
	cout << (isUpFull.count() + 1) / 2 << '\n';
	return 0;
}

Compilation message

mergers.cpp: In function 'int main()':
mergers.cpp:135:21: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  135 |   for (int j = 1; j < myreg[i].size(); j++)
      |                   ~~^~~~~~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12140 KB Output is correct
2 Correct 8 ms 12140 KB Output is correct
3 Correct 8 ms 12140 KB Output is correct
4 Correct 9 ms 12160 KB Output is correct
5 Correct 9 ms 12160 KB Output is correct
6 Correct 8 ms 12140 KB Output is correct
7 Correct 10 ms 12140 KB Output is correct
8 Correct 9 ms 12140 KB Output is correct
9 Correct 8 ms 12140 KB Output is correct
10 Correct 8 ms 12140 KB Output is correct
11 Correct 8 ms 12140 KB Output is correct
12 Correct 9 ms 12160 KB Output is correct
13 Correct 8 ms 12140 KB Output is correct
14 Correct 8 ms 12140 KB Output is correct
15 Correct 9 ms 12160 KB Output is correct
16 Correct 9 ms 12152 KB Output is correct
17 Correct 9 ms 12140 KB Output is correct
18 Correct 9 ms 12140 KB Output is correct
19 Correct 9 ms 12140 KB Output is correct
20 Correct 8 ms 12140 KB Output is correct
21 Correct 9 ms 12140 KB Output is correct
22 Correct 9 ms 12140 KB Output is correct
23 Correct 9 ms 12140 KB Output is correct
24 Correct 9 ms 12140 KB Output is correct

Subtask #2
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12140 KB Output is correct
2 Correct 8 ms 12140 KB Output is correct
3 Correct 8 ms 12140 KB Output is correct
4 Correct 9 ms 12160 KB Output is correct
5 Correct 9 ms 12160 KB Output is correct
6 Correct 8 ms 12140 KB Output is correct
7 Correct 10 ms 12140 KB Output is correct
8 Correct 9 ms 12140 KB Output is correct
9 Correct 8 ms 12140 KB Output is correct
10 Correct 8 ms 12140 KB Output is correct
11 Correct 8 ms 12140 KB Output is correct
12 Correct 9 ms 12160 KB Output is correct
13 Correct 8 ms 12140 KB Output is correct
14 Correct 8 ms 12140 KB Output is correct
15 Correct 9 ms 12160 KB Output is correct
16 Correct 9 ms 12152 KB Output is correct
17 Correct 9 ms 12140 KB Output is correct
18 Correct 9 ms 12140 KB Output is correct
19 Correct 9 ms 12140 KB Output is correct
20 Correct 8 ms 12140 KB Output is correct
21 Correct 9 ms 12140 KB Output is correct
22 Correct 9 ms 12140 KB Output is correct
23 Correct 9 ms 12140 KB Output is correct
24 Correct 9 ms 12140 KB Output is correct
25 Correct 9 ms 12140 KB Output is correct
26 Correct 13 ms 13548 KB Output is correct
27 Correct 14 ms 13420 KB Output is correct
28 Correct 12 ms 13676 KB Output is correct
29 Correct 12 ms 13548 KB Output is correct
30 Correct 12 ms 13420 KB Output is correct
31 Correct 9 ms 12140 KB Output is correct
32 Correct 13 ms 13824 KB Output is correct
33 Correct 9 ms 12140 KB Output is correct
34 Correct 12 ms 13568 KB Output is correct
35 Correct 13 ms 13548 KB Output is correct
36 Incorrect 12 ms 13420 KB Output isn't correct
37 Halted 0 ms 0 KB -

Subtask #3
0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12140 KB Output is correct
2 Correct 8 ms 12140 KB Output is correct
3 Correct 8 ms 12140 KB Output is correct
4 Correct 9 ms 12160 KB Output is correct
5 Correct 9 ms 12160 KB Output is correct
6 Correct 8 ms 12140 KB Output is correct
7 Correct 10 ms 12140 KB Output is correct
8 Correct 9 ms 12140 KB Output is correct
9 Correct 8 ms 12140 KB Output is correct
10 Correct 8 ms 12140 KB Output is correct
11 Correct 8 ms 12140 KB Output is correct
12 Correct 9 ms 12160 KB Output is correct
13 Correct 8 ms 12140 KB Output is correct
14 Correct 8 ms 12140 KB Output is correct
15 Correct 9 ms 12160 KB Output is correct
16 Correct 9 ms 12152 KB Output is correct
17 Correct 9 ms 12140 KB Output is correct
18 Correct 9 ms 12140 KB Output is correct
19 Correct 9 ms 12140 KB Output is correct
20 Correct 8 ms 12140 KB Output is correct
21 Correct 9 ms 12140 KB Output is correct
22 Correct 9 ms 12140 KB Output is correct
23 Correct 9 ms 12140 KB Output is correct
24 Correct 9 ms 12140 KB Output is correct
25 Correct 9 ms 12140 KB Output is correct
26 Correct 128 ms 64988 KB Output is correct
27 Correct 167 ms 64004 KB Output is correct
28 Correct 12 ms 13420 KB Output is correct
29 Correct 9 ms 12140 KB Output is correct
30 Correct 9 ms 12140 KB Output is correct
31 Correct 162 ms 63836 KB Output is correct
32 Correct 12 ms 13548 KB Output is correct
33 Correct 190 ms 72412 KB Output is correct
34 Correct 167 ms 63972 KB Output is correct
35 Incorrect 12 ms 13420 KB Output isn't correct
36 Halted 0 ms 0 KB -

Subtask #4
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 129 ms 63472 KB Output is correct
2 Correct 143 ms 66656 KB Output is correct
3 Correct 12 ms 13548 KB Output is correct
4 Correct 12 ms 13420 KB Output is correct
5 Correct 9 ms 12140 KB Output is correct
6 Correct 9 ms 12140 KB Output is correct
7 Correct 11 ms 13548 KB Output is correct
8 Correct 196 ms 65632 KB Output is correct
9 Incorrect 12 ms 13420 KB Output isn't correct
10 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 12140 KB Output is correct
2 Correct 8 ms 12140 KB Output is correct
3 Correct 8 ms 12140 KB Output is correct
4 Correct 9 ms 12160 KB Output is correct
5 Correct 9 ms 12160 KB Output is correct
6 Correct 8 ms 12140 KB Output is correct
7 Correct 10 ms 12140 KB Output is correct
8 Correct 9 ms 12140 KB Output is correct
9 Correct 8 ms 12140 KB Output is correct
10 Correct 8 ms 12140 KB Output is correct
11 Correct 8 ms 12140 KB Output is correct
12 Correct 9 ms 12160 KB Output is correct
13 Correct 8 ms 12140 KB Output is correct
14 Correct 8 ms 12140 KB Output is correct
15 Correct 9 ms 12160 KB Output is correct
16 Correct 9 ms 12152 KB Output is correct
17 Correct 9 ms 12140 KB Output is correct
18 Correct 9 ms 12140 KB Output is correct
19 Correct 9 ms 12140 KB Output is correct
20 Correct 8 ms 12140 KB Output is correct
21 Correct 9 ms 12140 KB Output is correct
22 Correct 9 ms 12140 KB Output is correct
23 Correct 9 ms 12140 KB Output is correct
24 Correct 9 ms 12140 KB Output is correct
25 Correct 9 ms 12140 KB Output is correct
26 Correct 13 ms 13548 KB Output is correct
27 Correct 14 ms 13420 KB Output is correct
28 Correct 12 ms 13676 KB Output is correct
29 Correct 12 ms 13548 KB Output is correct
30 Correct 12 ms 13420 KB Output is correct
31 Correct 9 ms 12140 KB Output is correct
32 Correct 13 ms 13824 KB Output is correct
33 Correct 9 ms 12140 KB Output is correct
34 Correct 12 ms 13568 KB Output is correct
35 Correct 13 ms 13548 KB Output is correct
36 Incorrect 12 ms 13420 KB Output isn't correct
37 Halted 0 ms 0 KB -