oj.uz

답안 #1049544

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1049544 2024-08-08T21:55:00 Z 0npata Sprinkler (JOI22_sprinkler) C++17
3 / 100
 4000 ms 747504 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
#define vec vector
#define hmap unordered_map

const int MXN = 200'005;
int N, L;
int H[MXN];

bool is_centr[MXN*3];
vec<int> tree[MXN*3];
set<int> tree_i[MXN*3];
int fi = MXN;
bool wn[MXN*3];

const int weight(int u, int v) {
	if(u>v)  swap(u, v);
	if(v < MXN) return 1;
	if(u >= MXN) return 0;
	return wn[v];
}

struct SegNode {
	int mul = 1;

	SegNode merge(SegNode other) {
		//cerr << mul << ' ' << other.mul << '\n';
		return {(mul * other.mul) % L};
	}
};


// retrieves multiple of range mod L
// point update multiply one value
struct SegTree {
	vec<SegNode> data;
	int n;
	SegTree(int in) {
		n = 1;
		while(n < in) n*=2;
		data = vec<SegNode>(n*2);
	}
	void upd(int i, SegNode val) {
		assert(i<n && i>=0);
		i += n;
		//cerr << "SZ: " << data.size() << ' ' << i <<  '\n';

		data[i] = data[i].merge(val);
		while(i > 1) {
			i /= 2;
			data[i] = data[i*2].merge(data[i*2+1]);
		}
	}

	SegNode query_suffix(int l) {
		assert(l<n && l >= 0);
		return _query_suffix(l, n, 1, 0, n);
	}
	SegNode _query_suffix(int l, int r, int ti, int tl, int tr) {
		if(l >= tr || r <= tl) {
			return {};
		}
		if(l <= tl && r >= tr) {
			return data[ti];
		}
		int tm = (tl + tr)/2;
		return _query_suffix(l, r, ti*2, tl, tm).merge(_query_suffix(l, r, ti*2+1, tm, tr));
	}
};

struct Centroid {
	vec<SegTree> subtree_contrs{};
	hmap<int, int> subtree_inds;
	hmap<int, int> dists;
	int root;
	int size;
	SegTree contr;

	Centroid() : contr(1) {}

	Centroid(int root, int size) : root(root), size(size), contr(size+1) {
		is_centr[root] = true;
		subtree_inds[root] = -1;
		if(root < N) contr.upd(0, {H[root]});
		dists[root] = 0;

		int si = 0;
		for(int u : tree[root]) {
			if(is_centr[u]) continue;

			subtree_contrs.push_back(SegTree(size+1));
			dfs_init(u, root, weight(u, root), si++);
		}
	}

	void dfs_init(int u, int p, int d, int s_i) {
		if(is_centr[u]) return;
		subtree_inds[u] = s_i;
		dists[u] = d;
		for(int v : tree[u]) {
			if(v == p) continue;
			dfs_init(v, u, d+weight(v, u), s_i);
		}
	}
};

Centroid centroids[MXN*3];
int centroid_pars[MXN*3];
int subtree_sz[MXN*3];

void comp_subtree_sz(int u, int p = -1) {
	if(is_centr[u]) {
		subtree_sz[u] = 0;
		return;
	}
	subtree_sz[u] = 1;
	for(int v : tree[u]) {
		if(v == p) continue;
		comp_subtree_sz(v, u);
		subtree_sz[u] += subtree_sz[v];
	}
}

int find_centroid(int u, int p, int mxsz) {
	for(int v : tree[u]) {
		if(v == p) continue;
		if(subtree_sz[v] > mxsz) return find_centroid(v, u, mxsz);
	}
	return u;
}

void decompose(int u, int p = -1) {
	if(is_centr[u]) return;
	comp_subtree_sz(u);
	int v = find_centroid(u, -1, subtree_sz[u]/2);
	///cerr << "initializing centroid: " << v << '\n';
	centroid_pars[v] = p;
	centroids[v] = Centroid(v, subtree_sz[u]);
	for(int w : tree[v]) {
		decompose(w, v);
	}
}

