oj.uz

답안 #680082

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
680082 2023-01-09T21:32:23 Z SanguineChameleon Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 3351 ms 168956 KB 
// BEGIN BOILERPLATE CODE

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

#ifdef KAMIRULEZ
	const bool kami_loc = true;
	const long long kami_seed = 69420;
#else
	const bool kami_loc = false;
	const long long kami_seed = chrono::steady_clock::now().time_since_epoch().count();
#endif

const string kami_fi = "kamirulez.inp";
const string kami_fo = "kamirulez.out";
mt19937_64 kami_gen(kami_seed);

long long rand_range(long long rmin, long long rmax) {
	uniform_int_distribution<long long> rdist(rmin, rmax);
	return rdist(kami_gen);
}

long double rand_real(long double rmin, long double rmax) {
	uniform_real_distribution<long double> rdist(rmin, rmax);
	return rdist(kami_gen);
}

void file_io(string fi, string fo) {
	if (fi != "" && (!kami_loc || fi == kami_fi)) {
		freopen(fi.c_str(), "r", stdin);
	}
	if (fo != "" && (!kami_loc || fo == kami_fo)) {
		freopen(fo.c_str(), "w", stdout);
	}
}

void set_up() {
	if (kami_loc) {
		file_io(kami_fi, kami_fo);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(0);
}

void just_do_it();

void just_exec_it() {
	if (kami_loc) {
		auto pstart = chrono::steady_clock::now();
		just_do_it();
		auto pend = chrono::steady_clock::now();
		long long ptime = chrono::duration_cast<chrono::milliseconds>(pend - pstart).count();
		string bar(50, '=');
		cout << '\n' << bar << '\n';
		cout << "Time: " << ptime << " ms" << '\n';
	}
	else {
		just_do_it();
	}
}

int main() {
	set_up();
	just_exec_it();
	return 0;
}

// END BOILERPLATE CODE

// BEGIN MAIN CODE

struct range {
	int root = 0;
	int pos = 0;
	int lt = 0;
	int rt = 0;

	range() {

	}

	range(int _root, int _pos, int _lt, int _rt) {
		root = _root;
		pos = _pos;
		lt = _lt;
		rt = _rt;
	}
};

struct tree {
	vector<long long> tr;
	vector<long long> lz;
	int n = 0;

	tree() {

	}

	tree(int _n) {
		n = _n;
		tr.resize(n << 2);
		lz.resize(n << 2);
	}

	void push(int cc) {
		tr[cc << 1] += lz[cc];
		lz[cc << 1] += lz[cc];
		tr[cc << 1 | 1] += lz[cc];
		lz[cc << 1 | 1] += lz[cc];
		lz[cc] = 0;
	}

	void update(int cc, int lt, int rt, int ql, int qr, long long pp) {
		if (lt == ql && rt == qr) {
			tr[cc] += pp;
			lz[cc] += pp;
			return;
		}
		push(cc);
		int mt = (lt + rt) / 2;
		if (qr <= mt) {
			update(cc << 1, lt, mt, ql, qr, pp);
		}
		else if (ql >= mt + 1) {
			update(cc << 1 | 1, mt + 1, rt, ql, qr, pp);
		}
		else {
			update(cc << 1, lt, mt, ql, mt, pp);
			update(cc << 1 | 1, mt + 1, rt, mt + 1, qr, pp);
		}
		tr[cc] = max(tr[cc << 1], tr[cc << 1 | 1]);
	}
};

const int ms = 1e5 + 20;
bool f[ms];
int sz[ms];
long long W[ms];
vector<pair<int, int>> adj[ms];
int pt[ms][2];
int tz;
multiset<long long, greater<long long>> S;
multiset<long long, greater<long long>> best[ms];
vector<range> R[ms];
vector<tree> T[ms];

void dfs1(int u, int pr) {
	sz[u] = 1;
	for (auto x: adj[u]) {
		int v = x.first;
		if (!f[v] && v != pr) {
			dfs1(v, u);
			sz[u] += sz[v];
		}
	}
}

int ctr(int u, int pr, int root) {
	for (auto x: adj[u]) {
		int v = x.first;
		if (!f[v] && v != pr) {
			if (sz[v] * 2 > sz[root]) {
				return ctr(v, u, root);
			}
		}
	}
	return u;
}

void dfs2(int u, int pr, int root, int pos) {
	pt[u][0] = ++tz;
	sz[u] = 1;
	for (auto x: adj[u]) {
		int v = x.first;
		int id = x.second;
		if (!f[v] && v != pr) {
			dfs2(v, u, root, pos);
			R[id].emplace_back(root, pos, pt[v][0], pt[v][1]);
			sz[u] += sz[v];
		}
	}
	pt[u][1] = tz;
}

void build(int u) {
	dfs1(u, -1);
	u = ctr(u, -1, u);
	f[u] = true;
	int cnt = 0;
	for (auto x: adj[u]) {
		int v = x.first;
		int id = x.second;
		if (!f[v]) {
			tz = 0;
			dfs2(v, -1, u, cnt);
			R[id].emplace_back(u, cnt, pt[v][0], pt[v][1]);
			cnt++;
			T[u].emplace_back(sz[v]);
			best[u].insert(0);
		}
	}
	for (auto x: adj[u]) {
		int v = x.first;
		if (!f[v]) {
			build(v);
		}
	}
}

long long get(int u) {
	long long res = 0;
	auto it = best[u].begin();
	if (it == best[u].end()) {
		return res;
	}
	res += (*it);
	it++;
	if (it == best[u].end()) {
		return res;
	}
	res += (*it);
	return res;
}

void update(range r, long long pp) {
	int root = r.root;
	int pos = r.pos;
	int lt = r.lt;
	int rt = r.rt;
	S.erase(S.find(get(root)));
	tree &t = T[root][pos];
	best[root].erase(best[root].find(t.tr[1]));
	t.update(1, 1, t.n, lt, rt, pp);
	best[root].insert(t.tr[1]);
	S.insert(get(root));
}


void just_do_it() {
	int n, q;
	long long lim;
	cin >> n >> q >> lim;
	for (int i = 0; i < n; i++) {
		S.insert(0);
	}
	for (int i = 0; i < n - 1; i++) {
		int u, v;
		cin >> u >> v >> W[i];
		adj[u].emplace_back(v, i);
		adj[v].emplace_back(u, i);
	}
	build(1);
	for (int i = 0; i < n - 1; i++) {
		for (auto r: R[i]) {
			update(r, W[i]);
		}
	}
	long long res = 0;
	for (int i = 0; i < q; i++) {
		int id;
		long long w;
		cin >> id >> w;
		id = (res + id) % (n - 1);
		w = (res + w) % lim;
		for (auto r: R[id]) {
			update(r, w - W[id]);
		}
		W[id] = w;
		res = *S.begin();
		cout << res << '\n';
	}
}

// END MAIN CODE

Compilation message

diameter.cpp: In function 'void file_io(std::string, std::string)':
diameter.cpp:30:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   30 |   freopen(fi.c_str(), "r", stdin);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:33:10: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   33 |   freopen(fo.c_str(), "w", stdout);
      |   ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 8 ms 12084 KB Output is correct
4 Correct 8 ms 11996 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 9 ms 12064 KB Output is correct
7 Correct 7 ms 12016 KB Output is correct
8 Correct 7 ms 12084 KB Output is correct
9 Correct 6 ms 12084 KB Output is correct
10 Correct 6 ms 12116 KB Output is correct
11 Correct 7 ms 12076 KB Output is correct
12 Correct 6 ms 12116 KB Output is correct
13 Correct 7 ms 12076 KB Output is correct
14 Correct 6 ms 12116 KB Output is correct
15 Correct 7 ms 12076 KB Output is correct
16 Correct 8 ms 12032 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 7 ms 12076 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 8 ms 12084 KB Output is correct
4 Correct 8 ms 11996 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 9 ms 12064 KB Output is correct
7 Correct 7 ms 12016 KB Output is correct
8 Correct 7 ms 12084 KB Output is correct
9 Correct 6 ms 12084 KB Output is correct
10 Correct 6 ms 12116 KB Output is correct
11 Correct 7 ms 12076 KB Output is correct
12 Correct 6 ms 12116 KB Output is correct
13 Correct 7 ms 12076 KB Output is correct
14 Correct 6 ms 12116 KB Output is correct
15 Correct 7 ms 12076 KB Output is correct
16 Correct 8 ms 12032 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 7 ms 12076 KB Output is correct
19 Correct 18 ms 12820 KB Output is correct
20 Correct 19 ms 12860 KB Output is correct
21 Correct 21 ms 12988 KB Output is correct
22 Correct 23 ms 13116 KB Output is correct
23 Correct 40 ms 15956 KB Output is correct
24 Correct 48 ms 16852 KB Output is correct
25 Correct 55 ms 17484 KB Output is correct
26 Correct 62 ms 18404 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 6 ms 11988 KB Output is correct
3 Correct 7 ms 12092 KB Output is correct
4 Correct 14 ms 12244 KB Output is correct
5 Correct 44 ms 13208 KB Output is correct
6 Correct 6 ms 11988 KB Output is correct
7 Correct 7 ms 12244 KB Output is correct
8 Correct 7 ms 12244 KB Output is correct
9 Correct 8 ms 12292 KB Output is correct
10 Correct 16 ms 12504 KB Output is correct
11 Correct 53 ms 13660 KB Output is correct
12 Correct 12 ms 13780 KB Output is correct
13 Correct 12 ms 13784 KB Output is correct
14 Correct 13 ms 13808 KB Output is correct
15 Correct 23 ms 14096 KB Output is correct
16 Correct 69 ms 15312 KB Output is correct
17 Correct 159 ms 46640 KB Output is correct
18 Correct 163 ms 46660 KB Output is correct
19 Correct 160 ms 46680 KB Output is correct
20 Correct 187 ms 46868 KB Output is correct
21 Correct 351 ms 48252 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 12884 KB Output is correct
2 Correct 24 ms 13028 KB Output is correct
3 Correct 87 ms 13588 KB Output is correct
4 Correct 158 ms 14200 KB Output is correct
5 Correct 59 ms 23812 KB Output is correct
6 Correct 86 ms 23896 KB Output is correct
7 Correct 199 ms 24548 KB Output is correct
8 Correct 339 ms 25512 KB Output is correct
9 Correct 368 ms 78768 KB Output is correct
10 Correct 416 ms 78924 KB Output is correct
11 Correct 618 ms 79588 KB Output is correct
12 Correct 868 ms 80380 KB Output is correct
13 Correct 843 ms 151856 KB Output is correct
14 Correct 876 ms 151980 KB Output is correct
15 Correct 1226 ms 152668 KB Output is correct
16 Correct 1462 ms 153516 KB Output is correct
17 Correct 2309 ms 153512 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2346 ms 129076 KB Output is correct
2 Correct 2391 ms 132604 KB Output is correct
3 Correct 2362 ms 131820 KB Output is correct
4 Correct 2375 ms 132136 KB Output is correct
5 Correct 2222 ms 126312 KB Output is correct
6 Correct 1621 ms 93376 KB Output is correct
7 Correct 3294 ms 157564 KB Output is correct
8 Correct 3231 ms 157320 KB Output is correct
9 Correct 3216 ms 157372 KB Output is correct
10 Correct 3271 ms 156900 KB Output is correct
11 Correct 3030 ms 149480 KB Output is correct
12 Correct 2227 ms 106476 KB Output is correct
13 Correct 3321 ms 168956 KB Output is correct
14 Correct 3275 ms 168888 KB Output is correct
15 Correct 3279 ms 168884 KB Output is correct
16 Correct 3273 ms 168208 KB Output is correct
17 Correct 3079 ms 159344 KB Output is correct
18 Correct 2119 ms 110136 KB Output is correct
19 Correct 3260 ms 168716 KB Output is correct
20 Correct 3320 ms 168828 KB Output is correct
21 Correct 3268 ms 168776 KB Output is correct
22 Correct 3257 ms 168196 KB Output is correct
23 Correct 3060 ms 159484 KB Output is correct
24 Correct 2122 ms 110204 KB Output is correct

Subtask #6
27.0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 11988 KB Output is correct
2 Correct 7 ms 11988 KB Output is correct
3 Correct 8 ms 12084 KB Output is correct
4 Correct 8 ms 11996 KB Output is correct
5 Correct 7 ms 11988 KB Output is correct
6 Correct 9 ms 12064 KB Output is correct
7 Correct 7 ms 12016 KB Output is correct
8 Correct 7 ms 12084 KB Output is correct
9 Correct 6 ms 12084 KB Output is correct
10 Correct 6 ms 12116 KB Output is correct
11 Correct 7 ms 12076 KB Output is correct
12 Correct 6 ms 12116 KB Output is correct
13 Correct 7 ms 12076 KB Output is correct
14 Correct 6 ms 12116 KB Output is correct
15 Correct 7 ms 12076 KB Output is correct
16 Correct 8 ms 12032 KB Output is correct
17 Correct 8 ms 12116 KB Output is correct
18 Correct 7 ms 12076 KB Output is correct
19 Correct 18 ms 12820 KB Output is correct
20 Correct 19 ms 12860 KB Output is correct
21 Correct 21 ms 12988 KB Output is correct
22 Correct 23 ms 13116 KB Output is correct
23 Correct 40 ms 15956 KB Output is correct
24 Correct 48 ms 16852 KB Output is correct
25 Correct 55 ms 17484 KB Output is correct
26 Correct 62 ms 18404 KB Output is correct
27 Correct 7 ms 11988 KB Output is correct
28 Correct 6 ms 11988 KB Output is correct
29 Correct 7 ms 12092 KB Output is correct
30 Correct 14 ms 12244 KB Output is correct
31 Correct 44 ms 13208 KB Output is correct
32 Correct 6 ms 11988 KB Output is correct
33 Correct 7 ms 12244 KB Output is correct
34 Correct 7 ms 12244 KB Output is correct
35 Correct 8 ms 12292 KB Output is correct
36 Correct 16 ms 12504 KB Output is correct
37 Correct 53 ms 13660 KB Output is correct
38 Correct 12 ms 13780 KB Output is correct
39 Correct 12 ms 13784 KB Output is correct
40 Correct 13 ms 13808 KB Output is correct
41 Correct 23 ms 14096 KB Output is correct
42 Correct 69 ms 15312 KB Output is correct
43 Correct 159 ms 46640 KB Output is correct
44 Correct 163 ms 46660 KB Output is correct
45 Correct 160 ms 46680 KB Output is correct
46 Correct 187 ms 46868 KB Output is correct
47 Correct 351 ms 48252 KB Output is correct
48 Correct 11 ms 12884 KB Output is correct
49 Correct 24 ms 13028 KB Output is correct
50 Correct 87 ms 13588 KB Output is correct
51 Correct 158 ms 14200 KB Output is correct
52 Correct 59 ms 23812 KB Output is correct
53 Correct 86 ms 23896 KB Output is correct
54 Correct 199 ms 24548 KB Output is correct
55 Correct 339 ms 25512 KB Output is correct
56 Correct 368 ms 78768 KB Output is correct
57 Correct 416 ms 78924 KB Output is correct
58 Correct 618 ms 79588 KB Output is correct
59 Correct 868 ms 80380 KB Output is correct
60 Correct 843 ms 151856 KB Output is correct
61 Correct 876 ms 151980 KB Output is correct
62 Correct 1226 ms 152668 KB Output is correct
63 Correct 1462 ms 153516 KB Output is correct
64 Correct 2309 ms 153512 KB Output is correct
65 Correct 2346 ms 129076 KB Output is correct
66 Correct 2391 ms 132604 KB Output is correct
67 Correct 2362 ms 131820 KB Output is correct
68 Correct 2375 ms 132136 KB Output is correct
69 Correct 2222 ms 126312 KB Output is correct
70 Correct 1621 ms 93376 KB Output is correct
71 Correct 3294 ms 157564 KB Output is correct
72 Correct 3231 ms 157320 KB Output is correct
73 Correct 3216 ms 157372 KB Output is correct
74 Correct 3271 ms 156900 KB Output is correct
75 Correct 3030 ms 149480 KB Output is correct
76 Correct 2227 ms 106476 KB Output is correct
77 Correct 3321 ms 168956 KB Output is correct
78 Correct 3275 ms 168888 KB Output is correct
79 Correct 3279 ms 168884 KB Output is correct
80 Correct 3273 ms 168208 KB Output is correct
81 Correct 3079 ms 159344 KB Output is correct
82 Correct 2119 ms 110136 KB Output is correct
83 Correct 3260 ms 168716 KB Output is correct
84 Correct 3320 ms 168828 KB Output is correct
85 Correct 3268 ms 168776 KB Output is correct
86 Correct 3257 ms 168196 KB Output is correct
87 Correct 3060 ms 159484 KB Output is correct
88 Correct 2122 ms 110204 KB Output is correct
89 Correct 2358 ms 129740 KB Output is correct
90 Correct 2776 ms 140408 KB Output is correct
91 Correct 3047 ms 152792 KB Output is correct
92 Correct 3170 ms 155908 KB Output is correct
93 Correct 3317 ms 161352 KB Output is correct
94 Correct 3351 ms 162152 KB Output is correct
95 Correct 3233 ms 166064 KB Output is correct
96 Correct 3246 ms 164708 KB Output is correct
97 Correct 3272 ms 165776 KB Output is correct
98 Correct 3198 ms 168088 KB Output is correct
99 Correct 3232 ms 165480 KB Output is correct
100 Correct 3198 ms 165488 KB Output is correct