Submission #1149009

#	Time	Username	Problem	Language	Result	Execution time	Memory
1149009		binminh01	Dynamic Diameter (CEOI19_diameter)	C++20	100 / 100	2600 ms	121260 KiB

diameter

#include<bits/allocator.h>
#pragma GCC optimize("Ofast,unroll-loops")
#pragma GCC target("avx2,fma,bmi,bmi2,popcnt,lzcnt,tune=native")

#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define ull unsigned long long
#define int128 __int128_t
#define double long double
#define gcd __gcd
#define lcm(a, b) ((a)/gcd(a, b)*(b))
#define sqrt sqrtl
#define log2 log2l
#define log10 log10l
#define floor floorl
#define to_string str
#define yes cout << "YES"
#define no cout << "NO"
#define trav(i, a) for (auto &i: (a))
#define all(a) (a).begin(), (a).end()
#define rall(a) (a).rbegin(), (a).rend()
#define sz(a) (int)a.size()
#define Max(a) *max_element(all(a))
#define Min(a) *min_element(all(a))
#define Find(a, n) (find(all(a), n) - a.begin())
#define Count(a, n) count(all(a), n)
#define Upper(a, n) (upper_bound(all(a), n) - a.begin())
#define Lower(a, n) (lower_bound(all(a), n) - a.begin())
#define next_perm(a) next_permutation(all(a))
#define prev_perm(a) prev_permutation(all(a))
#define sorted(a) is_sorted(all(a))
#define sum(a) accumulate(all(a), 0)
#define sumll(a) accumulate(all(a), 0ll)
#define Sort(a) sort(all(a))
#define Reverse(a) reverse(all(a))
#define Unique(a) Sort(a), (a).resize(unique(all(a)) - a.begin())
#define pb push_back
#define eb emplace_back
#define popcount __builtin_popcount
#define popcountll __builtin_popcountll
#define clz __builtin_clz
#define clzll __buitlin_clzll
#define ctz __builtin_ctz
#define ctzll __builtin_ctzll
#define open(s) freopen(s, "r", stdin)
#define write(s) freopen(s, "w", stdout)
#define fileopen(s) open((string(s) + ".inp").c_str()), write((string(s) + ".out").c_str());
#define For(i, a, b) for (auto i = (a); i < (b); ++i)
#define Fore(i, a, b) for (auto i = (a); i >= (b); --i)
#define FOR(i, a, b) for (auto i = (a); i <= (b); ++i)
#define ret(s) return void(cout << s);

constexpr int mod = 1e9 + 7, mod2 = 998244353;
constexpr double eps = 1e-9;
const double PI = acos(-1);
constexpr ull npos = string::npos;
constexpr int dx[] = {1, 0, -1, 0, 1, 1, -1, -1}, dy[] = {0, 1, 0, -1, 1, -1, 1, -1};
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using cd = complex<double>;
mt19937 mt(chrono::system_clock::now().time_since_epoch().count());
mt19937_64 mt64(chrono::system_clock::now().time_since_epoch().count());
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ll> vll;
typedef vector<vll> vvll;
typedef vector<double> vdo;
typedef vector<vdo> vvdo;
typedef vector<string> vs;
typedef vector<pii> vpair;
typedef vector<vpair> vvpair;
typedef vector<bool> vb;
typedef vector<vb> vvb;
typedef vector<char> vc;
typedef vector<vc> vvc;
typedef vector<cd> vcd;
typedef priority_queue<int> pq;
typedef priority_queue<int, vi, greater<int>> pqg;
typedef priority_queue<ll> pqll;
typedef priority_queue<ll, vll, greater<ll>> pqgll;

