oj.uz

Submission #926076

# Submission time Handle Problem Language Result Execution time Memory
926076 2024-02-12T14:29:29 Z SNP011 Dynamic Diameter (CEOI19_diameter) C++17
31 / 100
 452 ms 62084 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
#define pb push_back
#define pii pair<long long, long long>
#define int long long
const int maxn = 2e5 + 5, inf = 1e18;
 
int lastans;
int n, q, w;
vector<pii> adj[maxn], edge;
map<pii, int> va;
vector<int> dis;
bool vis[maxn];
int dp[4 * maxn][5], st[maxn], fn[maxn];
int h[maxn], lazy[4 * maxn], _h[maxn];
 
void dfs(int v) {
	vis[v] = 1;
	st[v] = dis.size();
	dis.pb(h[v]);
	for (auto[w, u]: adj[v]) {
		if (!vis[u]) {
			_h[u] = _h[v] + 1;
			h[u] = h[v] + w;
			dfs(u);
			dis.pb(h[v]);
		}
	}
	fn[v] = dis.size() - 1;
}
 
void updateDP(int id, int L, int R) {
	int mid = (R + L >> 1);
	int lc = 2 * id, rc = 2 * id + 1;
	if (R - L >= 3) {
		dp[id][0] = 0 - inf;
		if (mid - L >= 3) {
			dp[id][0] = max(dp[id][0], dp[lc][0]);
		}
		if (R - mid >= 3) {
			dp[id][0] = max(dp[id][0], dp[rc][0]);
		}
		if (mid - L >= 2) {
			dp[id][0] = max(dp[id][0], dp[lc][3] + dp[rc][2]);
		}
		if (R - mid >= 2) {
			dp[id][0] = max(dp[id][0], dp[lc][2] + dp[rc][4]);
		}
	}
	dp[id][1] = min(dp[lc][1], dp[rc][1]);
	dp[id][2] = max(dp[lc][2], dp[rc][2]);
	if (R - L >= 2) {
		dp[id][3] = max({dp[lc][3], dp[rc][3], dp[rc][3], dp[lc][2] - (2 * dp[rc][1])});
		dp[id][4] = max({dp[lc][4], dp[rc][4], dp[lc][4], dp[rc][2] - (2 * dp[lc][1])});
	}
}
 
void printDP(int id, int L, int R) {
	cout << L << ", " << R - 1 << ": \n";
	cout << "dp[0] = " << dp[id][0] << '\n';
	cout << "dp[1] = " << dp[id][1] << '\n';
	cout << "dp[2] = " << dp[id][2] << '\n';
	cout << "dp[3] = " << dp[id][3] << '\n';
	cout << "dp[4] = " << dp[id][4] << '\n';
	cout << "\n\n-----------------\n\n";
}
 
struct segment {
	void spread(int id, int L, int R) {
		int mid = (R + L) >> 1;

		dp[2 * id][1] += lazy[id];
		dp[2 * id][2] += lazy[id];
		if (mid - L >= 2) {
			dp[2 * id][3] -= lazy[id];
			dp[2 * id][4] -= lazy[id];	
		}

		dp[2 * id + 1][1] += lazy[id];
		dp[2 * id + 1][2] += lazy[id];

		if (R - mid >= 2) {
			dp[2 * id + 1][3] -= lazy[id];
			dp[2 * id + 1][4] -= lazy[id];	
		}
 
		lazy[2 * id] += lazy[id];
		lazy[2 * id + 1] += lazy[id];
		lazy[id] = 0;
	}
 
	void init(int id, int L, int R) {
		if (L + 1 == R) {
			dp[id][1] = dis[L];
			dp[id][2] = dis[L];
			// printDP(id, L, R);
			return;
		}
		int mid = (R + L) >> 1;
		init(2 * id, L, mid);
		init(2 * id + 1, mid, R);
		updateDP(id, L, R);
		// printDP(id, L, R);
	}
 
	void update(int id, int L, int R, int l, int r, int val) {
		if (L == l and R == r) {
			dp[id][1] += val;
			dp[id][2] += val;
			if (R - L >= 2) {
				dp[id][3] -= val;
				dp[id][4] -= val;	
			}
			lazy[id] += val;
			return;
		}
		spread(id, L, R);
		int mid = (R + L) >> 1;
		if (l < mid) {
			update(2 * id, L, mid, l, min(r, mid), val);
		}
		if (r > mid) {
			update(2 * id + 1, mid, R, max(l, mid), r, val);
		}
		updateDP(id, L, R);
		// printDP(id, L, R);
	}
} seg;
 
