oj.uz

답안 #207973

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207973 2020-03-09T14:55:14 Z E869120 Dynamic Diameter (CEOI19_diameter) C++14
73 / 100
 2432 ms 59068 KB 
#include <iostream>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <algorithm>
#include <functional>
using namespace std;
#pragma warning (disable: 4996)

class LazySegmentTree {
public:
	int size_ = 1;
	vector<long long> dat, lazy;

	void init(int sz) {
		while (size_ <= sz) size_ *= 2;
		dat.resize(size_ * 2, 0);
		lazy.resize(size_ * 2, 0);
	}
	void refresh(int u) {
		if (u < size_) {
			lazy[u * 2 + 0] += lazy[u];
			lazy[u * 2 + 1] += lazy[u];
			lazy[u] = 0;
			dat[u] = max(dat[u * 2] + lazy[u * 2], dat[u * 2 + 1] + lazy[u * 2 + 1]);
		}
		else {
			dat[u] += lazy[u];
			lazy[u] = 0;
		}
	}
	void add_(int l, int r, long long x, int a, int b, int u) {
		if (l <= a && b <= r) { lazy[u] += x; return; }
		if (r <= a || b <= l) return;
		refresh(u);
		add_(l, r, x, a, (a + b) >> 1, u * 2);
		add_(l, r, x, (a + b) >> 1, b, u * 2 + 1);
		refresh(u);
	}
	void add(int l, int r, long long x) {
		add_(l, r, x, 0, size_, 1);
	}
	long long query_(int l, int r, int a, int b, int u) {
		if (l <= a && b <= r) return dat[u] + lazy[u];
		if (r <= a || b <= l) return -(1LL << 60);
		refresh(u);
		long long v1 = query_(l, r, a, (a + b) >> 1, u * 2);
		long long v2 = query_(l, r, (a + b) >> 1, b, u * 2 + 1);
		refresh(u);
		return max(v1, v2);
	}
	long long query(int l, int r) {
		return query_(l, r, 0, size_, 1);
	}
};

// Input
long long N, A[1 << 18], B[1 << 18], C[1 << 18];
long long Q, D[1 << 18], E[1 << 18];
long long W;
vector<pair<int, long long>> X[1 << 18];

// Some Information
long long dist[1 << 18];

// Subtask 2
void dfs1(int pos, long long dep) {
	dist[pos] = dep;
	for (int i = 0; i < X[pos].size(); i++) {
		if (dist[X[pos][i].first] != (1LL << 60)) continue;
		dfs1(X[pos][i].first, dep + X[pos][i].second);
	}
}

void getdist(int pos) {
	for (int i = 1; i <= N; i++) dist[i] = (1LL << 60);
	dfs1(pos, 0);
}

long long solve1() {
	for (int i = 1; i <= N; i++) X[i].clear();
	for (int i = 1; i <= N - 1; i++) {
		X[A[i]].push_back(make_pair(B[i], C[i]));
		X[B[i]].push_back(make_pair(A[i], C[i]));
	}
	getdist(1);
	pair<long long, int> maxn1 = make_pair(-1, -1);
	for (int i = 1; i <= N; i++) maxn1 = max(maxn1, make_pair(dist[i], i));
	getdist(maxn1.second);
	pair<long long, int> maxn2 = make_pair(-1, -1);
	for (int i = 1; i <= N; i++) maxn2 = max(maxn2, make_pair(dist[i], i));
	return maxn2.first;
}

void solve_subtask2() {
	long long last = 0;
	for (int i = 1; i <= Q; i++) {
		D[i] = (D[i] + last) % (N - 1LL) + 1LL;
		E[i] = (E[i] + last) % W;
		C[D[i]] = E[i];
		last = solve1();
		printf("%lld\n", last);
	}
}

int cnts, cl[1 << 18], cr[1 << 18], depth[1 << 18], idx[1 << 18];
vector<int> Y[1 << 18];
LazySegmentTree Z;
set<pair<long long, int>> Set;

