結果
問題 | No.650 行列木クエリ |
ユーザー | fuppy_kyopro |
提出日時 | 2019-12-21 14:46:30 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 116 ms / 2,000 ms |
コード長 | 7,800 bytes |
コンパイル時間 | 2,300 ms |
コンパイル使用メモリ | 200,284 KB |
実行使用メモリ | 40,064 KB |
最終ジャッジ日時 | 2024-07-19 09:11:05 |
合計ジャッジ時間 | 3,491 ms |
ジャッジサーバーID (参考情報) |
judge3 / judge1 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 58 ms
10,624 KB |
testcase_02 | AC | 116 ms
35,712 KB |
testcase_03 | AC | 2 ms
5,376 KB |
testcase_04 | AC | 63 ms
10,624 KB |
testcase_05 | AC | 116 ms
35,840 KB |
testcase_06 | AC | 1 ms
5,376 KB |
testcase_07 | AC | 2 ms
5,376 KB |
testcase_08 | AC | 54 ms
11,392 KB |
testcase_09 | AC | 100 ms
40,064 KB |
testcase_10 | AC | 2 ms
5,376 KB |
ソースコード
#include <bits/stdc++.h> #include <unistd.h> using namespace std; #define DEBUG(x) cerr<<#x<<": "<<x<<endl; #define DEBUG_VEC(v) cerr<<#v<<":";for(int i=0;i<v.size();i++) cerr<<" "<<v[i]; cerr<<endl #define DEBUG_MAT(v) cerr<<#v<<endl;for(int i=0;i<v.size();i++){for(int j=0;j<v[i].size();j++) {cerr<<v[i][j]<<" ";}cerr<<endl;} typedef long long ll; #define int ll #define vi vector<int> #define vl vector<ll> #define vii vector< vector<int> > #define vll vector< vector<ll> > #define vs vector<string> #define pii pair<int,int> #define pis pair<int,string> #define psi pair<string,int> #define pll pair<ll,ll> template<class S, class T> pair<S, T> operator+(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first + t.first, s.second + t.second); } template<class S, class T> pair<S, T> operator-(const pair<S, T> &s, const pair<S, T> &t) { return pair<S, T>(s.first - t.first, s.second - t.second); } template<class S, class T> ostream& operator<<(ostream& os, pair<S, T> p) { os << "(" << p.first << ", " << p.second << ")"; return os; } #define X first #define Y second #define rep(i,n) for(int i=0;i<(n);i++) #define rep1(i,n) for(int i=1;i<=(n);i++) #define rrep(i,n) for(int i=(n)-1;i>=0;i--) #define rrep1(i,n) for(int i=(n);i>0;i--) #define REP(i,a,b) for(int i=a;i<b;i++) #define in(x, a, b) (a <= x && x < b) #define all(c) c.begin(),c.end() template<class T> bool chmax(T &a, const T &b) { if (a<b) { a = b; return 1; } return 0; } template<class T> bool chmin(T &a, const T &b) { if (a>b) { a = b; return 1; } return 0; } #define UNIQUE(v) v.erase(std::unique(v.begin(), v.end()), v.end()); const ll inf = 1000000001; const ll INF = (ll)1e18 + 1; const double pi = 3.14159265358979323846; #define Sp(p) cout<<setprecision(25)<< fixed<<p<<endl; int dx_ori[4] = { -1,0, 1,0 }, dy_ori[4] = { 0,1,0,-1 }; int dx[4] = {0, 0, 0, 0}, dy[4] = {0, 0, 0, 0}; int dx2[8] = { 1,1,0,-1,-1,-1,0,1 }, dy2[8] = { 0,1,1,1,0,-1,-1,-1 }; #define fio() cin.tie(0); ios::sync_with_stdio(false); const ll MOD = 1000000007; //const ll MOD = 998244353; // #define mp make_pair //#define endl '\n' template <typename T1, typename T2> class LazySegmentTree { public: using F = function<T1(T1&, T1&)>; // query_func using G = function<T2(T2&, T2&)>; // update_func using H = function<T1(T1&, T2&, int, int)>; // lazy to node (node, lazy, left, right) int n; vector<T1> node; vector<T2> lazy; T1 e1; T2 e2; F query_func; G update_func; H eval_func; LazySegmentTree(vector<T1> a, F query_func, G update_func, H eval_func, T1 e1, T2 e2) :query_func(query_func), update_func(update_func), eval_func(eval_func), e1(e1), e2(e2) { int _n = a.size(); n = 1; while (n < _n) n *= 2; node.resize(2 * n - 1, e1); lazy.resize(2 * n - 1, e2); for (int i = 0; i < _n; i++) node[i + n - 1] = a[i]; for (int i = n - 2; i >= 0; i--) { node[i] = query_func(node[i * 2 + 1], node[i * 2 + 2]); } } // k番目のノードについて遅延評価を行う inline void eval(int k, int l, int r) { if (lazy[k] != e2) { // Change node[k] = eval_func(node[k], lazy[k], l, r); if (r - l > 1) { lazy[2 * k + 1] = update_func(lazy[2*k + 1], lazy[k]); lazy[2 * k + 2] = update_func(lazy[2*k + 2], lazy[k]); } lazy[k] = e2; // Change } } // [a, b)をxにする void update(int a, int b, T2 x, int k, int l, int r) { // k 番目のノードに対して遅延評価を行う eval(k, l, r); if (b <= l || r <= a) return; if (a <= l && r <= b) { lazy[k] = update_func(lazy[k], x); eval(k, l, r); } else { update(a, b, x, 2 * k + 1, l, (l + r) / 2); update(a, b, x, 2 * k + 2, (l + r) / 2, r); node[k] = query_func(node[2 * k + 1], node[2 * k + 2]); } } T1 query(int a, int b, int k, int l, int r) { eval(k, l, r); if (b <= l || r <= a) return e1; if (a <= l && r <= b) return node[k]; T1 resl = query(a, b, 2 * k + 1, l, (l + r) / 2); T1 resr = query(a, b, 2 * k + 2, (l + r) / 2, r); return query_func(resl, resr); } }; class HLD { private: void dfs_sz(int v) { for(int &u:G[v]) if(u==par[v]) swap(u,G[v].back()); if(~par[v]) G[v].pop_back(); for(int &u:G[v]){ par[u]=v; dep[u]=dep[v]+1; dfs_sz(u); sub[v]+=sub[u]; if(sub[u]>sub[G[v][0]]) swap(u,G[v][0]); } } void dfs_hld(int v,int c,int &pos) { vid[v]=pos++; inv[vid[v]]=v; type[v]=c; for(int u:G[v]){ if(u==par[v]) continue; head[u]=(u==G[v][0]?head[v]:u); dfs_hld(u,c,pos); } } public: vector< vector<int> > G; vector<int> vid, head, sub, par, dep, inv, type; HLD(int n): G(n),vid(n,-1),head(n),sub(n,1), par(n,-1),dep(n,0),inv(n),type(n){} void add_edge(int u,int v) { G[u].emplace_back(v); G[v].emplace_back(u); } void build(vector<int> rs={0}) { int c=0,pos=0; for(int r:rs){ dfs_sz(r); head[r]=r; dfs_hld(r,c++,pos); } } int lca(int u,int v){ while(1){ if(vid[u]>vid[v]) swap(u,v); if(head[u]==head[v]) return u; v=par[head[v]]; } } int distance(int u,int v){ return dep[u]+dep[v]-2*dep[lca(u,v)]; } // for_each(vertex) // [l, r) <- attention!! template<typename F> void for_each(int u, int v, const F& f) { while(1){ if(vid[u]>vid[v]) swap(u,v); f(max(vid[head[v]],vid[u]),vid[v]+1); if(head[u]!=head[v]) v=par[head[v]]; else break; } } template<typename T,typename Q,typename F> T for_each(int u,int v,T ti,const Q &q,const F &f){ T l=ti,r=ti; while(1){ if(vid[u]>vid[v]){ swap(u,v); swap(l,r); } l=f(l,q(max(vid[head[v]],vid[u]),vid[v]+1)); if(head[u]!=head[v]) v=par[head[v]]; else break; } return f(l,r); } // for_each(edge) // [l, r) <- attention!! template<typename F> void for_each_edge(int u, int v,const F& f) { while(1){ if(vid[u]>vid[v]) swap(u,v); if(head[u]!=head[v]){ //DEBUG(pii(vid[head[v]],vid[v]+1)); f(vid[head[v]],vid[v]+1); v=par[head[v]]; }else{ if(u!=v) { //DEBUG(pii(vid[u] + 1,vid[v]+1)); f(vid[u]+1,vid[v]+1); } break; } } } }; signed main() { fio(); int n; cin >> n; HLD hld(n); vector<pii> edges(n - 1); rep (i, n - 1) { int u, v; cin >> u >> v; if (u > v) swap(u, v); edges[i] = pii(u, v); hld.add_edge(u, v); } hld.build(); using mat = array<array<ll, 2>, 2>; mat e; rep (i, 2) rep (j, 2) e[i][j] = i == j; auto mul = [](mat a, mat b) { mat res; rep (i, 2) rep (j, 2) { ll add = 0; rep (k, 2) { add += a[i][k] * b[k][j] % MOD; } res[i][j] = add % MOD; } return res; }; auto f = [=](mat a, mat b) {return mul(a, b);}; auto g = [](mat, mat b) {return b;}; auto h = [](mat, mat b, int, int) {return b;}; LazySegmentTree<mat, mat> seg(vector<mat>(n, e), f, g, h, e, e); int q; cin >> q; rep (i, q) { char t; cin >> t; if (t == 'x') { int i; cin >> i; mat x; rep (i, 2) rep (j, 2) cin >> x[i][j]; auto f = [&](int a, int b) { seg.update(a, b, x, 0, 0, seg.n); }; int u = edges[i].first, v = edges[i].second; hld.for_each_edge(u, v, f); } else { int u, v; cin >> u >> v; mat res = e; auto f = [&] (int a, int b) { res = mul(seg.query(a, b, 0, 0, seg.n), res); }; assert(hld.vid[v] >= hld.vid[u]); //DEBUG(pii(u, v)); hld.for_each_edge(u, v, f); rep (i, 2) rep (j, 2) { cout << res[i][j] << " "; } cout << endl; } } }