signed main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
  	// freopen("inp.txt", "r", stdin);
 	// freopen("wrong.txt", "w", stdout);
	for (int i = 0; i < maxn; i++) {
		for (int j = 0; j < 5; j++) {
			dp[i][j] = (j == 1 ? inf : 0 - inf);
		}
	}
 
	cin >> n >> q >> w;
	for (int i = 1; i < n; i++) {
		int u, v, _w;
		cin >> u >> v >> _w;
		adj[v].pb({_w, u});
		adj[u].pb({_w, v});
		va[{u, v}] = _w;
		va[{v, u}] = _w;
		edge.pb({u, v});
	}
	dis.pb(-1);
	dfs(1);
	seg.init(1, 1, 2 * n);
	while (q--) {
		int i, x;
		cin >> i >> x;
		i = (i + lastans) % (n - 1);
		x = (x + lastans) % w;
		int u = edge[i].first, v = edge[i].second;
 
		if (_h[u] < _h[v]) {
			swap(u, v);
		} // h[u] > h[v]
		seg.update(1, 1, 2 * n, st[u], fn[u] + 1, x - va[{u, v}]);
		cout << max(dp[1][0], dp[1][2]) << '\n';
		lastans = max(dp[1][0], dp[1][2]);
		va[{u, v}] = x;
		va[{v, u}] = x;
	}
	return 0;
}

Compilation message

diameter.cpp: In function 'void updateDP(long long int, long long int, long long int)':
diameter.cpp:35:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |  int mid = (R + L >> 1);
      |             ~~^~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18012 KB Output is correct
2 Correct 3 ms 18012 KB Output is correct
3 Correct 3 ms 18012 KB Output is correct
4 Correct 3 ms 18012 KB Output is correct
5 Correct 3 ms 18220 KB Output is correct
6 Correct 3 ms 18008 KB Output is correct
7 Correct 3 ms 18264 KB Output is correct
8 Correct 3 ms 18012 KB Output is correct
9 Correct 3 ms 18012 KB Output is correct
10 Correct 3 ms 18012 KB Output is correct
11 Correct 3 ms 18012 KB Output is correct
12 Correct 4 ms 18268 KB Output is correct
13 Correct 3 ms 18268 KB Output is correct
14 Correct 3 ms 18268 KB Output is correct
15 Correct 3 ms 18264 KB Output is correct
16 Correct 4 ms 18268 KB Output is correct
17 Correct 3 ms 18228 KB Output is correct
18 Correct 4 ms 18268 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18012 KB Output is correct
2 Correct 3 ms 18012 KB Output is correct
3 Correct 3 ms 18012 KB Output is correct
4 Correct 3 ms 18012 KB Output is correct
5 Correct 3 ms 18220 KB Output is correct
6 Correct 3 ms 18008 KB Output is correct
7 Correct 3 ms 18264 KB Output is correct
8 Correct 3 ms 18012 KB Output is correct
9 Correct 3 ms 18012 KB Output is correct
10 Correct 3 ms 18012 KB Output is correct
11 Correct 3 ms 18012 KB Output is correct
12 Correct 4 ms 18268 KB Output is correct
13 Correct 3 ms 18268 KB Output is correct
14 Correct 3 ms 18268 KB Output is correct
15 Correct 3 ms 18264 KB Output is correct
16 Correct 4 ms 18268 KB Output is correct
17 Correct 3 ms 18228 KB Output is correct
18 Correct 4 ms 18268 KB Output is correct
19 Correct 9 ms 18520 KB Output is correct
20 Correct 8 ms 18524 KB Output is correct
21 Correct 8 ms 18524 KB Output is correct
22 Correct 8 ms 18520 KB Output is correct
23 Correct 12 ms 19796 KB Output is correct
24 Correct 14 ms 19800 KB Output is correct
25 Correct 12 ms 19800 KB Output is correct
26 Correct 13 ms 20080 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 18012 KB Output is correct
2 Correct 3 ms 18148 KB Output is correct
3 Correct 4 ms 18268 KB Output is correct
4 Correct 10 ms 18280 KB Output is correct
5 Correct 38 ms 18524 KB Output is correct
6 Correct 3 ms 18012 KB Output is correct
7 Correct 4 ms 18268 KB Output is correct
8 Correct 4 ms 18268 KB Output is correct
9 Correct 5 ms 18268 KB Output is correct
10 Correct 14 ms 18264 KB Output is correct
11 Correct 52 ms 18836 KB Output is correct
12 Correct 6 ms 19512 KB Output is correct
13 Correct 7 ms 19548 KB Output is correct
14 Correct 9 ms 19548 KB Output is correct
15 Correct 20 ms 19804 KB Output is correct
16 Correct 74 ms 20104 KB Output is correct
17 Correct 86 ms 59820 KB Output is correct
18 Correct 84 ms 60364 KB Output is correct
19 Correct 87 ms 59820 KB Output is correct
20 Correct 116 ms 60048 KB Output is correct
21 Correct 294 ms 60328 KB Output is correct