void make_tree_binary(int u, int p = -1) {
	vec<int> ch{};
	for(int v : tree_i[u]) {
		if(v==p) continue;
		ch.push_back(v);
	}
	if(ch.size() > 2) {
		int p2 = 1;
		while(p2 < ch.size()) {
			p2 *= 2;
		}
		int root = fi;
		tree_i[u].insert(root);
		tree_i[root].insert(u);
		for(int i = 2; i<p2; i++) {
			tree_i[i/2+fi-1].insert(i+fi-1);
			tree_i[i+fi-1].insert(i/2+fi-1);
		}
		for(int i = p2; i<p2+ch.size(); i++) {
			tree_i[i/2+fi-1].insert(ch[i-p2]);
			tree_i[ch[i-p2]].insert(i/2+fi-1);
			wn[i/2+fi-1] = 1;
			tree_i[ch[i-p2]].erase(u);
			tree_i[u].erase(ch[i-p2]);
		}
		fi += p2-1;
	}
	for(int v : tree[u]) {
		if(v == p) continue;
		make_tree_binary(v, u);
	}
}



int32_t main() {
	cin >> N >> L;
	for(int i = 0; i<N-1; i++) {
		int u, v;
		cin >> u >> v;
		u--;v--;
		tree_i[u].insert(v);
		tree_i[v].insert(u);
	}
	for(int i = 0; i<N; i++) {
		cin >> H[i];
	}

	make_tree_binary(0);
	if(false) {
	for(int i = 0; i<MXN*3; i++) {
		if(tree[i].size() > 0) {
			cerr << i << ":" << ' ';
			for(int v : tree[i]) cerr << v << ' ';
			cerr << '\n';
		}
	}
	}
	for(int i = 0; i<MXN*3; i++) {
		tree[i] = vec<int>(tree_i[i].begin(), tree_i[i].end());
	}


	decompose(0);


	int Q;
	cin >> Q;
	while(Q--) {
	//cerr << "HERE0" << '\n';
		int t;
		cin >> t;
		if(t == 2) {
		//cerr << "Here1" << '\n';
			int u;
			cin >> u;
			u--;
			int ans = 1;
			int ci = u;
			auto mult_ans = [&](int val) {
				ans *= val;
				ans %= L;
			};
			while(ci != -1) {
				int d = centroids[ci].dists[u];
				mult_ans(centroids[ci].contr.query_suffix(d).mul);

				for(int i = 0; i<centroids[ci].subtree_contrs.size(); i++) {
					if(centroids[ci].subtree_inds[u] != i) {
						mult_ans(centroids[ci].subtree_contrs[i].query_suffix(d).mul);
					}
				}

				ci = centroid_pars[ci];
				//cerr << ci << '\n';
			};
			cout << ans << '\n';
		}
		else {
			//cerr <<"HERE2" << '\n';
			int u, d, w;
			cin >> u >> d >> w;
			u--;
			centroids[u].contr.upd(min(centroids[u].contr.n-1, d), {w});
			int ci = centroid_pars[u];
			while(ci != -1) {
				//cerr << "Cur Centroid: " << ci << '\n';
				auto& c = centroids[ci];
				int contr_d = d - c.dists[u];
				if(contr_d < 0) {
					ci = centroid_pars[ci];
					continue;
				}
				auto& st = c.subtree_contrs[c.subtree_inds[u]];
				contr_d = min(contr_d, st.n-1);
				//cerr << st.n << '\n';
				st.upd(contr_d, {w});

				ci = centroid_pars[ci];
				//cerr << ci << '\n';
			}
		}
	}


}

Compilation message

