oj.uz

답안 #922528

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
922528 2024-02-05T16:08:26 Z huutuan Sprinkler (JOI22_sprinkler) C++14
41 / 100
 4000 ms 817344 KB 
#include<bits/stdc++.h>

using namespace std;

// #define int long long
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define isz(x) ((int)x.size())
#define sumof(x) accumulate(all(x), 0ll)

int mod;

struct SegmentTree{
   int n;
   vector<pair<int, int>> t;
   void init(int _n){
      n=_n;
      t.assign(4*n+1, {1, 1});
   }
   void apply(int k, int val){
      t[k].first=1ll*t[k].first*val%mod;
      t[k].second=1ll*t[k].second*val%mod;
   }
   void push(int k){
      if (t[k].second!=1){
         apply(k<<1, t[k].second);
         apply(k<<1|1, t[k].second);
         t[k].second=1;
      }
   }
   void update(int k, int l, int r, int L, int R, int val){
      if (r<L || R<l) return;
      if (L<=l && r<=R){
         apply(k, val);
         return;
      }
      push(k);
      int mid=(l+r)>>1;
      update(k<<1, l, mid, L, R, val);
      update(k<<1|1, mid+1, r, L, R, val);
      // t[k]=t[k<<1]+t[k<<1|1];
      t[k].first=1ll*t[k<<1].first*t[k<<1|1].first%mod;
   }
   pair<int, int> get(int k, int l, int r, int pos){
      if (l==r) return t[k];
      push(k);
      int mid=(l+r)>>1;
      if (pos<=mid) return get(k<<1, l, mid, pos);
      return get(k<<1|1, mid+1, r, pos);
   }
};

const int N=2e5+10;
int n, q, tin[N], tout[N], tdfs, par[N], idx[N], h[N];
SegmentTree mult[N][42];
vector<int> g[N];

void dfs(int u, int p){
   par[u]=p;
   tin[u]=++tdfs;
   if (p) g[u].erase(find(all(g[u]), p));
   for (int i=0; i<isz(g[u]); ++i){
      idx[g[u][i]]=i;
      dfs(g[u][i], u);
   }
   for (int i=0; i<=41; ++i) mult[u][i].init(g[u].size());
   tout[u]=tdfs;
}

int cnt=0;

void update(int u, int d, int w){
   int lca=u;
   // for (int i=0; i<=d; ++i) mult[u][i].update(1, 0, isz(g[u])-1, 0, isz(g[u])-1, w);
   for (int i=41-d; i<=41; i+=i&(-i)) mult[u][i].update(1, 0, isz(g[u])-1, 0, isz(g[u])-1, w), cnt+=isz(g[u]);
   h[u]=1ll*h[u]*w%mod;
   while (par[lca] && (--d)>=0){
      int p=par[lca];
      h[p]=1ll*h[p]*w%mod;
      int t=idx[lca];
      // for (int i=0; i<=d; ++i){
      //    mult[p][i].update(1, 0, isz(g[p])-1, 0, t-1, w);
      //    mult[p][i].update(1, 0, isz(g[p])-1, t+1, isz(g[p])-1, w);
      // }
      for (int i=41-d; i<=41; i+=i&(-i)){
         cnt+=isz(g[p]);
         mult[p][i].update(1, 0, isz(g[p])-1, 0, t-1, w);
         mult[p][i].update(1, 0, isz(g[p])-1, t+1, isz(g[p])-1, w);
      }
      lca=par[lca];
   }
}

int query(int u){
   int val=h[u];
   int lca=u, dist=0;
   while (par[lca] && (++dist)<=40){
      int p=par[lca];
      // val=1ll*val*mult[p][dist].get(1, 0, isz(g[p])-1, idx[lca]).first%mod;
      for (int i=41-dist; i; i-=i&(-i)) val=1ll*val*mult[p][i].get(1, 0, isz(g[p])-1, idx[lca]).first%mod, cnt+=isz(g[p]);
      lca=par[lca];
   }
   return val;
}