Subtask #4
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 18524 KB Output is correct
2 Correct 10 ms 18524 KB Output is correct
3 Correct 36 ms 18780 KB Output is correct
4 Correct 67 ms 19024 KB Output is correct
5 Correct 10 ms 21084 KB Output is correct
6 Correct 19 ms 21084 KB Output is correct
7 Correct 52 ms 21332 KB Output is correct
8 Correct 103 ms 21604 KB Output is correct
9 Correct 39 ms 37708 KB Output is correct
10 Incorrect 49 ms 37704 KB Output isn't correct
11 Halted 0 ms 0 KB -

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Incorrect 452 ms 62084 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 18012 KB Output is correct
2 Correct 3 ms 18012 KB Output is correct
3 Correct 3 ms 18012 KB Output is correct
4 Correct 3 ms 18012 KB Output is correct
5 Correct 3 ms 18220 KB Output is correct
6 Correct 3 ms 18008 KB Output is correct
7 Correct 3 ms 18264 KB Output is correct
8 Correct 3 ms 18012 KB Output is correct
9 Correct 3 ms 18012 KB Output is correct
10 Correct 3 ms 18012 KB Output is correct
11 Correct 3 ms 18012 KB Output is correct
12 Correct 4 ms 18268 KB Output is correct
13 Correct 3 ms 18268 KB Output is correct
14 Correct 3 ms 18268 KB Output is correct
15 Correct 3 ms 18264 KB Output is correct
16 Correct 4 ms 18268 KB Output is correct
17 Correct 3 ms 18228 KB Output is correct
18 Correct 4 ms 18268 KB Output is correct
19 Correct 9 ms 18520 KB Output is correct
20 Correct 8 ms 18524 KB Output is correct
21 Correct 8 ms 18524 KB Output is correct
22 Correct 8 ms 18520 KB Output is correct
23 Correct 12 ms 19796 KB Output is correct
24 Correct 14 ms 19800 KB Output is correct
25 Correct 12 ms 19800 KB Output is correct
26 Correct 13 ms 20080 KB Output is correct
27 Correct 3 ms 18012 KB Output is correct
28 Correct 3 ms 18148 KB Output is correct
29 Correct 4 ms 18268 KB Output is correct
30 Correct 10 ms 18280 KB Output is correct
31 Correct 38 ms 18524 KB Output is correct
32 Correct 3 ms 18012 KB Output is correct
33 Correct 4 ms 18268 KB Output is correct
34 Correct 4 ms 18268 KB Output is correct
35 Correct 5 ms 18268 KB Output is correct
36 Correct 14 ms 18264 KB Output is correct
37 Correct 52 ms 18836 KB Output is correct
38 Correct 6 ms 19512 KB Output is correct
39 Correct 7 ms 19548 KB Output is correct
40 Correct 9 ms 19548 KB Output is correct
41 Correct 20 ms 19804 KB Output is correct
42 Correct 74 ms 20104 KB Output is correct
43 Correct 86 ms 59820 KB Output is correct
44 Correct 84 ms 60364 KB Output is correct
45 Correct 87 ms 59820 KB Output is correct
46 Correct 116 ms 60048 KB Output is correct
47 Correct 294 ms 60328 KB Output is correct
48 Correct 5 ms 18524 KB Output is correct
49 Correct 10 ms 18524 KB Output is correct
50 Correct 36 ms 18780 KB Output is correct
51 Correct 67 ms 19024 KB Output is correct
52 Correct 10 ms 21084 KB Output is correct
53 Correct 19 ms 21084 KB Output is correct
54 Correct 52 ms 21332 KB Output is correct
55 Correct 103 ms 21604 KB Output is correct
56 Correct 39 ms 37708 KB Output is correct
57 Incorrect 49 ms 37704 KB Output isn't correct
58 Halted 0 ms 0 KB -