ll add(ll a, ll b, int m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);a+=b;return a >= m ? a - m: a;}
ll sub(ll a, ll b, int m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);a-=b;return a < 0 ? a + m: a;}
ll mul(ll a, ll b, int m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);return a*b % m;}
ll bin_mul(ll a, ll b, ll m) {a = (a >= m ? a % m: a);b = (b >= m ? b % m: b);ll x = 0;while (b) {if (b & 1) x = (x + a) % m;a = (a + a) % m;b>>=1;}return x;}
ll bin_pow(ll a, ll b, ll m) {ll x = 1;a = (a >= m ? a % m: a); while (b) {if (b & 1) x = bin_mul(x, a, m);a = bin_mul(a, a, m);b>>=1;}return x;}
ll power(ll a, ll b, int m) {ll x = 1;a = (a >= m ? a % m: a); while (b) {if (b & 1) x = x*a % m;a = a*a % m;b>>=1;}return x;}
ll power(ll a, ll b) {ll x = 1;while (b) {if (b & 1) x = x*a;a = a*a;b>>=1;}return x;}
ll ceil(ll a, ll b) {return (a + b - 1)/b;}
ll to_int(const string &s) {ll x = 0; for (int i = (s[0] == '-'); i < sz(s); ++i) x = x*10 + s[i] - '0';return x*(s[0] == '-' ? -1: 1);}
bool is_prime(ll n) {if (n < 2) return 0;if (n < 4) return 1;if (n % 2 == 0 || n % 3 == 0) return 0;for (ll i = 5; i*i <= n; i+=6) {if(n % i == 0 || n % (i + 2) == 0) return 0;}return 1;}
bool is_square(ll n) {ll k = sqrt(n); return k*k == n;}
ll factorial(int n) {ll x = 1;for (int i = 2; i <= n; ++i) x*=i;return x;}
ll factorial(int n, int m) {ll x = 1;for (ll i = 2; i <= n; ++i) x = x*i % m;return x;}
bool is_power(ll n, ll k) {while (n % k == 0) n/=k;return n == 1ll;}
string str(ll n) {if (n == 0) return "0"; string s = ""; bool c = 0; if (n < 0) c = 1, n = -n; while (n) {s+=n % 10 + '0'; n/=10;} if (c) s+='-'; Reverse(s); return s;}
string repeat(const string &s, int n) {if (n < 0) return ""; string x = ""; while (n--) x+=s; return x;}
string bin(ll n) {string s = ""; while (n) {s+=(n & 1) + '0'; n>>=1;} Reverse(s); return s;}
void sieve(vector<bool> &a) {int n = a.size(); a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(bool a[], int n) {a[0] = a[1] = 0; for (int i = 4; i < n; i+=2) a[i] = 0; for (int i = 3; i*i < n; i+=2) {if (a[i]) {for (int j = i*i; j < n; j+=(i << 1)) a[j] = 0;}}}
void sieve(vector<int> &a) {int n = a.size(); for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
void sieve(int a[], int n) {for (int i = 2; i < n; i+=2) a[i] = 2; for (int i = 3; i*i < n; i+=2) {if (!a[i]) {for (int j = i; j < n; j+=(i << 1)) a[j] = i;}} for (int i = 3; i < n; i+=2) {if (!a[i]) a[i] = i;}}
vector<pii> factorize(int n) {vector<pii> a; for (int i = 2; i*i <= n; ++i) {if (n % i == 0) {int k = 0; while (n % i == 0) ++k, n/=i; a.emplace_back(i, k);}} if (n > 1) a.emplace_back(n, 1); return a;}
int rand(int l, int r) {return uniform_int_distribution<int>(l, r)(mt);}
ll rand(ll l, ll r) {return uniform_int_distribution<ll>(l, r)(mt64);}
int Log2(int n) {return 31 - __builtin_clz(n);}
ll Log2(ll n) {return 63 - __builtin_clzll(n);}
template<class T> void compress(vector<T> &a) {vector<T> b; for (T &i: a) b.push_back(i); sort(all(b)); b.resize(unique(all(b)) - b.begin()); for (T &i: a) i = lower_bound(all(b), i) - b.begin() + 1;}
template<class A, class B> bool ckmin(A &a, const B &b) {return a > b ? a = b, 1: 0;}
template<class A, class B> bool ckmax(A &a, const B &b) {return a < b ? a = b, 1: 0;}

template<class A, class B> istream& operator>>(istream& in, pair<A, B> &p) {in >> p.first >> p.second; return in;}
template<class A, class B> ostream& operator<<(ostream& out, const pair<A, B> &p) {out << p.first << ' ' << p.second; return out;}
template<class T> istream& operator>>(istream& in, vector<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<T> &a) {for (auto &i: a) out << i << ' '; return out;}
template<class T> istream& operator>>(istream& in, vector<vector<T>> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const vector<vector<T>> &a) {for (auto &i: a) out << i << '\n'; return out;}
template<class T> istream& operator>>(istream& in, deque<T> &a) {for (auto &i: a) in >> i; return in;}
template<class T> ostream& operator<<(ostream& out, const deque<T> &a) {for (auto &i: a) out << i << ' '; return out;}
// istream& operator>>(istream& in, __int128_t &a) {string s; in >> s; a = 0; for (auto &i: s) a = a*10 + (i - '0'); return in;}
// ostream& operator<<(ostream& out, __int128_t a) {string s = ""; if (a < 0) s+='-', a = -a; if (a == 0) s+='0'; while (a > 0) {s+=(int)(a % 10) + '0'; a/=10;} Reverse(s); out << s; return out;}

template<class T>
struct segtree_lazy_max {
    int n, h;
    vector<T> t, d;
    T merge(T a, T b) {return max(a, b);}
    void init(int N) {n = N; h = 32 - __builtin_clz(n); t.assign(2*n, 0); d.assign(n, 0);}
    void apply(int i, T v) {
        t[i]+=v;
        if (i < n) d[i]+=v;
    }
    void rebuild(int i) {
        while (i > 1) i>>=1, t[i] = merge(t[i << 1], t[i << 1|1]) + d[i];
    }
    void push(int i) {
        for (int j = h; j > 0; --j) {
            int k = i >> j;
            if (d[k] != 0) {
                apply(k << 1, d[k]); apply(k << 1|1, d[k]);
                d[k] = 0;
            }
        }
    }
    void set(int l, int r, T v) {
        ++r;
        l+=n; r+=n;
        int L = l, R = r;
        for (; l < r; l>>=1, r>>=1) {
            if (l & 1) apply(l++, v);
            if (r & 1) apply(--r, v);
        }
        rebuild(L); rebuild(R - 1);
    }
    void build(const vector<T> &a) {
        for (int i = 0; i < n; ++i) t[i + n] = a[i];
        for (int i = n - 1; i > 0; --i) t[i] = merge(t[i << 1], t[i << 1|1]);
    }
    T get(int l, int r) {
        ++r;
        l+=n; r+=n;
        push(l); push(r - 1);
        T x = numeric_limits<T>::min();
        for (; l < r; l>>=1, r>>=1) {
            if (l & 1) x = merge(x, t[l++]);
            if (r & 1) x = merge(x, t[--r]);
        }
        return x;
    }
};
constexpr int N = 1e5 + 5;
struct edge {
    int v, i; ll w;
    edge(int v = 0, int i = 0, ll w = 0): v(v), i(i), w(w) {}
};
vector<edge> g[N];
int n, s[N];
bool del[N];
int dfs_sz(int u, int p) {
    s[u] = 1;
    for (auto [v, i, w]: g[u]) {
        if (v != p && !del[v]) s[u]+=dfs_sz(v, u);
    }
    return s[u];
}
int cen(int u, int p, int z) {
    for (auto [v, i, w]: g[u]) {
        if (v != p && !del[v] && (s[v] << 1) > z) return cen(v, u, z);
    }
    return u;
}
ll best2(const multiset<ll, greater<ll>> &t) {return t.empty() ? 0: sz(t) == 1 ? *t.begin(): *t.begin() + *next(t.begin());}
vi com[N], in[N], out[N], par[N], nxt[N];
multiset<ll, greater<ll>> st[N], ans;
segtree_lazy_max<ll> t[N];
int rt, tim, id[N];
ll dis[N];
void predfs(int u, int p) {
    com[rt].pb(u);
    for (auto [v, i, w]: g[u]) {
        if (v != p && !del[v]) predfs(v, u);
    }
}
void dfs(int u, int p) {
    if (u != rt) in[rt][id[u]] = ++tim, t[rt].set(tim, tim, dis[u]);
    for (auto [v, i, w]: g[u]) {
        if (v != p && !del[v]) {
            par[i].eb(rt);
            dis[v] = dis[u] + w;
            nxt[rt][id[v]] = u == rt ? id[v]: nxt[rt][id[u]];
            dfs(v, u);
        }
    }
    if (u != rt) out[rt][id[u]] = tim;
}
void decom(int u) {
    rt = u = cen(u, 0, dfs_sz(u, 0));
    del[u] = 1;
    for (auto [v, i, w]: g[u]) {
        if (!del[v]) predfs(v, u);
    }
    Sort(com[u]);
    int m = sz(com[u]);
    if (!m) return;
    in[u] = out[u] = nxt[u] = vi(m);
    dis[u] = 0;
    tim = -1;
    For(i,0,m) id[com[u][i]] = i;
    t[u].init(m);
    dfs(u, 0);
    for (auto [v, i, w]: g[u]) {
        if (!del[v]) st[u].insert(t[u].get(in[u][id[v]], out[u][id[v]])); //cout << v << ' ' << in[u][id[v]] << ' ' << out[u][id[v]] << ' ' << t[u].get(in[u][id[v]], out[u][id[v]]) << endl;
    }
    // cout << "cen " << u << endl << "ver " << com[u] << endl << "dis ";
    // trav(i,com[u]) cout << dis[i] << ' ';
    // cout << endl;
    // cout << endl;
    ans.insert(best2(st[u]));
    for (auto [v, i, w]: g[u]) {
        if (!del[v]) decom(v);
    }
}
ll ew[N];
pii ed[N];
int main() {
    ios_base::sync_with_stdio(0); cin.tie(NULL); cout.tie(NULL);
    cout << fixed << setprecision(10);
    int q; ll limw; cin >> n >> q >> limw;
    For(i,0,n-1){
        int u, v; ll w; cin >> u >> v >> w;
        g[u].eb(v, i, w); g[v].eb(u, i, w);
        ew[i] = w; ed[i] = {u, v};
    }
    decom(1);
    ll lst = 0;
    while (q--) {
        int i; ll w; cin >> i >> w;
        i = (i + lst) % (n - 1); w = (w + lst) % limw;
        ll dif = w - ew[i]; ew[i] = w;
        trav(u,par[i]){
            int idu = Lower(com[u], ed[i].first), idv = Lower(com[u], ed[i].second);
            if (ed[i].first == u);
            else if (ed[i].second == u) swap(idu, idv);
            else if (in[u][idu] > in[u][idv]) swap(idu, idv);
            int x = nxt[u][idv];
            // cout << idu << ' ' << idv << '\n';
            ans.extract(best2(st[u])); st[u].extract(t[u].get(in[u][x], out[u][x]));
            t[u].set(in[u][idv], out[u][idv], dif);
            st[u].insert(t[u].get(in[u][x], out[u][x])); ans.insert(best2(st[u]));
        }
        // cout << i << ' ' << w << ' ' << dif << ' ' << (lst = *ans.begin()) << '\n';
        cout << (lst = *ans.begin()) << '\n';
    }
    cerr << "\nProcess returned 0 (0x0)   execution time :  " << 0.001*clock() << " s";
    return 0;
}

• Subtask 1: 11 / 11
• Subtask 2: 13 / 13
• Subtask 3: 7 / 7
• Subtask 4: 18 / 18
• Subtask 5: 24 / 24
• Subtask 6: 27 / 27