oj.uz

Submission #450352

# Submission time Handle Problem Language Result Execution time Memory
450352 2021-08-02T15:25:49 Z fhvirus Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 408 ms 38080 KB 
// Knapsack DP is harder than FFT.
#include<bits/stdc++.h>
using namespace std;
typedef long long ll; typedef pair<int,int> pii; typedef pair<ll,ll> pll;
#define ff first
#define ss second
#define pb emplace_back
#define AI(x) begin(x),end(x)
template<class I>bool chmax(I&a,I b){return a<b?(a=b,true):false;}
template<class I>bool chmin(I&a,I b){return b<a?(a=b,true):false;} 
#ifdef OWO
#define debug(args...) SDF(#args, args)
#define OIU(args...) ostream& operator<<(ostream&O,args)
#define LKJ(S,B,E,F) template<class...T>OIU(S<T...>s){O<<B;int c=0;for(auto i:s)O<<(c++?", ":"")<<F;return O<<E;}
LKJ(vector,'[',']',i)LKJ(deque,'[',']',i)LKJ(set,'{','}',i)LKJ(multiset,'{','}',i)LKJ(unordered_set,'{','}',i)LKJ(map,'{','}',i.ff<<':'<<i.ss)LKJ(unordered_map,'{','}',i.ff<<':'<<i.ss)
template<class...T>void SDF(const char* s,T...a){int c=sizeof...(T);if(!c){cerr<<"\033[1;32mvoid\033[0m\n";return;}(cerr<<"\033[1;32m("<<s<<") = (",...,(cerr<<a<<(--c?", ":")\033[0m\n")));}
template<class T,size_t N>OIU(array<T,N>a){return O<<vector<T>(AI(a));}template<class...T>OIU(pair<T...>p){return O<<'('<<p.ff<<','<<p.ss<<')';}template<class...T>OIU(tuple<T...>t){return O<<'(',apply([&O](T...s){int c=0;(...,(O<<(c++?", ":"")<<s));},t),O<<')';}
#else
#pragma GCC optimize("Ofast")
#define debug(...) ((void)0)
#endif

const int kN = 100001;

int n, q; ll w;
pii edg[kN];
ll  wei[kN];
vector<pii> adj[kN];
int in[kN], ou[kN], tot;
ll eu[kN * 2];

struct NOD {
	ll mnv, mxv, lft, rgt, ans, tag;
	NOD(ll v = 0): mnv(v), mxv(v), lft(-v), rgt(-v), ans(0), tag(0) {}
} nod[kN * 4];
void merge(NOD l, NOD r, NOD &u){
	ll tl = l.tag, tr = r.tag;
	u.mnv = min(l.mnv + tl, r.mnv + tr);
	u.mxv = max(l.mxv + tl, r.mxv + tr);
	u.lft = max({ l.lft - tl, r.lft - tr, l.mxv + tl - 2 * (r.mnv + tr) });
	u.rgt = max({ l.rgt - tl, r.rgt - tr, r.mxv + tr - 2 * (l.mnv + tl) });
	u.ans = max({ l.ans, r.ans, l.lft - tl + r.mxv + tr, l.mxv + tl + r.rgt - tr });
}

constexpr int id(int l, int r){ return (l + r) | (l != r); }
void build(int l, int r){
	int i = id(l, r);
	if(l == r){ nod[i] = NOD(eu[l]); return; }
	int m = (l + r) / 2;
	build(l, m);
	build(m+1, r);
	merge(nod[id(l, m)], nod[id(m+1, r)], nod[i]);
}
void modify(int l, int r, int ql, int qr, ll v){
	int i = id(l, r);
	if(ql <= l and r <= qr){
		nod[i].tag += v;
		return;
	}
	int m = (l + r) / 2;
	if(ql <= m) modify(l, m, ql, qr, v);
	if(m+1 <= qr) modify(m+1, r, ql, qr, v);
	merge(nod[id(l, m)], nod[id(m+1, r)], nod[i]);
}

