This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#pragma GCC optimize("O1,O2,O3,Ofast,unroll-loops")
#include <bits/stdc++.h>
#include <string>
#include <iostream>
#include <cmath>
#include <numeric>
#include <stack>
#include <queue>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<int, int> pi;
typedef pair<ll, ll> pl;
typedef pair<ld, ld> pd;
typedef vector<int> vi;
typedef vector<bool> vb;
typedef vector<vector<int>> vvi;
typedef vector<vector<pi>> vvpi;
typedef vector<ld> vd;
typedef vector<long long> vl;
typedef vector<pi> vpi;
typedef vector<pl> vpl;
#define FOR(i, a, b) for (ll i = a; i < (b); i++)
#define F0R(i, a) for (int i = 0; i < (a); i++)
#define FORd(i, a, b) for (int i = (b)-1; i >= a; i--)
#define F0Rd(i, a) for (int i = (a)-1; i >= 0; i--)
#define trav(a, x) for (auto &a : x)
#define uid(a, b) uniform_int_distribution<int>(a, b)(rng)
#define len(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define F first
#define nl endl
#define S second
#define lb lower_bound
#define ub upper_bound
#define aint(x) x.begin(), x.end()
#define raint(x) x.rbegin(), x.rend()
#define ins insert
const int MOD = 1e6+3;
void init(string name)
{
freopen((name + ".in").c_str(), "r", stdin);
freopen((name + ".out").c_str(), "w", stdout);
}
void fastIO()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
}
int n,q,w;
vector<vector<pair<int,ll>>> paths(1e5+5);
vpi edges;
vl visited;
int mx = 0;
void dfs(int pos,ll dis,int prev){
if(visited[pos])return;
visited[pos] = dis;
if(visited[pos] > visited[mx])mx = pos;
for(auto ed:paths[pos]){
if(visited[ed.F])continue;
if(ed.F == prev)continue;
dfs(ed.F,dis+ed.S,prev);
}
}
void solve()
{
cin >> n >> q >> w;
FOR(i,0,n-1){
int a,b;ll c;
cin >> a >> b >> c;
paths[a].pb({b,c});
paths[b].pb({a,c});
edges.pb({a,b});
}
ll last = 0;
// cerr << endl;
FOR(i,0,q){
int a;ll b;cin >> a >> b;
a = (a+last)%(n-1);
b = (b+last)%w;
// cerr << edges[a].F << " " << edges[a].S << " " << b << endl;
FOR(k,0,paths[edges[a].F].size()){
if(paths[edges[a].F][k].F == edges[a].S){
paths[edges[a].F][k].S = b;
}
}
FOR(k,0,paths[edges[a].S].size()){
if(paths[edges[a].S][k].F == edges[a].F){
paths[edges[a].S][k].S = b;
}
}
visited = vl(n+1,0);
mx = 0;
dfs(1,0,1);
visited = vl(n+1,0);
// cerr << mx << " | ";
dfs(mx,0,mx);
// FOR(i,1,n+1)cerr << visited[i] << " ";
// cerr << endl;
cout << visited[mx] << endl;
// cout << "ans " << visited[mx] << endl;
last = visited[mx];
}
}
int main()
{
fastIO();
// init("test");
int t = 1;
// cin >> t;
while (t--)
solve();
return 0;
}
Compilation message (stderr)
diameter.cpp: In function 'void solve()':
diameter.cpp:24:39: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
24 | #define FOR(i, a, b) for (ll i = a; i < (b); i++)
| ^
diameter.cpp:94:9: note: in expansion of macro 'FOR'
94 | FOR(k,0,paths[edges[a].F].size()){
| ^~~
diameter.cpp:24:39: warning: comparison of integer expressions of different signedness: 'll' {aka 'long long int'} and 'std::vector<std::pair<int, long long int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
24 | #define FOR(i, a, b) for (ll i = a; i < (b); i++)
| ^
diameter.cpp:99:9: note: in expansion of macro 'FOR'
99 | FOR(k,0,paths[edges[a].S].size()){
| ^~~
diameter.cpp: In function 'void init(std::string)':
diameter.cpp:44:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
44 | freopen((name + ".in").c_str(), "r", stdin);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
diameter.cpp:45:12: warning: ignoring return value of 'FILE* freopen(const char*, const char*, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
45 | freopen((name + ".out").c_str(), "w", stdout);
| ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |