#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pb push_back
const int maxn = 1e5;
struct edge {
int to, wei;
edge() : to(0), wei(0) {}
edge(int to_, int wei_) :
to(to_), wei(wei_) {}
};
int n, q, w;
vector<int> wei;
multiset<int> m;
int query() {
int res = 0;
auto it = m.rbegin();
res += *it;
it++;
if(it != m.rend()) {
res += *it;
}
return res;
}
void solve() {
cin >> n >> q >> w;
wei.assign(n - 1, 0);
for(int i = 0; i < n - 1; i++) {
int a, b, c;
cin >> a >> b >> c;
wei[i] = c;
m.insert(c);
}
int last = 0;
while(q--) {
int d, e;
cin >> d >> e;
d = (d + last) % (n - 1);
e = (e + last) % w;
// ----- changable -----
m.erase(m.find(wei[d]));
wei[d] = e;
m.insert(wei[d]);
int result = query();
// ----- changable -----
cout << result << "\n";
last = result;
}
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
solve();
return 0;
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
0 ms |
212 KB |
Output is correct |
2 |
Correct |
0 ms |
212 KB |
Output is correct |
3 |
Correct |
1 ms |
212 KB |
Output is correct |
4 |
Correct |
9 ms |
340 KB |
Output is correct |
5 |
Correct |
30 ms |
640 KB |
Output is correct |
6 |
Correct |
0 ms |
212 KB |
Output is correct |
7 |
Correct |
0 ms |
340 KB |
Output is correct |
8 |
Correct |
1 ms |
340 KB |
Output is correct |
9 |
Correct |
1 ms |
340 KB |
Output is correct |
10 |
Correct |
8 ms |
340 KB |
Output is correct |
11 |
Correct |
41 ms |
744 KB |
Output is correct |
12 |
Correct |
2 ms |
596 KB |
Output is correct |
13 |
Correct |
3 ms |
596 KB |
Output is correct |
14 |
Correct |
3 ms |
596 KB |
Output is correct |
15 |
Correct |
10 ms |
652 KB |
Output is correct |
16 |
Correct |
42 ms |
1236 KB |
Output is correct |
17 |
Correct |
45 ms |
6968 KB |
Output is correct |
18 |
Correct |
52 ms |
6964 KB |
Output is correct |
19 |
Correct |
51 ms |
7000 KB |
Output is correct |
20 |
Correct |
78 ms |
7264 KB |
Output is correct |
21 |
Correct |
140 ms |
8608 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
1 ms |
388 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
203 ms |
9032 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Incorrect |
0 ms |
212 KB |
Output isn't correct |
2 |
Halted |
0 ms |
0 KB |
- |