oj.uz

Submission #450347

# Submission time Handle Problem Language Result Execution time Memory
450347 2021-08-02T15:18:29 Z fhvirus Dynamic Diameter (CEOI19_diameter) C++17
49 / 100
 280 ms 34796 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){
	int 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 });
}

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);
		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;
	debug(u, v);
	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 11 ms 21424 KB Output is correct
3 Correct 11 ms 21452 KB Output is correct
4 Correct 12 ms 21520 KB Output is correct
5 Correct 11 ms 21464 KB Output is correct
6 Correct 11 ms 21452 KB Output is correct
7 Correct 11 ms 21452 KB Output is correct
8 Correct 12 ms 21480 KB Output is correct
9 Correct 12 ms 21460 KB Output is correct
10 Correct 12 ms 21476 KB Output is correct
11 Correct 11 ms 21432 KB Output is correct
12 Correct 11 ms 21404 KB Output is correct
13 Correct 12 ms 21452 KB Output is correct
14 Correct 11 ms 21464 KB Output is correct
15 Correct 12 ms 21452 KB Output is correct
16 Correct 12 ms 21452 KB Output is correct
17 Correct 13 ms 21424 KB Output is correct
18 Correct 13 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 11 ms 21424 KB Output is correct
3 Correct 11 ms 21452 KB Output is correct
4 Correct 12 ms 21520 KB Output is correct
5 Correct 11 ms 21464 KB Output is correct
6 Correct 11 ms 21452 KB Output is correct
7 Correct 11 ms 21452 KB Output is correct
8 Correct 12 ms 21480 KB Output is correct
9 Correct 12 ms 21460 KB Output is correct
10 Correct 12 ms 21476 KB Output is correct
11 Correct 11 ms 21432 KB Output is correct
12 Correct 11 ms 21404 KB Output is correct
13 Correct 12 ms 21452 KB Output is correct
14 Correct 11 ms 21464 KB Output is correct
15 Correct 12 ms 21452 KB Output is correct
16 Correct 12 ms 21452 KB Output is correct
17 Correct 13 ms 21424 KB Output is correct
18 Correct 13 ms 21452 KB Output is correct
19 Correct 15 ms 21580 KB Output is correct
20 Correct 14 ms 21580 KB Output is correct
21 Correct 14 ms 21580 KB Output is correct
22 Correct 15 ms 21652 KB Output is correct
23 Correct 17 ms 21992 KB Output is correct
24 Correct 18 ms 22016 KB Output is correct
25 Correct 19 ms 22024 KB Output is correct
26 Correct 19 ms 22348 KB Output is correct

Subtask #3
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 21452 KB Output is correct
2 Correct 13 ms 21452 KB Output is correct
3 Correct 11 ms 21452 KB Output is correct
4 Correct 19 ms 21580 KB Output is correct
5 Correct 52 ms 22512 KB Output is correct
6 Correct 11 ms 21452 KB Output is correct
7 Correct 11 ms 21508 KB Output is correct
8 Correct 11 ms 21452 KB Output is correct
9 Correct 12 ms 21452 KB Output is correct
10 Correct 22 ms 21744 KB Output is correct
11 Correct 68 ms 22832 KB Output is correct
12 Correct 14 ms 21836 KB Output is correct
13 Correct 13 ms 21836 KB Output is correct
14 Correct 18 ms 21856 KB Output is correct
15 Correct 30 ms 22264 KB Output is correct
16 Correct 87 ms 23260 KB Output is correct
17 Correct 53 ms 30452 KB Output is correct
18 Correct 54 ms 30392 KB Output is correct
19 Correct 56 ms 30504 KB Output is correct
20 Correct 79 ms 30756 KB Output is correct
21 Correct 211 ms 32184 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 21608 KB Output is correct
3 Correct 50 ms 22232 KB Output is correct
4 Correct 85 ms 22852 KB Output is correct
5 Correct 21 ms 22304 KB Output is correct
6 Correct 26 ms 22476 KB Output is correct
7 Correct 65 ms 23120 KB Output is correct
8 Correct 120 ms 23920 KB Output is correct
9 Correct 38 ms 26052 KB Output is correct
10 Correct 51 ms 26228 KB Output is correct
11 Correct 111 ms 26928 KB Output is correct
12 Correct 179 ms 27844 KB Output is correct
13 Correct 61 ms 30788 KB Output is correct
14 Correct 77 ms 30916 KB Output is correct
15 Correct 142 ms 31580 KB Output is correct
16 Correct 232 ms 32560 KB Output is correct
17 Correct 232 ms 32204 KB Output is correct

Subtask #5
0 / 24.0

# Verdict Execution time Memory Grader output
1 Correct 280 ms 30504 KB Output is correct
2 Correct 271 ms 34648 KB Output is correct
3 Correct 269 ms 34628 KB Output is correct
4 Incorrect 279 ms 34796 KB Output isn't correct
5 Halted 0 ms 0 KB -

Subtask #6
0 / 27.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 21452 KB Output is correct
2 Correct 11 ms 21424 KB Output is correct
3 Correct 11 ms 21452 KB Output is correct
4 Correct 12 ms 21520 KB Output is correct
5 Correct 11 ms 21464 KB Output is correct
6 Correct 11 ms 21452 KB Output is correct
7 Correct 11 ms 21452 KB Output is correct
8 Correct 12 ms 21480 KB Output is correct
9 Correct 12 ms 21460 KB Output is correct
10 Correct 12 ms 21476 KB Output is correct
11 Correct 11 ms 21432 KB Output is correct
12 Correct 11 ms 21404 KB Output is correct
13 Correct 12 ms 21452 KB Output is correct
14 Correct 11 ms 21464 KB Output is correct
15 Correct 12 ms 21452 KB Output is correct
16 Correct 12 ms 21452 KB Output is correct
17 Correct 13 ms 21424 KB Output is correct
18 Correct 13 ms 21452 KB Output is correct
19 Correct 15 ms 21580 KB Output is correct
20 Correct 14 ms 21580 KB Output is correct
21 Correct 14 ms 21580 KB Output is correct
22 Correct 15 ms 21652 KB Output is correct
23 Correct 17 ms 21992 KB Output is correct
24 Correct 18 ms 22016 KB Output is correct
25 Correct 19 ms 22024 KB Output is correct
26 Correct 19 ms 22348 KB Output is correct
27 Correct 10 ms 21452 KB Output is correct
28 Correct 13 ms 21452 KB Output is correct
29 Correct 11 ms 21452 KB Output is correct
30 Correct 19 ms 21580 KB Output is correct
31 Correct 52 ms 22512 KB Output is correct
32 Correct 11 ms 21452 KB Output is correct
33 Correct 11 ms 21508 KB Output is correct
34 Correct 11 ms 21452 KB Output is correct
35 Correct 12 ms 21452 KB Output is correct
36 Correct 22 ms 21744 KB Output is correct
37 Correct 68 ms 22832 KB Output is correct
38 Correct 14 ms 21836 KB Output is correct
39 Correct 13 ms 21836 KB Output is correct
40 Correct 18 ms 21856 KB Output is correct
41 Correct 30 ms 22264 KB Output is correct
42 Correct 87 ms 23260 KB Output is correct
43 Correct 53 ms 30452 KB Output is correct
44 Correct 54 ms 30392 KB Output is correct
45 Correct 56 ms 30504 KB Output is correct
46 Correct 79 ms 30756 KB Output is correct
47 Correct 211 ms 32184 KB Output is correct
48 Correct 12 ms 21452 KB Output is correct
49 Correct 19 ms 21608 KB Output is correct
50 Correct 50 ms 22232 KB Output is correct
51 Correct 85 ms 22852 KB Output is correct
52 Correct 21 ms 22304 KB Output is correct
53 Correct 26 ms 22476 KB Output is correct
54 Correct 65 ms 23120 KB Output is correct
55 Correct 120 ms 23920 KB Output is correct
56 Correct 38 ms 26052 KB Output is correct
57 Correct 51 ms 26228 KB Output is correct
58 Correct 111 ms 26928 KB Output is correct
59 Correct 179 ms 27844 KB Output is correct
60 Correct 61 ms 30788 KB Output is correct
61 Correct 77 ms 30916 KB Output is correct
62 Correct 142 ms 31580 KB Output is correct
63 Correct 232 ms 32560 KB Output is correct
64 Correct 232 ms 32204 KB Output is correct
65 Correct 280 ms 30504 KB Output is correct
66 Correct 271 ms 34648 KB Output is correct
67 Correct 269 ms 34628 KB Output is correct
68 Incorrect 279 ms 34796 KB Output isn't correct
69 Halted 0 ms 0 KB -