// 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
typedef tuple<int, int, ll> triple;
const int kN = 100001;
int n, q; ll w;
pii edg[kN]; ll wei[kN];
vector<pll> adj[kN];
int par[kN];
ll dep[kN], dp[kN];
multiset<ll> s;
void dfs(int u, int p){
par[u] = p;
for(auto [v, w]: adj[u]){
if(v == p) continue;
dfs(v, u);
ll d = dep[v] + wei[w];
chmax(dp[u], dep[u] + d);
chmax(dep[u], d);
}
s.insert(dp[u]);
}
void init(){
dfs(1, -1);
}
void rm(ll v){
auto it = s.find(v);
s.erase(it);
}
ll upd(ll d, ll e){
debug(d, e);
auto &[a, b] = edg[d];
wei[d] = e;
if(par[a] == b) swap(a, b);
int p = a, u = b;
while(p != -1){
debug(u, p);
rm(dp[p]);
dp[p] = 0;
dep[p] = 0;
for(auto [v, w]: adj[p]){
if(v == par[p] or v == b) continue;
ll dd = dep[v] + wei[w];
debug(v, dd);
chmax(dp[p], dep[p] + dd);
chmax(dep[p], dd);
}
if(p == a){
chmax(dp[p], dep[p] + dep[b] + e);
chmax(dep[p], dep[b] + e);
}
s.insert(dp[p]);
debug(dep[p], dp[p]);
u = p; p = par[p];
}
return *s.rbegin();
}
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;
cout << (last = upd(d, e)) << '\n';
}
return 0;
}
Compilation message
diameter.cpp: In function 'll upd(ll, ll)':
diameter.cpp:58:13: warning: variable 'u' set but not used [-Wunused-but-set-variable]
58 | int p = a, u = b;
| ^
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
2 ms |
2636 KB |
Output is correct |
4 |
Correct |
2 ms |
2636 KB |
Output is correct |
5 |
Correct |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2636 KB |
Output is correct |
7 |
Correct |
2 ms |
2632 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
2 ms |
2636 KB |
Output is correct |
10 |
Correct |
3 ms |
2636 KB |
Output is correct |
11 |
Correct |
3 ms |
2636 KB |
Output is correct |
12 |
Correct |
2 ms |
2636 KB |
Output is correct |
13 |
Correct |
2 ms |
2636 KB |
Output is correct |
14 |
Correct |
2 ms |
2676 KB |
Output is correct |
15 |
Correct |
3 ms |
2680 KB |
Output is correct |
16 |
Correct |
3 ms |
2676 KB |
Output is correct |
17 |
Correct |
2 ms |
2680 KB |
Output is correct |
18 |
Correct |
2 ms |
2636 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
2 ms |
2636 KB |
Output is correct |
4 |
Correct |
2 ms |
2636 KB |
Output is correct |
5 |
Correct |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2636 KB |
Output is correct |
7 |
Correct |
2 ms |
2632 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
2 ms |
2636 KB |
Output is correct |
10 |
Correct |
3 ms |
2636 KB |
Output is correct |
11 |
Correct |
3 ms |
2636 KB |
Output is correct |
12 |
Correct |
2 ms |
2636 KB |
Output is correct |
13 |
Correct |
2 ms |
2636 KB |
Output is correct |
14 |
Correct |
2 ms |
2676 KB |
Output is correct |
15 |
Correct |
3 ms |
2680 KB |
Output is correct |
16 |
Correct |
3 ms |
2676 KB |
Output is correct |
17 |
Correct |
2 ms |
2680 KB |
Output is correct |
18 |
Correct |
2 ms |
2636 KB |
Output is correct |
19 |
Correct |
20 ms |
2892 KB |
Output is correct |
20 |
Correct |
34 ms |
2892 KB |
Output is correct |
21 |
Correct |
107 ms |
2892 KB |
Output is correct |
22 |
Correct |
249 ms |
2920 KB |
Output is correct |
23 |
Correct |
28 ms |
3456 KB |
Output is correct |
24 |
Correct |
130 ms |
3500 KB |
Output is correct |
25 |
Correct |
420 ms |
3660 KB |
Output is correct |
26 |
Correct |
2409 ms |
3960 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
3 ms |
2636 KB |
Output is correct |
4 |
Correct |
11 ms |
2892 KB |
Output is correct |
5 |
Correct |
45 ms |
3808 KB |
Output is correct |
6 |
Correct |
2 ms |
2636 KB |
Output is correct |
7 |
Correct |
2 ms |
2636 KB |
Output is correct |
8 |
Correct |
3 ms |
2636 KB |
Output is correct |
9 |
Correct |
5 ms |
2692 KB |
Output is correct |
10 |
Correct |
35 ms |
3000 KB |
Output is correct |
11 |
Correct |
177 ms |
4004 KB |
Output is correct |
12 |
Correct |
5 ms |
3276 KB |
Output is correct |
13 |
Correct |
7 ms |
3276 KB |
Output is correct |
14 |
Correct |
28 ms |
3344 KB |
Output is correct |
15 |
Correct |
247 ms |
3684 KB |
Output is correct |
16 |
Correct |
1196 ms |
4728 KB |
Output is correct |
17 |
Correct |
65 ms |
15152 KB |
Output is correct |
18 |
Correct |
104 ms |
15128 KB |
Output is correct |
19 |
Correct |
512 ms |
15328 KB |
Output is correct |
20 |
Correct |
4758 ms |
15508 KB |
Output is correct |
21 |
Execution timed out |
5079 ms |
15788 KB |
Time limit exceeded |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
4 ms |
2764 KB |
Output is correct |
2 |
Correct |
15 ms |
2964 KB |
Output is correct |
3 |
Correct |
62 ms |
3396 KB |
Output is correct |
4 |
Correct |
130 ms |
4300 KB |
Output is correct |
5 |
Correct |
11 ms |
4120 KB |
Output is correct |
6 |
Correct |
30 ms |
4244 KB |
Output is correct |
7 |
Correct |
127 ms |
4880 KB |
Output is correct |
8 |
Correct |
208 ms |
5644 KB |
Output is correct |
9 |
Correct |
43 ms |
9912 KB |
Output is correct |
10 |
Correct |
69 ms |
9964 KB |
Output is correct |
11 |
Correct |
193 ms |
10612 KB |
Output is correct |
12 |
Correct |
346 ms |
11496 KB |
Output is correct |
13 |
Correct |
90 ms |
17176 KB |
Output is correct |
14 |
Correct |
116 ms |
17292 KB |
Output is correct |
15 |
Correct |
265 ms |
17924 KB |
Output is correct |
16 |
Correct |
487 ms |
18736 KB |
Output is correct |
17 |
Correct |
1081 ms |
18556 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Execution timed out |
5076 ms |
19244 KB |
Time limit exceeded |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
2 ms |
2636 KB |
Output is correct |
2 |
Correct |
2 ms |
2636 KB |
Output is correct |
3 |
Correct |
2 ms |
2636 KB |
Output is correct |
4 |
Correct |
2 ms |
2636 KB |
Output is correct |
5 |
Correct |
2 ms |
2636 KB |
Output is correct |
6 |
Correct |
2 ms |
2636 KB |
Output is correct |
7 |
Correct |
2 ms |
2632 KB |
Output is correct |
8 |
Correct |
2 ms |
2636 KB |
Output is correct |
9 |
Correct |
2 ms |
2636 KB |
Output is correct |
10 |
Correct |
3 ms |
2636 KB |
Output is correct |
11 |
Correct |
3 ms |
2636 KB |
Output is correct |
12 |
Correct |
2 ms |
2636 KB |
Output is correct |
13 |
Correct |
2 ms |
2636 KB |
Output is correct |
14 |
Correct |
2 ms |
2676 KB |
Output is correct |
15 |
Correct |
3 ms |
2680 KB |
Output is correct |
16 |
Correct |
3 ms |
2676 KB |
Output is correct |
17 |
Correct |
2 ms |
2680 KB |
Output is correct |
18 |
Correct |
2 ms |
2636 KB |
Output is correct |
19 |
Correct |
20 ms |
2892 KB |
Output is correct |
20 |
Correct |
34 ms |
2892 KB |
Output is correct |
21 |
Correct |
107 ms |
2892 KB |
Output is correct |
22 |
Correct |
249 ms |
2920 KB |
Output is correct |
23 |
Correct |
28 ms |
3456 KB |
Output is correct |
24 |
Correct |
130 ms |
3500 KB |
Output is correct |
25 |
Correct |
420 ms |
3660 KB |
Output is correct |
26 |
Correct |
2409 ms |
3960 KB |
Output is correct |
27 |
Correct |
2 ms |
2636 KB |
Output is correct |
28 |
Correct |
2 ms |
2636 KB |
Output is correct |
29 |
Correct |
3 ms |
2636 KB |
Output is correct |
30 |
Correct |
11 ms |
2892 KB |
Output is correct |
31 |
Correct |
45 ms |
3808 KB |
Output is correct |
32 |
Correct |
2 ms |
2636 KB |
Output is correct |
33 |
Correct |
2 ms |
2636 KB |
Output is correct |
34 |
Correct |
3 ms |
2636 KB |
Output is correct |
35 |
Correct |
5 ms |
2692 KB |
Output is correct |
36 |
Correct |
35 ms |
3000 KB |
Output is correct |
37 |
Correct |
177 ms |
4004 KB |
Output is correct |
38 |
Correct |
5 ms |
3276 KB |
Output is correct |
39 |
Correct |
7 ms |
3276 KB |
Output is correct |
40 |
Correct |
28 ms |
3344 KB |
Output is correct |
41 |
Correct |
247 ms |
3684 KB |
Output is correct |
42 |
Correct |
1196 ms |
4728 KB |
Output is correct |
43 |
Correct |
65 ms |
15152 KB |
Output is correct |
44 |
Correct |
104 ms |
15128 KB |
Output is correct |
45 |
Correct |
512 ms |
15328 KB |
Output is correct |
46 |
Correct |
4758 ms |
15508 KB |
Output is correct |
47 |
Execution timed out |
5079 ms |
15788 KB |
Time limit exceeded |