void solve(){
   #ifdef sus
   freopen("cf.inp", "r", stdin);
   freopen("cf.out", "w", stdout);
   #endif
   cin >> n >> mod;
   for (int i=0; i<n-1; ++i){
      int u, v; cin >> u >> v;
      g[u].push_back(v);
      g[v].push_back(u);
   }
   dfs(1, 0);
   for (int i=1; i<=n; ++i) cin >> h[i];
   cin >> q;
   while (q--){
      int o; cin >> o;
      if (o==1){
         int u, d, w; cin >> u >> d >> w;
         update(u, d, w);
      }else{
         int u; cin >> u;
         cout << query(u) << '\n';
      }
   }
   // cerr << cnt << endl;
}

int32_t main(){
   ios_base::sync_with_stdio(false);
   cin.tie(nullptr);
   int ntests=1;
   // cin >> ntests;
   for (int i=1; i<=ntests; ++i) solve();
   return 0;
}

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 268420 KB Output is correct
2 Correct 118 ms 268064 KB Output is correct
3 Correct 117 ms 268200 KB Output is correct
4 Correct 123 ms 270260 KB Output is correct
5 Correct 131 ms 270404 KB Output is correct
6 Correct 120 ms 270380 KB Output is correct
7 Correct 146 ms 270644 KB Output is correct
8 Correct 122 ms 270768 KB Output is correct
9 Correct 117 ms 268024 KB Output is correct
10 Correct 110 ms 268092 KB Output is correct
11 Correct 110 ms 268144 KB Output is correct
12 Correct 112 ms 268116 KB Output is correct
13 Correct 111 ms 267996 KB Output is correct
14 Correct 155 ms 268208 KB Output is correct
15 Correct 111 ms 268120 KB Output is correct
16 Correct 118 ms 268372 KB Output is correct
17 Correct 114 ms 268000 KB Output is correct
18 Correct 112 ms 268048 KB Output is correct
19 Correct 112 ms 268200 KB Output is correct
20 Correct 123 ms 268296 KB Output is correct
21 Correct 112 ms 268116 KB Output is correct
22 Correct 121 ms 268116 KB Output is correct
23 Correct 114 ms 268100 KB Output is correct
24 Correct 120 ms 268264 KB Output is correct
25 Correct 108 ms 268116 KB Output is correct
26 Correct 112 ms 268212 KB Output is correct
27 Correct 111 ms 268124 KB Output is correct
28 Correct 112 ms 268328 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 268200 KB Output is correct
2 Correct 3890 ms 733328 KB Output is correct
3 Correct 1418 ms 733456 KB Output is correct
4 Correct 2322 ms 694948 KB Output is correct
5 Correct 2695 ms 733392 KB Output is correct
6 Correct 1434 ms 750620 KB Output is correct
7 Correct 1523 ms 763772 KB Output is correct
8 Correct 1064 ms 817328 KB Output is correct
9 Correct 3439 ms 699772 KB Output is correct
10 Correct 1302 ms 698796 KB Output is correct
11 Correct 3911 ms 732972 KB Output is correct
12 Correct 1491 ms 733648 KB Output is correct
13 Correct 899 ms 804036 KB Output is correct
14 Correct 1116 ms 805784 KB Output is correct
15 Correct 1104 ms 805348 KB Output is correct
16 Correct 1064 ms 806856 KB Output is correct
17 Correct 1255 ms 805200 KB Output is correct
18 Correct 113 ms 268204 KB Output is correct
19 Correct 115 ms 267992 KB Output is correct
20 Correct 117 ms 268048 KB Output is correct
21 Correct 110 ms 268076 KB Output is correct
22 Correct 112 ms 268112 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 109 ms 268200 KB Output is correct
2 Correct 3890 ms 733328 KB Output is correct
3 Correct 1418 ms 733456 KB Output is correct
4 Correct 2322 ms 694948 KB Output is correct
5 Correct 2695 ms 733392 KB Output is correct
6 Correct 1434 ms 750620 KB Output is correct
7 Correct 1523 ms 763772 KB Output is correct
8 Correct 1064 ms 817328 KB Output is correct
9 Correct 3439 ms 699772 KB Output is correct
10 Correct 1302 ms 698796 KB Output is correct
11 Correct 3911 ms 732972 KB Output is correct
12 Correct 1491 ms 733648 KB Output is correct
13 Correct 899 ms 804036 KB Output is correct
14 Correct 1116 ms 805784 KB Output is correct
15 Correct 1104 ms 805348 KB Output is correct
16 Correct 1064 ms 806856 KB Output is correct
17 Correct 1255 ms 805200 KB Output is correct
18 Correct 113 ms 268204 KB Output is correct
19 Correct 115 ms 267992 KB Output is correct
20 Correct 117 ms 268048 KB Output is correct
21 Correct 110 ms 268076 KB Output is correct
22 Correct 112 ms 268112 KB Output is correct
23 Correct 108 ms 268116 KB Output is correct
24 Correct 3779 ms 732856 KB Output is correct
25 Correct 1576 ms 733824 KB Output is correct
26 Correct 2379 ms 699220 KB Output is correct
27 Correct 2666 ms 733276 KB Output is correct
28 Correct 1519 ms 750624 KB Output is correct
29 Correct 1465 ms 763240 KB Output is correct
30 Correct 1170 ms 817344 KB Output is correct
31 Correct 3390 ms 695244 KB Output is correct
32 Correct 1306 ms 699116 KB Output is correct
33 Correct 3796 ms 732852 KB Output is correct
34 Correct 1530 ms 733628 KB Output is correct
35 Correct 121 ms 268220 KB Output is correct
36 Correct 112 ms 268112 KB Output is correct
37 Correct 123 ms 268116 KB Output is correct
38 Correct 118 ms 268156 KB Output is correct
39 Correct 118 ms 268204 KB Output is correct
40 Correct 113 ms 268116 KB Output is correct
41 Correct 113 ms 268116 KB Output is correct
42 Correct 113 ms 268204 KB Output is correct
43 Correct 117 ms 268112 KB Output is correct
44 Correct 114 ms 268112 KB Output is correct
45 Correct 112 ms 268116 KB Output is correct
46 Correct 112 ms 268112 KB Output is correct
47 Correct 115 ms 267980 KB Output is correct
48 Correct 113 ms 268204 KB Output is correct
49 Correct 115 ms 268112 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 112 ms 268056 KB Output is correct
2 Correct 3612 ms 696400 KB Output is correct
3 Correct 2017 ms 693756 KB Output is correct
4 Correct 2661 ms 694120 KB Output is correct
5 Execution timed out 4078 ms 730628 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 113 ms 268196 KB Output is correct
2 Correct 3453 ms 694256 KB Output is correct
3 Correct 1873 ms 690500 KB Output is correct
4 Correct 2726 ms 692608 KB Output is correct
5 Execution timed out 4089 ms 732056 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 123 ms 268420 KB Output is correct
2 Correct 118 ms 268064 KB Output is correct
3 Correct 117 ms 268200 KB Output is correct
4 Correct 123 ms 270260 KB Output is correct
5 Correct 131 ms 270404 KB Output is correct
6 Correct 120 ms 270380 KB Output is correct
7 Correct 146 ms 270644 KB Output is correct
8 Correct 122 ms 270768 KB Output is correct
9 Correct 117 ms 268024 KB Output is correct
10 Correct 110 ms 268092 KB Output is correct
11 Correct 110 ms 268144 KB Output is correct
12 Correct 112 ms 268116 KB Output is correct
13 Correct 111 ms 267996 KB Output is correct
14 Correct 155 ms 268208 KB Output is correct
15 Correct 111 ms 268120 KB Output is correct
16 Correct 118 ms 268372 KB Output is correct
17 Correct 114 ms 268000 KB Output is correct
18 Correct 112 ms 268048 KB Output is correct
19 Correct 112 ms 268200 KB Output is correct
20 Correct 123 ms 268296 KB Output is correct
21 Correct 112 ms 268116 KB Output is correct
22 Correct 121 ms 268116 KB Output is correct
23 Correct 114 ms 268100 KB Output is correct
24 Correct 120 ms 268264 KB Output is correct
25 Correct 108 ms 268116 KB Output is correct
26 Correct 112 ms 268212 KB Output is correct
27 Correct 111 ms 268124 KB Output is correct
28 Correct 112 ms 268328 KB Output is correct
29 Correct 109 ms 268200 KB Output is correct
30 Correct 3890 ms 733328 KB Output is correct
31 Correct 1418 ms 733456 KB Output is correct
32 Correct 2322 ms 694948 KB Output is correct
33 Correct 2695 ms 733392 KB Output is correct
34 Correct 1434 ms 750620 KB Output is correct
35 Correct 1523 ms 763772 KB Output is correct
36 Correct 1064 ms 817328 KB Output is correct
37 Correct 3439 ms 699772 KB Output is correct
38 Correct 1302 ms 698796 KB Output is correct
39 Correct 3911 ms 732972 KB Output is correct
40 Correct 1491 ms 733648 KB Output is correct
41 Correct 899 ms 804036 KB Output is correct
42 Correct 1116 ms 805784 KB Output is correct
43 Correct 1104 ms 805348 KB Output is correct
44 Correct 1064 ms 806856 KB Output is correct
45 Correct 1255 ms 805200 KB Output is correct
46 Correct 113 ms 268204 KB Output is correct
47 Correct 115 ms 267992 KB Output is correct
48 Correct 117 ms 268048 KB Output is correct
49 Correct 110 ms 268076 KB Output is correct
50 Correct 112 ms 268112 KB Output is correct
51 Correct 108 ms 268116 KB Output is correct
52 Correct 3779 ms 732856 KB Output is correct
53 Correct 1576 ms 733824 KB Output is correct
54 Correct 2379 ms 699220 KB Output is correct
55 Correct 2666 ms 733276 KB Output is correct
56 Correct 1519 ms 750624 KB Output is correct
57 Correct 1465 ms 763240 KB Output is correct
58 Correct 1170 ms 817344 KB Output is correct
59 Correct 3390 ms 695244 KB Output is correct
60 Correct 1306 ms 699116 KB Output is correct
61 Correct 3796 ms 732852 KB Output is correct
62 Correct 1530 ms 733628 KB Output is correct
63 Correct 121 ms 268220 KB Output is correct
64 Correct 112 ms 268112 KB Output is correct
65 Correct 123 ms 268116 KB Output is correct
66 Correct 118 ms 268156 KB Output is correct
67 Correct 118 ms 268204 KB Output is correct
68 Correct 113 ms 268116 KB Output is correct
69 Correct 113 ms 268116 KB Output is correct
70 Correct 113 ms 268204 KB Output is correct
71 Correct 117 ms 268112 KB Output is correct
72 Correct 114 ms 268112 KB Output is correct
73 Correct 112 ms 268116 KB Output is correct
74 Correct 112 ms 268112 KB Output is correct
75 Correct 115 ms 267980 KB Output is correct
76 Correct 113 ms 268204 KB Output is correct
77 Correct 115 ms 268112 KB Output is correct
78 Correct 112 ms 268056 KB Output is correct
79 Correct 3612 ms 696400 KB Output is correct
80 Correct 2017 ms 693756 KB Output is correct
81 Correct 2661 ms 694120 KB Output is correct
82 Execution timed out 4078 ms 730628 KB Time limit exceeded
83 Halted 0 ms 0 KB -