void dfs2(int pos, int dep) {
	depth[pos] = dep;
	cnts++; cl[pos] = cnts;
	for (int i = 0; i < X[pos].size(); i++) {
		if (cl[X[pos][i].first] >= 1) continue;
		Y[pos].push_back(X[pos][i].first);
		dfs2(X[pos][i].first, dep + 1);
	}
	cr[pos] = cnts;
}

void dfs3(int pos, int id) {
	idx[pos] = id;
	for (int i : Y[pos]) dfs3(i, id);
}

void solve_subtask5() {
	dfs2(1, 0);
	for (int i = 0; i < Y[1].size(); i++) dfs3(Y[1][i], Y[1][i]);

	Z.init(N + 2);
	for (int i = 1; i <= N - 1; i++) {
		if (depth[A[i]] > depth[B[i]]) swap(A[i], B[i]);
		Z.add(cl[B[i]], cr[B[i]] + 1, C[i]);
	}
	for (int i = 0; i < Y[1].size(); i++) {
		long long val = Z.query(cl[Y[1][i]], cr[Y[1][i]] + 1);
		Set.insert(make_pair(val, Y[1][i]));
	}

	long long last = 0;
	for (int i = 1; i <= Q; i++) {
		D[i] = (D[i] + last) % (N - 1LL) + 1LL;
		E[i] = (E[i] + last) % W;
		long long changes = E[i] - C[D[i]];
		long long pos = B[D[i]];
		long long root = idx[B[D[i]]];
		long long val1 = Z.query(cl[root], cr[root] + 1);
		Set.erase(make_pair(val1, root));
		Z.add(cl[pos], cr[pos] + 1, changes);
		long long val2 = Z.query(cl[root], cr[root] + 1);
		Set.insert(make_pair(val2, root));

		long long r = 0; auto itr = Set.end();
		for (int t = 1; t <= 2; t++) {
			if (itr == Set.begin()) break;
			itr--;
			r += (*itr).first;
		}
		last = r; C[D[i]] = E[i];
		printf("%lld\n", r);
	}
}

long long maxdist[1 << 18];
long long val[1 << 18];
priority_queue<pair<long long, int>, vector<pair<long long, int>>, less<pair<long long, int>>> Que;

void solve_subtask4() {
	for (int i = 1; i <= N - 1; i++) val[B[i]] = C[i];
	for (int i = N / 2; i >= 1; i--) maxdist[i] = max(maxdist[i * 2] + val[i * 2], maxdist[i * 2 + 1] + val[i * 2 + 1]);
	for (int i = 1; i <= N / 2; i++) Que.push(make_pair(maxdist[i * 2] + val[i * 2] + maxdist[i * 2 + 1] + val[i * 2 + 1], i));

	long long last = 0;
	for (int i = 1; i <= Q; i++) {
		D[i] = (D[i] + last) % (N - 1LL) + 1LL;
		E[i] = (E[i] + last) % W;

		int pos = B[D[i]]; val[pos] = E[i];
		while (pos >= 2) {
			pos >>= 1;
			maxdist[pos] = max(maxdist[pos * 2] + val[pos * 2], maxdist[pos * 2 + 1] + val[pos * 2 + 1]);
			Que.push(make_pair(maxdist[pos * 2] + val[pos * 2] + maxdist[pos * 2 + 1] + val[pos * 2 + 1], pos));
		}
		while (!Que.empty()) {
			pair<long long, int> R = Que.top();
			if (maxdist[R.second * 2] + val[R.second * 2] + maxdist[R.second * 2 + 1] + val[R.second * 2 + 1] != R.first) Que.pop();
			else break;
		}

		last = Que.top().first;
		printf("%lld\n", last);
	}
}

int main() {
	scanf("%lld%lld%lld", &N, &Q, &W); bool flag = false;
	for (int i = 1; i <= N - 1; i++) {
		scanf("%lld%lld%lld", &A[i], &B[i], &C[i]); if (A[i] > B[i]) swap(A[i], B[i]);
		if (B[i] - 2LL * A[i] < 0 || 1 < B[i] - 2LL * A[i]) flag = true;
		X[A[i]].push_back(make_pair(B[i], C[i])); 
		X[B[i]].push_back(make_pair(A[i], C[i])); 
	}
	for (int i = 1; i <= Q; i++) scanf("%lld%lld", &D[i], &E[i]);

	if (N <= 5000 && Q <= 5000) {
		solve_subtask2();
	}
	else if (flag == false) {
		solve_subtask4();
	}
	else {
		solve_subtask5();
	}
	return 0;
}

