oj.uz

답안 #615127

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
615127 2022-07-31T07:02:05 Z 반딧불(#8492) Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 895556 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("O3")
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")

using namespace std;

typedef long long ll;
ll MOD;

struct Query{
    int l, r; ll v;
    Query(){}
    Query(int l, int r, ll v): l(l), r(r), v(v){}
};

struct segTree{
    ll tree[800002], lazy[800002];

    void init(int i, int l, int r){
        tree[i] = 1, lazy[i] = 1;
        if(l==r) return;
        int m = (l+r)>>1;
        init(i*2, l, m);
        init(i*2+1, m+1, r);
    }

    void propagate(int i, int l, int r){
        if(lazy[i]==1) return;
        if(l==r) tree[i] = (tree[i] * lazy[i]) % MOD;
        else lazy[i*2] = (lazy[i*2] * lazy[i]) % MOD, lazy[i*2+1] = (lazy[i*2+1] * lazy[i]) % MOD;
        lazy[i] = 1;
    }

    void update(int i, int l, int r, int s, int e, ll v){
        propagate(i, l, r);
        if(r<s || e<l) return;
        if(s<=l && r<=e){
            lazy[i] = v;
            propagate(i, l, r);
            return;
        }
        int m = (l+r)>>1;
        update(i*2, l, m, s, e, v);
        update(i*2+1, m+1, r, s, e, v);
    }

    ll query(int i, int l, int r, int x){
        propagate(i, l, r);
        if(l==r) return tree[i];
        int m = (l+r)>>1;
        if(x<=m) return query(i*2, l, m, x);
        else return query(i*2+1, m+1, r, x);
    }
} tree;

int n, q;
vector<int> link[200002];
ll arr[200002];
int in[200002], idx[200002], par[200002], depth[200002], inCnt;
int childL[200002][42], childR[200002][42];

void bfs(int x){
    queue<int> que;
    que.push(1);
    while(!que.empty()){
        int x = que.front(); que.pop();
        in[x] = ++inCnt;
        idx[inCnt] = x;
        for(auto y: link[x]){
            if(in[y]) continue;
            par[y] = x;
            depth[y] = depth[x] + 1;
            link[y].erase(find(link[y].begin(), link[y].end(), x));
            que.push(y);
        }
    }
}

void dfs(int x, int p=-1){
    childL[x][0] = childR[x][0] = in[x];
    for(auto y: link[x]){
        dfs(y);
        for(int i=1; i<=40; i++){
            childL[x][i] = min(childL[x][i], childL[y][i-1]);
            childR[x][i] = max(childR[x][i], childR[y][i-1]);
        }
    }
}

int treeL[82], treeR[82];
vector<Query> queryVec[200002];

int main(){
    scanf("%d %lld", &n, &MOD);
    for(int i=1; i<n; i++){
        int x, y;
        scanf("%d %d", &x, &y);
        link[x].push_back(y);
        link[y].push_back(x);
    }
    for(int i=1; i<=n; i++) scanf("%lld", &arr[i]);
    bfs(1);
    tree.init(1, 1, n);
    for(int i=1; i<=n; i++) tree.update(1, 1, n, in[i], in[i], arr[i]);
    for(int i=1; i<=n; i++){
        for(int j=0; j<=40; j++){
            childL[i][j] = 1e9;
            childR[i][j] = -1;
        }
    }
    dfs(1);

    scanf("%d", &q);
    while(q--){
        int qt;
        scanf("%d", &qt);
        if(qt==1){
            int x, d, dp; ll w;
            scanf("%d %d %lld", &x, &d, &w);
            dp=depth[x];
            for(int i=0; i<=d+d; i++) treeL[i] = 1e9, treeR[i] = -1;
            int up = 0;
            for(up=0; up<=d; up++){
                /// ������ �ִ� ����: d-up-up
                treeL[d+d-up-up] = min(treeL[d+d-up-up], childL[x][d-up]);
                treeR[d+d-up-up] = max(treeR[d+d-up-up], childR[x][d-up]);
                if(up==d) break;
                /// ������ �ִ� ����: d-up-up-1
                treeL[d+d-up-up-1] = min(treeL[d+d-up-up-1], childL[x][d-up-1]);
                treeR[d+d-up-up-1] = max(treeR[d+d-up-up-1], childR[x][d-up-1]);

                if(!par[x]) break;
                x = par[x];
            }
            for(int cnt=0; cnt+up<=d; cnt++){
                treeL[d-up+cnt] = min(treeL[d-up+cnt], childL[x][cnt]);
                treeR[d-up+cnt] = max(treeR[d-up+cnt], childR[x][cnt]);
            }

            for(int i=0; i<=d+d; i++){
                if(treeL[i] == 1e9) continue;
                queryVec[dp-d+i].push_back(Query(treeL[i], treeR[i], w));
            }
        }
        else{
            int x;
            scanf("%d", &x);
            while(!queryVec[depth[x]].empty()){
                Query tmp = queryVec[depth[x]].back();
                queryVec[depth[x]].pop_back();
                tree.update(1, 1, n, tmp.l, tmp.r, tmp.v);
            }
            printf("%lld\n", tree.query(1, 1, n, in[x]));
        }
    }
}

Compilation message

sprinkler.cpp: In function 'int main()':
sprinkler.cpp:95:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   95 |     scanf("%d %lld", &n, &MOD);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~
sprinkler.cpp:98:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   98 |         scanf("%d %d", &x, &y);
      |         ~~~~~^~~~~~~~~~~~~~~~~
sprinkler.cpp:102:34: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  102 |     for(int i=1; i<=n; i++) scanf("%lld", &arr[i]);
      |                             ~~~~~^~~~~~~~~~~~~~~~~
sprinkler.cpp:114:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  114 |     scanf("%d", &q);
      |     ~~~~~^~~~~~~~~~
sprinkler.cpp:117:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  117 |         scanf("%d", &qt);
      |         ~~~~~^~~~~~~~~~~
sprinkler.cpp:120:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  120 |             scanf("%d %d %lld", &x, &d, &w);
      |             ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
sprinkler.cpp:148:18: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
  148 |             scanf("%d", &x);
      |             ~~~~~^~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9708 KB Output is correct
4 Correct 10 ms 10660 KB Output is correct
5 Correct 14 ms 10340 KB Output is correct
6 Correct 11 ms 10252 KB Output is correct
7 Correct 8 ms 10196 KB Output is correct
8 Correct 9 ms 10236 KB Output is correct
9 Correct 6 ms 9716 KB Output is correct
10 Correct 7 ms 9728 KB Output is correct
11 Correct 7 ms 9728 KB Output is correct
12 Correct 9 ms 9664 KB Output is correct
13 Correct 6 ms 9724 KB Output is correct
14 Correct 8 ms 9684 KB Output is correct
15 Correct 10 ms 9752 KB Output is correct
16 Correct 9 ms 9692 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 9 ms 9764 KB Output is correct
20 Correct 9 ms 9684 KB Output is correct
21 Correct 8 ms 9684 KB Output is correct
22 Correct 8 ms 9684 KB Output is correct
23 Correct 8 ms 9768 KB Output is correct
24 Correct 7 ms 9664 KB Output is correct
25 Correct 7 ms 9684 KB Output is correct
26 Correct 8 ms 9668 KB Output is correct
27 Correct 7 ms 9684 KB Output is correct
28 Correct 7 ms 9716 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 840 ms 100304 KB Output is correct
3 Correct 879 ms 99720 KB Output is correct
4 Correct 812 ms 116660 KB Output is correct
5 Correct 755 ms 99016 KB Output is correct
6 Correct 671 ms 98660 KB Output is correct
7 Correct 673 ms 99064 KB Output is correct
8 Correct 608 ms 101044 KB Output is correct
9 Correct 681 ms 118372 KB Output is correct
10 Correct 782 ms 137068 KB Output is correct
11 Correct 567 ms 100364 KB Output is correct
12 Correct 799 ms 99708 KB Output is correct
13 Correct 635 ms 110056 KB Output is correct
14 Correct 676 ms 104376 KB Output is correct
15 Correct 690 ms 99984 KB Output is correct
16 Correct 720 ms 98432 KB Output is correct
17 Correct 744 ms 98024 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 6 ms 9752 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 7 ms 9704 KB Output is correct
22 Correct 8 ms 9684 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 840 ms 100304 KB Output is correct
3 Correct 879 ms 99720 KB Output is correct
4 Correct 812 ms 116660 KB Output is correct
5 Correct 755 ms 99016 KB Output is correct
6 Correct 671 ms 98660 KB Output is correct
7 Correct 673 ms 99064 KB Output is correct
8 Correct 608 ms 101044 KB Output is correct
9 Correct 681 ms 118372 KB Output is correct
10 Correct 782 ms 137068 KB Output is correct
11 Correct 567 ms 100364 KB Output is correct
12 Correct 799 ms 99708 KB Output is correct
13 Correct 635 ms 110056 KB Output is correct
14 Correct 676 ms 104376 KB Output is correct
15 Correct 690 ms 99984 KB Output is correct
16 Correct 720 ms 98432 KB Output is correct
17 Correct 744 ms 98024 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 6 ms 9752 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 7 ms 9704 KB Output is correct
22 Correct 8 ms 9684 KB Output is correct
23 Correct 6 ms 9708 KB Output is correct
24 Correct 596 ms 100004 KB Output is correct
25 Correct 880 ms 100624 KB Output is correct
26 Correct 808 ms 125280 KB Output is correct
27 Correct 775 ms 98496 KB Output is correct
28 Correct 774 ms 98052 KB Output is correct
29 Correct 786 ms 98228 KB Output is correct
30 Correct 623 ms 102368 KB Output is correct
31 Correct 710 ms 113992 KB Output is correct
32 Correct 871 ms 154264 KB Output is correct
33 Correct 601 ms 99936 KB Output is correct
34 Correct 942 ms 100204 KB Output is correct
35 Correct 6 ms 9684 KB Output is correct
36 Correct 7 ms 9684 KB Output is correct
37 Correct 7 ms 9768 KB Output is correct
38 Correct 6 ms 9684 KB Output is correct
39 Correct 6 ms 9684 KB Output is correct
40 Correct 7 ms 9684 KB Output is correct
41 Correct 6 ms 9712 KB Output is correct
42 Correct 7 ms 9684 KB Output is correct
43 Correct 5 ms 9684 KB Output is correct
44 Correct 6 ms 9684 KB Output is correct
45 Correct 7 ms 9712 KB Output is correct
46 Correct 5 ms 9684 KB Output is correct
47 Correct 6 ms 9712 KB Output is correct
48 Correct 6 ms 9684 KB Output is correct
49 Correct 7 ms 9684 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 1332 ms 166148 KB Output is correct
3 Execution timed out 4062 ms 856256 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 7 ms 9708 KB Output is correct
2 Correct 1440 ms 159280 KB Output is correct
3 Correct 3897 ms 875244 KB Output is correct
4 Correct 1977 ms 253956 KB Output is correct
5 Correct 2462 ms 106540 KB Output is correct
6 Correct 2213 ms 109448 KB Output is correct
7 Correct 1851 ms 108972 KB Output is correct
8 Correct 574 ms 107880 KB Output is correct
9 Correct 1365 ms 170944 KB Output is correct
10 Correct 3366 ms 895556 KB Output is correct
11 Correct 1437 ms 103252 KB Output is correct
12 Execution timed out 4075 ms 139676 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 9684 KB Output is correct
2 Correct 6 ms 9684 KB Output is correct
3 Correct 6 ms 9708 KB Output is correct
4 Correct 10 ms 10660 KB Output is correct
5 Correct 14 ms 10340 KB Output is correct
6 Correct 11 ms 10252 KB Output is correct
7 Correct 8 ms 10196 KB Output is correct
8 Correct 9 ms 10236 KB Output is correct
9 Correct 6 ms 9716 KB Output is correct
10 Correct 7 ms 9728 KB Output is correct
11 Correct 7 ms 9728 KB Output is correct
12 Correct 9 ms 9664 KB Output is correct
13 Correct 6 ms 9724 KB Output is correct
14 Correct 8 ms 9684 KB Output is correct
15 Correct 10 ms 9752 KB Output is correct
16 Correct 9 ms 9692 KB Output is correct
17 Correct 7 ms 9684 KB Output is correct
18 Correct 6 ms 9684 KB Output is correct
19 Correct 9 ms 9764 KB Output is correct
20 Correct 9 ms 9684 KB Output is correct
21 Correct 8 ms 9684 KB Output is correct
22 Correct 8 ms 9684 KB Output is correct
23 Correct 8 ms 9768 KB Output is correct
24 Correct 7 ms 9664 KB Output is correct
25 Correct 7 ms 9684 KB Output is correct
26 Correct 8 ms 9668 KB Output is correct
27 Correct 7 ms 9684 KB Output is correct
28 Correct 7 ms 9716 KB Output is correct
29 Correct 5 ms 9684 KB Output is correct
30 Correct 840 ms 100304 KB Output is correct
31 Correct 879 ms 99720 KB Output is correct
32 Correct 812 ms 116660 KB Output is correct
33 Correct 755 ms 99016 KB Output is correct
34 Correct 671 ms 98660 KB Output is correct
35 Correct 673 ms 99064 KB Output is correct
36 Correct 608 ms 101044 KB Output is correct
37 Correct 681 ms 118372 KB Output is correct
38 Correct 782 ms 137068 KB Output is correct
39 Correct 567 ms 100364 KB Output is correct
40 Correct 799 ms 99708 KB Output is correct
41 Correct 635 ms 110056 KB Output is correct
42 Correct 676 ms 104376 KB Output is correct
43 Correct 690 ms 99984 KB Output is correct
44 Correct 720 ms 98432 KB Output is correct
45 Correct 744 ms 98024 KB Output is correct
46 Correct 6 ms 9684 KB Output is correct
47 Correct 6 ms 9752 KB Output is correct
48 Correct 6 ms 9684 KB Output is correct
49 Correct 7 ms 9704 KB Output is correct
50 Correct 8 ms 9684 KB Output is correct
51 Correct 6 ms 9708 KB Output is correct
52 Correct 596 ms 100004 KB Output is correct
53 Correct 880 ms 100624 KB Output is correct
54 Correct 808 ms 125280 KB Output is correct
55 Correct 775 ms 98496 KB Output is correct
56 Correct 774 ms 98052 KB Output is correct
57 Correct 786 ms 98228 KB Output is correct
58 Correct 623 ms 102368 KB Output is correct
59 Correct 710 ms 113992 KB Output is correct
60 Correct 871 ms 154264 KB Output is correct
61 Correct 601 ms 99936 KB Output is correct
62 Correct 942 ms 100204 KB Output is correct
63 Correct 6 ms 9684 KB Output is correct
64 Correct 7 ms 9684 KB Output is correct
65 Correct 7 ms 9768 KB Output is correct
66 Correct 6 ms 9684 KB Output is correct
67 Correct 6 ms 9684 KB Output is correct
68 Correct 7 ms 9684 KB Output is correct
69 Correct 6 ms 9712 KB Output is correct
70 Correct 7 ms 9684 KB Output is correct
71 Correct 5 ms 9684 KB Output is correct
72 Correct 6 ms 9684 KB Output is correct
73 Correct 7 ms 9712 KB Output is correct
74 Correct 5 ms 9684 KB Output is correct
75 Correct 6 ms 9712 KB Output is correct
76 Correct 6 ms 9684 KB Output is correct
77 Correct 7 ms 9684 KB Output is correct
78 Correct 7 ms 9728 KB Output is correct
79 Correct 1332 ms 166148 KB Output is correct
80 Execution timed out 4062 ms 856256 KB Time limit exceeded
81 Halted 0 ms 0 KB -