oj.uz

Submission #450351

# Submission time Handle Problem Language Result Execution time Memory
450351 2021-08-02T15:23:10 Z fhvirus Dynamic Diameter (CEOI19_diameter) C++17
100 / 100
 491 ms 37900 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){
	u.mnv = min(l.mnv, r.mnv);
	u.mxv = max(l.mxv, r.mxv);
	u.lft = max({ l.lft, r.lft, l.mxv - 2 * r.mnv });
	u.rgt = max({ l.rgt, r.rgt, r.mxv - 2 * l.mnv });
	u.ans = max({ l.ans, r.ans, l.lft + r.mxv, l.mxv + r.rgt });
}

inline 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 upd(NOD &u, ll v){
	u.mnv += v;
	u.mxv += v;
	u.lft -= v;
	u.rgt -= v;
	u.tag += v;
}
void push(NOD &u, int l, int r){
	int m = (l + r) / 2;
	int lc = id(l, m), rc = id(m+1, r);
	upd(nod[lc], u.tag);
	upd(nod[rc], u.tag);
	u.tag = 0;
}
void modify(int l, int r, int ql, int qr, ll v){
	int i = id(l, r);
	if(l == r){ upd(nod[i], v); return; }
	push(nod[i], l, r);
	if(ql <= l and r <= qr){
		upd(nod[i], v);
		push(nod[i], l, r);
		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;
}

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 11 ms 21452 KB Output is correct
3 Correct 11 ms 21368 KB Output is correct
4 Correct 11 ms 21420 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21452 KB Output is correct
7 Correct 10 ms 21472 KB Output is correct
8 Correct 11 ms 21452 KB Output is correct
9 Correct 11 ms 21384 KB Output is correct
10 Correct 11 ms 21452 KB Output is correct
11 Correct 11 ms 21504 KB Output is correct
12 Correct 12 ms 21460 KB Output is correct
13 Correct 11 ms 21452 KB Output is correct
14 Correct 11 ms 21484 KB Output is correct
15 Correct 11 ms 21452 KB Output is correct
16 Correct 13 ms 21452 KB Output is correct
17 Correct 11 ms 21452 KB Output is correct
18 Correct 11 ms 21400 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 11 ms 21452 KB Output is correct
3 Correct 11 ms 21368 KB Output is correct
4 Correct 11 ms 21420 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21452 KB Output is correct
7 Correct 10 ms 21472 KB Output is correct
8 Correct 11 ms 21452 KB Output is correct
9 Correct 11 ms 21384 KB Output is correct
10 Correct 11 ms 21452 KB Output is correct
11 Correct 11 ms 21504 KB Output is correct
12 Correct 12 ms 21460 KB Output is correct
13 Correct 11 ms 21452 KB Output is correct
14 Correct 11 ms 21484 KB Output is correct
15 Correct 11 ms 21452 KB Output is correct
16 Correct 13 ms 21452 KB Output is correct
17 Correct 11 ms 21452 KB Output is correct
18 Correct 11 ms 21400 KB Output is correct
19 Correct 15 ms 21556 KB Output is correct
20 Correct 14 ms 21480 KB Output is correct
21 Correct 16 ms 21580 KB Output is correct
22 Correct 16 ms 21604 KB Output is correct
23 Correct 19 ms 21892 KB Output is correct
24 Correct 19 ms 21836 KB Output is correct
25 Correct 20 ms 21856 KB Output is correct
26 Correct 22 ms 22176 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 21436 KB Output is correct
2 Correct 11 ms 21452 KB Output is correct
3 Correct 12 ms 21452 KB Output is correct
4 Correct 20 ms 21564 KB Output is correct
5 Correct 54 ms 21804 KB Output is correct
6 Correct 11 ms 21452 KB Output is correct
7 Correct 11 ms 21476 KB Output is correct
8 Correct 12 ms 21432 KB Output is correct
9 Correct 13 ms 21452 KB Output is correct
10 Correct 24 ms 21572 KB Output is correct
11 Correct 72 ms 21956 KB Output is correct
12 Correct 14 ms 21796 KB Output is correct
13 Correct 14 ms 21836 KB Output is correct
14 Correct 15 ms 21888 KB Output is correct
15 Correct 29 ms 21944 KB Output is correct
16 Correct 91 ms 22296 KB Output is correct
17 Correct 56 ms 29240 KB Output is correct
18 Correct 52 ms 29240 KB Output is correct
19 Correct 55 ms 29252 KB Output is correct
20 Correct 78 ms 29328 KB Output is correct
21 Correct 224 ms 29804 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 21 ms 21580 KB Output is correct
3 Correct 59 ms 21700 KB Output is correct
4 Correct 106 ms 22000 KB Output is correct
5 Correct 18 ms 22204 KB Output is correct
6 Correct 28 ms 22284 KB Output is correct
7 Correct 80 ms 22504 KB Output is correct
8 Correct 152 ms 22840 KB Output is correct
9 Correct 37 ms 25296 KB Output is correct
10 Correct 52 ms 25424 KB Output is correct
11 Correct 122 ms 25652 KB Output is correct
12 Correct 214 ms 25928 KB Output is correct
13 Correct 61 ms 29252 KB Output is correct
14 Correct 83 ms 29252 KB Output is correct
15 Correct 159 ms 29532 KB Output is correct
16 Correct 284 ms 29872 KB Output is correct
17 Correct 210 ms 29752 KB Output is correct

Subtask #5
24.0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 305 ms 30516 KB Output is correct
2 Correct 280 ms 30444 KB Output is correct
3 Correct 286 ms 30552 KB Output is correct
4 Correct 300 ms 30656 KB Output is correct
5 Correct 277 ms 30584 KB Output is correct
6 Correct 262 ms 30812 KB Output is correct
7 Correct 338 ms 33344 KB Output is correct
8 Correct 341 ms 33384 KB Output is correct
9 Correct 342 ms 33344 KB Output is correct
10 Correct 343 ms 33328 KB Output is correct
11 Correct 327 ms 33188 KB Output is correct
12 Correct 322 ms 32764 KB Output is correct
13 Correct 455 ms 37684 KB Output is correct
14 Correct 445 ms 37900 KB Output is correct
15 Correct 461 ms 37900 KB Output is correct
16 Correct 437 ms 37700 KB Output is correct
17 Correct 445 ms 37060 KB Output is correct
18 Correct 360 ms 34196 KB Output is correct
19 Correct 462 ms 37728 KB Output is correct
20 Correct 445 ms 37828 KB Output is correct
21 Correct 441 ms 37804 KB Output is correct
22 Correct 491 ms 37736 KB Output is correct
23 Correct 442 ms 37088 KB Output is correct
24 Correct 406 ms 34284 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 11 ms 21452 KB Output is correct
3 Correct 11 ms 21368 KB Output is correct
4 Correct 11 ms 21420 KB Output is correct
5 Correct 11 ms 21452 KB Output is correct
6 Correct 11 ms 21452 KB Output is correct
7 Correct 10 ms 21472 KB Output is correct
8 Correct 11 ms 21452 KB Output is correct
9 Correct 11 ms 21384 KB Output is correct
10 Correct 11 ms 21452 KB Output is correct
11 Correct 11 ms 21504 KB Output is correct
12 Correct 12 ms 21460 KB Output is correct
13 Correct 11 ms 21452 KB Output is correct
14 Correct 11 ms 21484 KB Output is correct
15 Correct 11 ms 21452 KB Output is correct
16 Correct 13 ms 21452 KB Output is correct
17 Correct 11 ms 21452 KB Output is correct
18 Correct 11 ms 21400 KB Output is correct
19 Correct 15 ms 21556 KB Output is correct
20 Correct 14 ms 21480 KB Output is correct
21 Correct 16 ms 21580 KB Output is correct
22 Correct 16 ms 21604 KB Output is correct
23 Correct 19 ms 21892 KB Output is correct
24 Correct 19 ms 21836 KB Output is correct
25 Correct 20 ms 21856 KB Output is correct
26 Correct 22 ms 22176 KB Output is correct
27 Correct 10 ms 21436 KB Output is correct
28 Correct 11 ms 21452 KB Output is correct
29 Correct 12 ms 21452 KB Output is correct
30 Correct 20 ms 21564 KB Output is correct
31 Correct 54 ms 21804 KB Output is correct
32 Correct 11 ms 21452 KB Output is correct
33 Correct 11 ms 21476 KB Output is correct
34 Correct 12 ms 21432 KB Output is correct
35 Correct 13 ms 21452 KB Output is correct
36 Correct 24 ms 21572 KB Output is correct
37 Correct 72 ms 21956 KB Output is correct
38 Correct 14 ms 21796 KB Output is correct
39 Correct 14 ms 21836 KB Output is correct
40 Correct 15 ms 21888 KB Output is correct
41 Correct 29 ms 21944 KB Output is correct
42 Correct 91 ms 22296 KB Output is correct
43 Correct 56 ms 29240 KB Output is correct
44 Correct 52 ms 29240 KB Output is correct
45 Correct 55 ms 29252 KB Output is correct
46 Correct 78 ms 29328 KB Output is correct
47 Correct 224 ms 29804 KB Output is correct
48 Correct 12 ms 21452 KB Output is correct
49 Correct 21 ms 21580 KB Output is correct
50 Correct 59 ms 21700 KB Output is correct
51 Correct 106 ms 22000 KB Output is correct
52 Correct 18 ms 22204 KB Output is correct
53 Correct 28 ms 22284 KB Output is correct
54 Correct 80 ms 22504 KB Output is correct
55 Correct 152 ms 22840 KB Output is correct
56 Correct 37 ms 25296 KB Output is correct
57 Correct 52 ms 25424 KB Output is correct
58 Correct 122 ms 25652 KB Output is correct
59 Correct 214 ms 25928 KB Output is correct
60 Correct 61 ms 29252 KB Output is correct
61 Correct 83 ms 29252 KB Output is correct
62 Correct 159 ms 29532 KB Output is correct
63 Correct 284 ms 29872 KB Output is correct
64 Correct 210 ms 29752 KB Output is correct
65 Correct 305 ms 30516 KB Output is correct
66 Correct 280 ms 30444 KB Output is correct
67 Correct 286 ms 30552 KB Output is correct
68 Correct 300 ms 30656 KB Output is correct
69 Correct 277 ms 30584 KB Output is correct
70 Correct 262 ms 30812 KB Output is correct
71 Correct 338 ms 33344 KB Output is correct
72 Correct 341 ms 33384 KB Output is correct
73 Correct 342 ms 33344 KB Output is correct
74 Correct 343 ms 33328 KB Output is correct
75 Correct 327 ms 33188 KB Output is correct
76 Correct 322 ms 32764 KB Output is correct
77 Correct 455 ms 37684 KB Output is correct
78 Correct 445 ms 37900 KB Output is correct
79 Correct 461 ms 37900 KB Output is correct
80 Correct 437 ms 37700 KB Output is correct
81 Correct 445 ms 37060 KB Output is correct
82 Correct 360 ms 34196 KB Output is correct
83 Correct 462 ms 37728 KB Output is correct
84 Correct 445 ms 37828 KB Output is correct
85 Correct 441 ms 37804 KB Output is correct
86 Correct 491 ms 37736 KB Output is correct
87 Correct 442 ms 37088 KB Output is correct
88 Correct 406 ms 34284 KB Output is correct
89 Correct 270 ms 30212 KB Output is correct
90 Correct 284 ms 30596 KB Output is correct
91 Correct 305 ms 32116 KB Output is correct
92 Correct 319 ms 31912 KB Output is correct
93 Correct 364 ms 34704 KB Output is correct
94 Correct 400 ms 33524 KB Output is correct
95 Correct 436 ms 35256 KB Output is correct
96 Correct 434 ms 34188 KB Output is correct
97 Correct 431 ms 35276 KB Output is correct
98 Correct 437 ms 37428 KB Output is correct
99 Correct 453 ms 34984 KB Output is correct
100 Correct 416 ms 34884 KB Output is correct