Compilation message

diameter.cpp:9:0: warning: ignoring #pragma warning  [-Wunknown-pragmas]
 #pragma warning (disable: 4996)
 
diameter.cpp: In function 'void dfs1(int, long long int)':
diameter.cpp:70:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < X[pos].size(); i++) {
                  ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'void dfs2(int, int)':
diameter.cpp:115:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < X[pos].size(); i++) {
                  ~~^~~~~~~~~~~~~~~
diameter.cpp: In function 'void solve_subtask5()':
diameter.cpp:130:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < Y[1].size(); i++) dfs3(Y[1][i], Y[1][i]);
                  ~~^~~~~~~~~~~~~
diameter.cpp:137:20: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for (int i = 0; i < Y[1].size(); i++) {
                  ~~^~~~~~~~~~~~~
diameter.cpp: In function 'int main()':
diameter.cpp:198:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%lld%lld%lld", &N, &Q, &W); bool flag = false;
  ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:200:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld%lld%lld", &A[i], &B[i], &C[i]); if (A[i] > B[i]) swap(A[i], B[i]);
   ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:205:36: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  for (int i = 1; i <= Q; i++) scanf("%lld%lld", &D[i], &E[i]);
                               ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12536 KB Output is correct
2 Correct 13 ms 12656 KB Output is correct
3 Correct 12 ms 12668 KB Output is correct
4 Correct 12 ms 12664 KB Output is correct
5 Correct 12 ms 12664 KB Output is correct
6 Correct 12 ms 12664 KB Output is correct
7 Correct 12 ms 12664 KB Output is correct
8 Correct 12 ms 12664 KB Output is correct
9 Correct 12 ms 12664 KB Output is correct
10 Correct 12 ms 12664 KB Output is correct
11 Correct 12 ms 12664 KB Output is correct
12 Correct 12 ms 12664 KB Output is correct
13 Correct 13 ms 12664 KB Output is correct
14 Correct 12 ms 12792 KB Output is correct
15 Correct 12 ms 12792 KB Output is correct
16 Correct 11 ms 12664 KB Output is correct
17 Correct 12 ms 12664 KB Output is correct
18 Correct 13 ms 12664 KB Output is correct

Subtask #2
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12536 KB Output is correct
2 Correct 13 ms 12656 KB Output is correct
3 Correct 12 ms 12668 KB Output is correct
4 Correct 12 ms 12664 KB Output is correct
5 Correct 12 ms 12664 KB Output is correct
6 Correct 12 ms 12664 KB Output is correct
7 Correct 12 ms 12664 KB Output is correct
8 Correct 12 ms 12664 KB Output is correct
9 Correct 12 ms 12664 KB Output is correct
10 Correct 12 ms 12664 KB Output is correct
11 Correct 12 ms 12664 KB Output is correct
12 Correct 12 ms 12664 KB Output is correct
13 Correct 13 ms 12664 KB Output is correct
14 Correct 12 ms 12792 KB Output is correct
15 Correct 12 ms 12792 KB Output is correct
16 Correct 11 ms 12664 KB Output is correct
17 Correct 12 ms 12664 KB Output is correct
18 Correct 13 ms 12664 KB Output is correct
19 Correct 313 ms 13048 KB Output is correct
20 Correct 316 ms 12920 KB Output is correct
21 Correct 329 ms 12920 KB Output is correct
22 Correct 372 ms 12920 KB Output is correct
23 Correct 2029 ms 13488 KB Output is correct
24 Correct 2123 ms 13316 KB Output is correct
25 Correct 2260 ms 13560 KB Output is correct
26 Correct 2432 ms 13708 KB Output is correct

Subtask #3
7.0 / 7.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12664 KB Output is correct
2 Correct 12 ms 12696 KB Output is correct
3 Correct 14 ms 12664 KB Output is correct
4 Correct 26 ms 13048 KB Output is correct
5 Correct 88 ms 14712 KB Output is correct
6 Correct 12 ms 12664 KB Output is correct
7 Correct 12 ms 12792 KB Output is correct
8 Correct 16 ms 12792 KB Output is correct
9 Correct 57 ms 12792 KB Output is correct
10 Correct 36 ms 13176 KB Output is correct
11 Correct 134 ms 14840 KB Output is correct
12 Correct 17 ms 13692 KB Output is correct
13 Correct 17 ms 13688 KB Output is correct
14 Correct 20 ms 13816 KB Output is correct
15 Correct 48 ms 14200 KB Output is correct
16 Correct 176 ms 15864 KB Output is correct
17 Correct 169 ms 32100 KB Output is correct
18 Correct 169 ms 32100 KB Output is correct
19 Correct 168 ms 32100 KB Output is correct
20 Correct 220 ms 32484 KB Output is correct
21 Correct 512 ms 34276 KB Output is correct

Subtask #4
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 59 ms 12792 KB Output is correct
2 Correct 21 ms 13684 KB Output is correct
3 Correct 59 ms 16492 KB Output is correct
4 Correct 116 ms 19812 KB Output is correct
5 Correct 17 ms 14200 KB Output is correct
6 Correct 28 ms 15216 KB Output is correct
7 Correct 74 ms 19560 KB Output is correct
8 Correct 140 ms 25180 KB Output is correct
9 Correct 38 ms 18680 KB Output is correct
10 Correct 53 ms 20596 KB Output is correct
11 Correct 102 ms 23656 KB Output is correct
12 Correct 177 ms 29280 KB Output is correct
13 Correct 63 ms 24428 KB Output is correct
14 Correct 83 ms 25836 KB Output is correct
15 Correct 135 ms 28900 KB Output is correct
16 Correct 221 ms 34524 KB Output is correct
17 Correct 193 ms 59068 KB Output is correct

Subtask #5
24.0 / 24.0

# 결과 실행 시간 메모리 Grader output
1 Correct 448 ms 30968 KB Output is correct
2 Correct 438 ms 30840 KB Output is correct
3 Correct 419 ms 30968 KB Output is correct
4 Correct 413 ms 30840 KB Output is correct
5 Correct 402 ms 31220 KB Output is correct
6 Correct 414 ms 33132 KB Output is correct
7 Correct 455 ms 33912 KB Output is correct
8 Correct 465 ms 34044 KB Output is correct
9 Correct 460 ms 33912 KB Output is correct
10 Correct 427 ms 34040 KB Output is correct
11 Correct 467 ms 34548 KB Output is correct
12 Correct 448 ms 35316 KB Output is correct
13 Correct 503 ms 39860 KB Output is correct
14 Correct 509 ms 39708 KB Output is correct
15 Correct 443 ms 39672 KB Output is correct
16 Correct 457 ms 39784 KB Output is correct
17 Correct 431 ms 39284 KB Output is correct
18 Correct 454 ms 37352 KB Output is correct
19 Correct 506 ms 39928 KB Output is correct
20 Correct 457 ms 39672 KB Output is correct
21 Correct 466 ms 39672 KB Output is correct
22 Correct 472 ms 39800 KB Output is correct
23 Correct 462 ms 39284 KB Output is correct
24 Correct 476 ms 37484 KB Output is correct

Subtask #6
0 / 27.0

# 결과 실행 시간 메모리 Grader output
1 Correct 12 ms 12536 KB Output is correct
2 Correct 13 ms 12656 KB Output is correct
3 Correct 12 ms 12668 KB Output is correct
4 Correct 12 ms 12664 KB Output is correct
5 Correct 12 ms 12664 KB Output is correct
6 Correct 12 ms 12664 KB Output is correct
7 Correct 12 ms 12664 KB Output is correct
8 Correct 12 ms 12664 KB Output is correct
9 Correct 12 ms 12664 KB Output is correct
10 Correct 12 ms 12664 KB Output is correct
11 Correct 12 ms 12664 KB Output is correct
12 Correct 12 ms 12664 KB Output is correct
13 Correct 13 ms 12664 KB Output is correct
14 Correct 12 ms 12792 KB Output is correct
15 Correct 12 ms 12792 KB Output is correct
16 Correct 11 ms 12664 KB Output is correct
17 Correct 12 ms 12664 KB Output is correct
18 Correct 13 ms 12664 KB Output is correct
19 Correct 313 ms 13048 KB Output is correct
20 Correct 316 ms 12920 KB Output is correct
21 Correct 329 ms 12920 KB Output is correct
22 Correct 372 ms 12920 KB Output is correct
23 Correct 2029 ms 13488 KB Output is correct
24 Correct 2123 ms 13316 KB Output is correct
25 Correct 2260 ms 13560 KB Output is correct
26 Correct 2432 ms 13708 KB Output is correct
27 Correct 12 ms 12664 KB Output is correct
28 Correct 12 ms 12696 KB Output is correct
29 Correct 14 ms 12664 KB Output is correct
30 Correct 26 ms 13048 KB Output is correct
31 Correct 88 ms 14712 KB Output is correct
32 Correct 12 ms 12664 KB Output is correct
33 Correct 12 ms 12792 KB Output is correct
34 Correct 16 ms 12792 KB Output is correct
35 Correct 57 ms 12792 KB Output is correct
36 Correct 36 ms 13176 KB Output is correct
37 Correct 134 ms 14840 KB Output is correct
38 Correct 17 ms 13692 KB Output is correct
39 Correct 17 ms 13688 KB Output is correct
40 Correct 20 ms 13816 KB Output is correct
41 Correct 48 ms 14200 KB Output is correct
42 Correct 176 ms 15864 KB Output is correct
43 Correct 169 ms 32100 KB Output is correct
44 Correct 169 ms 32100 KB Output is correct
45 Correct 168 ms 32100 KB Output is correct
46 Correct 220 ms 32484 KB Output is correct
47 Correct 512 ms 34276 KB Output is correct
48 Correct 59 ms 12792 KB Output is correct
49 Correct 21 ms 13684 KB Output is correct
50 Correct 59 ms 16492 KB Output is correct
51 Correct 116 ms 19812 KB Output is correct
52 Correct 17 ms 14200 KB Output is correct
53 Correct 28 ms 15216 KB Output is correct
54 Correct 74 ms 19560 KB Output is correct
55 Correct 140 ms 25180 KB Output is correct
56 Correct 38 ms 18680 KB Output is correct
57 Correct 53 ms 20596 KB Output is correct
58 Correct 102 ms 23656 KB Output is correct
59 Correct 177 ms 29280 KB Output is correct
60 Correct 63 ms 24428 KB Output is correct
61 Correct 83 ms 25836 KB Output is correct
62 Correct 135 ms 28900 KB Output is correct
63 Correct 221 ms 34524 KB Output is correct
64 Correct 193 ms 59068 KB Output is correct
65 Correct 448 ms 30968 KB Output is correct
66 Correct 438 ms 30840 KB Output is correct
67 Correct 419 ms 30968 KB Output is correct
68 Correct 413 ms 30840 KB Output is correct
69 Correct 402 ms 31220 KB Output is correct
70 Correct 414 ms 33132 KB Output is correct
71 Correct 455 ms 33912 KB Output is correct
72 Correct 465 ms 34044 KB Output is correct
73 Correct 460 ms 33912 KB Output is correct
74 Correct 427 ms 34040 KB Output is correct
75 Correct 467 ms 34548 KB Output is correct
76 Correct 448 ms 35316 KB Output is correct
77 Correct 503 ms 39860 KB Output is correct
78 Correct 509 ms 39708 KB Output is correct
79 Correct 443 ms 39672 KB Output is correct
80 Correct 457 ms 39784 KB Output is correct
81 Correct 431 ms 39284 KB Output is correct
82 Correct 454 ms 37352 KB Output is correct
83 Correct 506 ms 39928 KB Output is correct
84 Correct 457 ms 39672 KB Output is correct
85 Correct 466 ms 39672 KB Output is correct
86 Correct 472 ms 39800 KB Output is correct
87 Correct 462 ms 39284 KB Output is correct
88 Correct 476 ms 37484 KB Output is correct
89 Incorrect 433 ms 34040 KB Output isn't correct
90 Halted 0 ms 0 KB -