void dfs(int u, int p = 0, ll d = 0){
	in[u] = tot; eu[tot++] = d;
	for(auto [v, i]: adj[u]){
		if(v == p) continue;
		if(edg[i].ff == v) swap(edg[i].ff, edg[i].ss);
		dfs(v, u, d + wei[i]);
		eu[tot++] = d;
	}
	ou[u] = tot - 1;
}
void init(){
	dfs(1);
	build(0, tot - 1);
}
ll upd(int d, ll e){
	int u = edg[d].ss;
	ll  v = e - wei[d];
	wei[d] = e;
	modify(0, tot-1, in[u], ou[u], v);
	return nod[id(0, tot-1)].ans + nod[id(0, tot-1)].tag;
}

signed main(){
	ios_base::sync_with_stdio(0);cin.tie(0);cout.tie(0);
	cin >> n >> q >> w;
	for(int i = 0; i < n-1; ++i){
		int u, v; ll c; cin >> u >> v >> c;
		edg[i] = pii(u, v);
		wei[i] = c;
		adj[u].pb(v, i);
		adj[v].pb(u, i);
	}
	init();
	ll last = 0;
	for(int i = 0; i < q; ++i){
		ll d, e; cin >> d >> e;
		d = (d + last) % (n-1);
		e = (e + last) % w;
		last = upd(d, e);
		cout << last << '\n';
	}
	return 0;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21452 KB Output is correct
2 Correct 12 ms 21360 KB Output is correct
3 Correct 12 ms 21452 KB Output is correct
4 Correct 11 ms 21404 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21428 KB Output is correct
7 Correct 11 ms 21480 KB Output is correct
8 Correct 11 ms 21452 KB Output is correct
9 Correct 11 ms 21464 KB Output is correct
10 Correct 11 ms 21452 KB Output is correct
11 Correct 11 ms 21388 KB Output is correct
12 Correct 10 ms 21452 KB Output is correct
13 Correct 10 ms 21452 KB Output is correct
14 Correct 11 ms 21436 KB Output is correct
15 Correct 11 ms 21432 KB Output is correct
16 Correct 11 ms 21388 KB Output is correct
17 Correct 11 ms 21376 KB Output is correct
18 Correct 10 ms 21452 KB Output is correct

Subtask #2
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21452 KB Output is correct
2 Correct 12 ms 21360 KB Output is correct
3 Correct 12 ms 21452 KB Output is correct
4 Correct 11 ms 21404 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21428 KB Output is correct
7 Correct 11 ms 21480 KB Output is correct
8 Correct 11 ms 21452 KB Output is correct
9 Correct 11 ms 21464 KB Output is correct
10 Correct 11 ms 21452 KB Output is correct
11 Correct 11 ms 21388 KB Output is correct
12 Correct 10 ms 21452 KB Output is correct
13 Correct 10 ms 21452 KB Output is correct
14 Correct 11 ms 21436 KB Output is correct
15 Correct 11 ms 21432 KB Output is correct
16 Correct 11 ms 21388 KB Output is correct
17 Correct 11 ms 21376 KB Output is correct
18 Correct 10 ms 21452 KB Output is correct
19 Correct 14 ms 21576 KB Output is correct
20 Correct 14 ms 21464 KB Output is correct
21 Correct 16 ms 21556 KB Output is correct
22 Correct 16 ms 21600 KB Output is correct
23 Correct 17 ms 21836 KB Output is correct
24 Correct 18 ms 21856 KB Output is correct
25 Correct 18 ms 21932 KB Output is correct
26 Correct 19 ms 22228 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21452 KB Output is correct
2 Correct 11 ms 21396 KB Output is correct
3 Correct 11 ms 21436 KB Output is correct
4 Correct 18 ms 21452 KB Output is correct
5 Correct 53 ms 21840 KB Output is correct
6 Correct 10 ms 21452 KB Output is correct
7 Correct 11 ms 21512 KB Output is correct
8 Correct 11 ms 21476 KB Output is correct
9 Correct 13 ms 21452 KB Output is correct
10 Correct 24 ms 21700 KB Output is correct
11 Correct 66 ms 21956 KB Output is correct
12 Correct 13 ms 21852 KB Output is correct
13 Correct 14 ms 21836 KB Output is correct
14 Correct 14 ms 21848 KB Output is correct
15 Correct 29 ms 21896 KB Output is correct
16 Correct 86 ms 22340 KB Output is correct
17 Correct 52 ms 29180 KB Output is correct
18 Correct 54 ms 29168 KB Output is correct
19 Correct 68 ms 29240 KB Output is correct
20 Correct 80 ms 29420 KB Output is correct
21 Correct 206 ms 29784 KB Output is correct

Subtask #4
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 12 ms 21452 KB Output is correct
2 Correct 19 ms 21572 KB Output is correct
3 Correct 48 ms 21756 KB Output is correct
4 Correct 85 ms 21972 KB Output is correct
5 Correct 17 ms 22220 KB Output is correct
6 Correct 26 ms 22304 KB Output is correct
7 Correct 65 ms 22480 KB Output is correct
8 Correct 117 ms 22724 KB Output is correct
9 Correct 36 ms 25360 KB Output is correct
10 Correct 61 ms 25412 KB Output is correct
11 Correct 107 ms 25780 KB Output is correct
12 Correct 171 ms 25912 KB Output is correct
13 Correct 61 ms 29248 KB Output is correct
14 Correct 90 ms 29304 KB Output is correct
15 Correct 141 ms 29460 KB Output is correct
16 Correct 226 ms 29808 KB Output is correct
17 Correct 240 ms 29808 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 288 ms 30616 KB Output is correct
2 Correct 278 ms 30532 KB Output is correct
3 Correct 270 ms 30472 KB Output is correct
4 Correct 298 ms 30584 KB Output is correct
5 Correct 310 ms 30632 KB Output is correct
6 Correct 247 ms 30648 KB Output is correct
7 Correct 303 ms 33348 KB Output is correct
8 Correct 298 ms 33408 KB Output is correct
9 Correct 313 ms 33344 KB Output is correct
10 Correct 304 ms 33392 KB Output is correct
11 Correct 314 ms 33220 KB Output is correct
12 Correct 267 ms 32736 KB Output is correct
13 Correct 347 ms 37700 KB Output is correct
14 Correct 386 ms 37700 KB Output is correct
15 Correct 379 ms 37700 KB Output is correct
16 Correct 379 ms 37700 KB Output is correct
17 Correct 382 ms 37040 KB Output is correct
18 Correct 340 ms 34360 KB Output is correct
19 Correct 354 ms 37744 KB Output is correct
20 Correct 361 ms 38080 KB Output is correct
21 Correct 356 ms 37708 KB Output is correct
22 Correct 373 ms 37624 KB Output is correct
23 Correct 357 ms 37040 KB Output is correct
24 Correct 314 ms 34364 KB Output is correct

Subtask #6
27.0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21452 KB Output is correct
2 Correct 12 ms 21360 KB Output is correct
3 Correct 12 ms 21452 KB Output is correct
4 Correct 11 ms 21404 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21428 KB Output is correct
7 Correct 11 ms 21480 KB Output is correct
8 Correct 11 ms 21452 KB Output is correct
9 Correct 11 ms 21464 KB Output is correct
10 Correct 11 ms 21452 KB Output is correct
11 Correct 11 ms 21388 KB Output is correct
12 Correct 10 ms 21452 KB Output is correct
13 Correct 10 ms 21452 KB Output is correct
14 Correct 11 ms 21436 KB Output is correct
15 Correct 11 ms 21432 KB Output is correct
16 Correct 11 ms 21388 KB Output is correct
17 Correct 11 ms 21376 KB Output is correct
18 Correct 10 ms 21452 KB Output is correct
19 Correct 14 ms 21576 KB Output is correct
20 Correct 14 ms 21464 KB Output is correct
21 Correct 16 ms 21556 KB Output is correct
22 Correct 16 ms 21600 KB Output is correct
23 Correct 17 ms 21836 KB Output is correct
24 Correct 18 ms 21856 KB Output is correct
25 Correct 18 ms 21932 KB Output is correct
26 Correct 19 ms 22228 KB Output is correct
27 Correct 11 ms 21452 KB Output is correct
28 Correct 11 ms 21396 KB Output is correct
29 Correct 11 ms 21436 KB Output is correct
30 Correct 18 ms 21452 KB Output is correct
31 Correct 53 ms 21840 KB Output is correct
32 Correct 10 ms 21452 KB Output is correct
33 Correct 11 ms 21512 KB Output is correct
34 Correct 11 ms 21476 KB Output is correct
35 Correct 13 ms 21452 KB Output is correct
36 Correct 24 ms 21700 KB Output is correct
37 Correct 66 ms 21956 KB Output is correct
38 Correct 13 ms 21852 KB Output is correct
39 Correct 14 ms 21836 KB Output is correct
40 Correct 14 ms 21848 KB Output is correct
41 Correct 29 ms 21896 KB Output is correct
42 Correct 86 ms 22340 KB Output is correct
43 Correct 52 ms 29180 KB Output is correct
44 Correct 54 ms 29168 KB Output is correct
45 Correct 68 ms 29240 KB Output is correct
46 Correct 80 ms 29420 KB Output is correct
47 Correct 206 ms 29784 KB Output is correct
48 Correct 12 ms 21452 KB Output is correct
49 Correct 19 ms 21572 KB Output is correct
50 Correct 48 ms 21756 KB Output is correct
51 Correct 85 ms 21972 KB Output is correct
52 Correct 17 ms 22220 KB Output is correct
53 Correct 26 ms 22304 KB Output is correct
54 Correct 65 ms 22480 KB Output is correct
55 Correct 117 ms 22724 KB Output is correct
56 Correct 36 ms 25360 KB Output is correct
57 Correct 61 ms 25412 KB Output is correct
58 Correct 107 ms 25780 KB Output is correct
59 Correct 171 ms 25912 KB Output is correct
60 Correct 61 ms 29248 KB Output is correct
61 Correct 90 ms 29304 KB Output is correct
62 Correct 141 ms 29460 KB Output is correct
63 Correct 226 ms 29808 KB Output is correct
64 Correct 240 ms 29808 KB Output is correct
65 Correct 288 ms 30616 KB Output is correct
66 Correct 278 ms 30532 KB Output is correct
67 Correct 270 ms 30472 KB Output is correct
68 Correct 298 ms 30584 KB Output is correct
69 Correct 310 ms 30632 KB Output is correct
70 Correct 247 ms 30648 KB Output is correct
71 Correct 303 ms 33348 KB Output is correct
72 Correct 298 ms 33408 KB Output is correct
73 Correct 313 ms 33344 KB Output is correct
74 Correct 304 ms 33392 KB Output is correct
75 Correct 314 ms 33220 KB Output is correct
76 Correct 267 ms 32736 KB Output is correct
77 Correct 347 ms 37700 KB Output is correct
78 Correct 386 ms 37700 KB Output is correct
79 Correct 379 ms 37700 KB Output is correct
80 Correct 379 ms 37700 KB Output is correct
81 Correct 382 ms 37040 KB Output is correct
82 Correct 340 ms 34360 KB Output is correct
83 Correct 354 ms 37744 KB Output is correct
84 Correct 361 ms 38080 KB Output is correct
85 Correct 356 ms 37708 KB Output is correct
86 Correct 373 ms 37624 KB Output is correct
87 Correct 357 ms 37040 KB Output is correct
88 Correct 314 ms 34364 KB Output is correct
89 Correct 275 ms 30176 KB Output is correct
90 Correct 273 ms 30572 KB Output is correct
91 Correct 304 ms 32108 KB Output is correct
92 Correct 294 ms 32112 KB Output is correct
93 Correct 408 ms 34616 KB Output is correct
94 Correct 325 ms 33480 KB Output is correct
95 Correct 342 ms 35264 KB Output is correct
96 Correct 362 ms 34136 KB Output is correct
97 Correct 341 ms 35156 KB Output is correct
98 Correct 370 ms 37596 KB Output is correct
99 Correct 342 ms 34892 KB Output is correct
100 Correct 380 ms 35136 KB Output is correct