sprinkler.cpp: In function 'void make_tree_binary(long long int, long long int)':
sprinkler.cpp:154:12: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  154 |   while(p2 < ch.size()) {
      |         ~~~^~~~~~~~~~~
sprinkler.cpp:164:20: warning: comparison of integer expressions of different signedness: 'long long int' and 'long long unsigned int' [-Wsign-compare]
  164 |   for(int i = p2; i<p2+ch.size(); i++) {
      |                   ~^~~~~~~~~~~~~
sprinkler.cpp: In function 'int32_t main()':
sprinkler.cpp:233:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<SegTree>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  233 |     for(int i = 0; i<centroids[ci].subtree_contrs.size(); i++) {
      |                    ~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 174932 KB Output is correct
2 Correct 37 ms 174928 KB Output is correct
3 Correct 43 ms 175044 KB Output is correct
4 Correct 42 ms 176724 KB Output is correct
5 Correct 41 ms 176468 KB Output is correct
6 Correct 43 ms 176464 KB Output is correct
7 Correct 41 ms 176860 KB Output is correct
8 Correct 88 ms 191688 KB Output is correct
9 Correct 38 ms 175192 KB Output is correct
10 Correct 37 ms 174936 KB Output is correct
11 Correct 38 ms 174932 KB Output is correct
12 Correct 38 ms 175140 KB Output is correct
13 Correct 38 ms 174928 KB Output is correct
14 Correct 41 ms 174936 KB Output is correct
15 Correct 38 ms 174936 KB Output is correct
16 Correct 38 ms 175196 KB Output is correct
17 Correct 38 ms 174932 KB Output is correct
18 Correct 41 ms 174932 KB Output is correct
19 Correct 38 ms 174936 KB Output is correct
20 Correct 38 ms 174976 KB Output is correct
21 Correct 39 ms 174932 KB Output is correct
22 Correct 38 ms 174928 KB Output is correct
23 Correct 39 ms 175076 KB Output is correct
24 Correct 42 ms 174932 KB Output is correct
25 Correct 40 ms 175188 KB Output is correct
26 Correct 38 ms 174932 KB Output is correct
27 Correct 38 ms 175196 KB Output is correct
28 Correct 38 ms 174928 KB Output is correct

Subtask #2
0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 174932 KB Output is correct
2 Execution timed out 4037 ms 728056 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #3
0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 174932 KB Output is correct
2 Execution timed out 4037 ms 728056 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 174940 KB Output is correct
2 Execution timed out 4077 ms 747504 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 174932 KB Output is correct
2 Execution timed out 4080 ms 744572 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 174932 KB Output is correct
2 Correct 37 ms 174928 KB Output is correct
3 Correct 43 ms 175044 KB Output is correct
4 Correct 42 ms 176724 KB Output is correct
5 Correct 41 ms 176468 KB Output is correct
6 Correct 43 ms 176464 KB Output is correct
7 Correct 41 ms 176860 KB Output is correct
8 Correct 88 ms 191688 KB Output is correct
9 Correct 38 ms 175192 KB Output is correct
10 Correct 37 ms 174936 KB Output is correct
11 Correct 38 ms 174932 KB Output is correct
12 Correct 38 ms 175140 KB Output is correct
13 Correct 38 ms 174928 KB Output is correct
14 Correct 41 ms 174936 KB Output is correct
15 Correct 38 ms 174936 KB Output is correct
16 Correct 38 ms 175196 KB Output is correct
17 Correct 38 ms 174932 KB Output is correct
18 Correct 41 ms 174932 KB Output is correct
19 Correct 38 ms 174936 KB Output is correct
20 Correct 38 ms 174976 KB Output is correct
21 Correct 39 ms 174932 KB Output is correct
22 Correct 38 ms 174928 KB Output is correct
23 Correct 39 ms 175076 KB Output is correct
24 Correct 42 ms 174932 KB Output is correct
25 Correct 40 ms 175188 KB Output is correct
26 Correct 38 ms 174932 KB Output is correct
27 Correct 38 ms 175196 KB Output is correct
28 Correct 38 ms 174928 KB Output is correct
29 Correct 38 ms 174932 KB Output is correct
30 Execution timed out 4037 ms 728056 KB Time limit exceeded
31 Halted 0 ms 0 KB -