結果
問題 | No.2296 Union Path Query (Hard) |
ユーザー |
![]() |
提出日時 | 2023-05-05 22:36:34 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 849 ms / 7,000 ms |
コード長 | 11,914 bytes |
コンパイル時間 | 2,473 ms |
コンパイル使用メモリ | 155,308 KB |
最終ジャッジ日時 | 2025-02-12 18:54:29 |
ジャッジサーバーID (参考情報) |
judge5 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 4 |
other | AC * 45 |
ソースコード
//#pragma GCC optimize("O3")//#pragma GCC optimize("unroll-loops")#include<iostream>#include<string>#include<cstdio>#include<vector>#include<cmath>#include<algorithm>#include<functional>#include<iomanip>#include<queue>#include<ciso646>#include<random>#include<map>#include<set>#include<bitset>#include<stack>#include<unordered_map>#include<unordered_set>#include<utility>#include<cassert>#include<complex>#include<numeric>#include<array>#include<chrono>using namespace std;//#define int long longtypedef long long ll;typedef unsigned long long ul;typedef unsigned int ui;//ll mod = 1;constexpr ll mod = 998244353;//constexpr ll mod = 1000000007;const int mod17 = 1000000007;const ll INF = mod * mod;typedef pair<int, int>P;#define rep(i,n) for(int i=0;i<n;i++)#define per(i,n) for(int i=n-1;i>=0;i--)#define Rep(i,sta,n) for(int i=sta;i<n;i++)#define rep1(i,n) for(int i=1;i<=n;i++)#define per1(i,n) for(int i=n;i>=1;i--)#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)#define all(v) (v).begin(),(v).end()typedef pair<ll, ll> LP;using ld = long double;typedef pair<ld, ld> LDP;const ld eps = 1e-10;const ld pi = acosl(-1.0);template<typename T>void chmin(T& a, T b) {a = min(a, b);}template<typename T>void chmax(T& a, T b) {a = max(a, b);}template<typename T>vector<T> vmerge(vector<T>& a, vector<T>& b) {vector<T> res;int ida = 0, idb = 0;while (ida < a.size() || idb < b.size()) {if (idb == b.size()) {res.push_back(a[ida]); ida++;}else if (ida == a.size()) {res.push_back(b[idb]); idb++;}else {if (a[ida] < b[idb]) {res.push_back(a[ida]); ida++;}else {res.push_back(b[idb]); idb++;}}}return res;}template<typename T>void cinarray(vector<T>& v) {rep(i, v.size())cin >> v[i];}template<typename T>void coutarray(vector<T>& v) {rep(i, v.size()) {if (i > 0)cout << " "; cout << v[i];}cout << "\n";}ll mod_pow(ll x, ll n, ll m = mod) {if (n < 0) {ll res = mod_pow(x, -n, m);return mod_pow(res, m - 2, m);}if (abs(x) >= m)x %= m;if (x < 0)x += m;//if (x == 0)return 0;ll res = 1;while (n) {if (n & 1)res = res * x % m;x = x * x % m; n >>= 1;}return res;}//mod should be <2^31struct modint {int n;modint() :n(0) { ; }modint(ll m) {if (m < 0 || mod <= m) {m %= mod; if (m < 0)m += mod;}n = m;}operator int() { return n; }};bool operator==(modint a, modint b) { return a.n == b.n; }bool operator<(modint a, modint b) { return a.n < b.n; }modint operator+=(modint& a, modint b) { a.n += b.n; if (a.n >= mod)a.n -= (int)mod; return a; }modint operator-=(modint& a, modint b) { a.n -= b.n; if (a.n < 0)a.n += (int)mod; return a; }modint operator*=(modint& a, modint b) { a.n = ((ll)a.n * b.n) % mod; return a; }modint operator+(modint a, modint b) { return a += b; }modint operator-(modint a, modint b) { return a -= b; }modint operator*(modint a, modint b) { return a *= b; }modint operator^(modint a, ll n) {if (n == 0)return modint(1);modint res = (a * a) ^ (n / 2);if (n % 2)res = res * a;return res;}ll inv(ll a, ll p) {return (a == 1 ? 1 : (1 - p * inv(p % a, a)) / a + p);}modint operator/(modint a, modint b) { return a * modint(inv(b, mod)); }modint operator/=(modint& a, modint b) { a = a / b; return a; }const int max_n = 1 << 20;modint fact[max_n], factinv[max_n];void init_f() {fact[0] = modint(1);for (int i = 0; i < max_n - 1; i++) {fact[i + 1] = fact[i] * modint(i + 1);}factinv[max_n - 1] = modint(1) / fact[max_n - 1];for (int i = max_n - 2; i >= 0; i--) {factinv[i] = factinv[i + 1] * modint(i + 1);}}modint comb(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[b] * factinv[a - b];}modint combP(int a, int b) {if (a < 0 || b < 0 || a < b)return 0;return fact[a] * factinv[a - b];}ll gcd(ll a, ll b) {a = abs(a); b = abs(b);if (a < b)swap(a, b);while (b) {ll r = a % b; a = b; b = r;}return a;}template<typename T>void addv(vector<T>& v, int loc, T val) {if (loc >= v.size())v.resize(loc + 1, 0);v[loc] += val;}/*const int mn = 2000005;bool isp[mn];vector<int> ps;void init() {fill(isp + 2, isp + mn, true);for (int i = 2; i < mn; i++) {if (!isp[i])continue;ps.push_back(i);for (int j = 2 * i; j < mn; j += i) {isp[j] = false;}}}*///[,val)template<typename T>auto prev_itr(set<T>& st, T val) {auto res = st.lower_bound(val);if (res == st.begin())return st.end();res--; return res;}//[val,)template<typename T>auto next_itr(set<T>& st, T val) {auto res = st.lower_bound(val);return res;}using mP = pair<modint, modint>;mP operator+(mP a, mP b) {return { a.first + b.first,a.second + b.second };}mP operator+=(mP& a, mP b) {a = a + b; return a;}mP operator-(mP a, mP b) {return { a.first - b.first,a.second - b.second };}mP operator-=(mP& a, mP b) {a = a - b; return a;}LP operator+(LP a, LP b) {return { a.first + b.first,a.second + b.second };}LP operator+=(LP& a, LP b) {a = a + b; return a;}LP operator-(LP a, LP b) {return { a.first - b.first,a.second - b.second };}LP operator-=(LP& a, LP b) {a = a - b; return a;}mt19937 mt(time(0));const string drul = "DRUL";string senw = "SENW";//DRUL,or SENW//int dx[4] = { 1,0,-1,0 };//int dy[4] = { 0,1,0,-1 };//-----------------------------------------// 以下の実装では link, range, query などで reroot が起こるので注意template<typename T> class LinkCutTree {public:struct node {int sz;T val, al, lazy;node* left, * right, * par;bool rev;node(const T _val) : sz(1), val(_val), al(_val), lazy(e1),left(nullptr), right(nullptr), par(nullptr), rev(false) {}bool isRoot() const {return (!par) || (par->left != this && par->right != this);}void push() {if (lazy != e1) {opr1(val, lazy), al += lazy * sz;if (left) opr1(left->lazy, lazy);if (right) opr1(right->lazy, lazy);lazy = e1;}if (!rev) return;swap(left, right);if (left) left->rev = !(left->rev);if (right) right->rev = !(right->rev);rev = false;}void eval() {sz = 1, al = val;if (left) left->push(), sz += left->sz, al = opr2(left->al, al);if (right) right->push(), sz += right->sz, al = opr2(al, right->al);}};static const T e1 = (T)0;static void opr1(T& arg1, const T arg2) {arg1 += arg2;}static T opr2(const T arg1, const T arg2) {return arg1 + arg2;}private:// 回転void rotate(node* u, bool right) {node* p = u->par, * g = p->par;if (right) {if ((p->left = u->right)) u->right->par = p;u->right = p, p->par = u;}else {if ((p->right = u->left)) u->left->par = p;u->left = p, p->par = u;}p->eval(), u->eval(), u->par = g;if (!g) return;if (g->left == p) g->left = u;if (g->right == p) g->right = u;g->eval();}// u を splay 木の根にするvoid splay(node* u) {while (!(u->isRoot())) {node* p = u->par, * gp = p->par;if (p->isRoot()) { // zigp->push(), u->push();rotate(u, (u == p->left));}else {gp->push(), p->push(), u->push();bool flag = (u == p->left);if ((u == p->left) == (p == gp->left)) { // zig-zigrotate(p, flag), rotate(u, flag);}else { // zig-zagrotate(u, flag), rotate(u, !flag);}}}u->push();}node* access(node* u) {node* last = nullptr;for (node* v = u; v; v = v->par) {splay(v);v->right = last;v->eval();last = v;}splay(u);return last;}bool connected(node* u, node* v) {access(u), access(v);return u == v || u->par;}void link(node* u, node* v) {evert(u), u->par = v;}void cut(node* u) {access(u);u->left->par = nullptr, u->left = nullptr, u->eval();}void cut(node* u, node* v) {access(u), access(v);if (u->isRoot()) u->par = nullptr;else v->left->par = nullptr, v->left = nullptr, v->eval();}node* lca(node* u, node* v) {access(u);return access(v);}void evert(node* u) {access(u);u->rev = !(u->rev), u->push();}int depth(node* u) {access(u);return u->sz - 1;}void toRoot_range(node* u, const T x) {access(u);opr1(u->lazy, x), u->push();}T toRoot_query(node* u) {access(u);return u->al;}void range(node* u, node* v, const T x) {evert(u), access(v);opr1(v->lazy, x), v->push();}T query(node* u, node* v) {evert(u), access(v);return v->al;}public:const int V;node** arr;LinkCutTree(const vector<T>& init_node_value): V((int)init_node_value.size()) {arr = new node * [V];for (int i = 0; i < V; ++i) {arr[i] = new node(init_node_value[i]);}}// ~LinkCutTree(){// for(int i = 0; i < V; ++i){// delete arr[i];// }// delete[] arr;// }// id1 と id2 が同じ木(連結成分)に属するかbool connected(int id1, int id2) { return connected(arr[id1], arr[id2]); }// id1 を id2 の non-preferred edge にするvoid link(int id1, int id2) { return link(arr[id1], arr[id2]); }// id とその親の間の辺を削除するvoid cut(int id) { return cut(arr[id]); }// id と id2 の間の辺を削除するvoid cut(int id1, int id2) { return cut(arr[id1], arr[id2]); }// id1 と id2 の LCA を求めるint lca(int id1, int id2) { return static_cast<size_t>(lca(arr[id1], arr[id2]) - arr[0]); }// 元の木の根を id にするvoid evert(int id) { return evert(arr[id]); }// id の深さを求めるint depth(int id) { return depth(arr[id]); }// id から根までの間にある頂点すべてに x を足すvoid toRoot_range(int id, const T x) { return toRoot_range(arr[id], x); }// id から根までの間にある頂点すべてのコストの総和を求めるT toRoot_query(int id) { return toRoot_query(arr[id]); }// id1 と id2 の間にある頂点すべてに x を足すvoid range(int id1, int id2, const T x) { return range(arr[id1], arr[id2], x); }// id1 と id2 の間にある頂点すべてのコストの総和を求めるT query(int id1, int id2) { return query(arr[id1], arr[id2]); }};void solve() {int n, x, q; cin >> n >> x >> q;vector<int> par(n);vector<int> sz(n);vector<P> mem(n);rep(i, n) {par[i] = i;mem[i] = { i,i };sz[i] = 1;}vector<ll> ori(2 * n - 1, 0);LinkCutTree<ll> lt(ori);int tmp = n;auto calcd = [&](int a, int b)->ll {if (!lt.connected(a, b))return -1;lt.evert(a);return lt.toRoot_query(b);};auto merge = [&](int a, int b, int w) {//cout << "add " << a << " " << b << " " << w << "\n";lt.evert(a);lt.link(a, tmp);lt.evert(b);lt.link(b, tmp);lt.evert(tmp);lt.toRoot_range(tmp, w);tmp++;while (a != par[a])a = par[a];while (b != par[b])b = par[b];if (sz[a] > sz[b])swap(a, b);par[a] = b;sz[b] += sz[a];ll ma = -1;vector<int> vs;vs.push_back(mem[a].first);vs.push_back(mem[a].second);vs.push_back(mem[b].first);vs.push_back(mem[b].second);rep(i, vs.size())Rep(j, i + 1, vs.size()) {ll val = calcd(vs[i], vs[j]);if (val > ma) {ma = val; mem[b] = { vs[i],vs[j] };}}};auto query1 = [&](int v) {while (par[v] != v)v = par[v];int le = mem[v].first;int ri = mem[v].second;return calcd(le, ri);};rep(i, q) {int t; cin >> t;if (t == 1) {int a, w; cin >> a >> w;merge(a, x, w);}else if (t == 2) {int a, b; cin >> a >> b;ll c = calcd(a, b);cout << c << "\n";if (c >= 0) {c %= n;x += c; x %= n;}}else if (t == 3) {int a; cin >> a;ll ans = query1(a);cout << ans << "\n";}else {int v; cin >> v; x += v; x %= n;}}}signed main() {ios::sync_with_stdio(false);cin.tie(0);cout << fixed << setprecision(15);//init_f();//init();//while(true)//expr();//int t; cin >> t; rep(i, t)solve();return 0;}