oj.uz

Submission #615334

# Submission time Handle Problem Language Result Execution time Memory
615334 2022-07-31T08:27:04 Z 반딧불(#8492) Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 892448 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){
        if(r<s || e<l) return;
        propagate(i, l, r);
        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

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9812 KB Output is correct
2 Correct 12 ms 9736 KB Output is correct
3 Correct 5 ms 9712 KB Output is correct
4 Correct 7 ms 10620 KB Output is correct
5 Correct 9 ms 10324 KB Output is correct
6 Correct 10 ms 10196 KB Output is correct
7 Correct 9 ms 10232 KB Output is correct
8 Correct 7 ms 10224 KB Output is correct
9 Correct 6 ms 9724 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 8 ms 9684 KB Output is correct
14 Correct 8 ms 9684 KB Output is correct
15 Correct 7 ms 9720 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9696 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 6 ms 9712 KB Output is correct
22 Correct 7 ms 9712 KB Output is correct
23 Correct 8 ms 9776 KB Output is correct
24 Correct 7 ms 9684 KB Output is correct
25 Correct 8 ms 9684 KB Output is correct
26 Correct 7 ms 9720 KB Output is correct
27 Correct 6 ms 9684 KB Output is correct
28 Correct 7 ms 9712 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 594 ms 106472 KB Output is correct
3 Correct 792 ms 102724 KB Output is correct
4 Correct 746 ms 116856 KB Output is correct
5 Correct 686 ms 99372 KB Output is correct
6 Correct 641 ms 98884 KB Output is correct
7 Correct 617 ms 99272 KB Output is correct
8 Correct 495 ms 101348 KB Output is correct
9 Correct 612 ms 118892 KB Output is correct
10 Correct 782 ms 138008 KB Output is correct
11 Correct 544 ms 100608 KB Output is correct
12 Correct 751 ms 100976 KB Output is correct
13 Correct 699 ms 112228 KB Output is correct
14 Correct 710 ms 107428 KB Output is correct
15 Correct 648 ms 102716 KB Output is correct
16 Correct 694 ms 100992 KB Output is correct
17 Correct 656 ms 101048 KB Output is correct
18 Correct 5 ms 9724 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 7 ms 9736 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9728 KB Output is correct
2 Correct 594 ms 106472 KB Output is correct
3 Correct 792 ms 102724 KB Output is correct
4 Correct 746 ms 116856 KB Output is correct
5 Correct 686 ms 99372 KB Output is correct
6 Correct 641 ms 98884 KB Output is correct
7 Correct 617 ms 99272 KB Output is correct
8 Correct 495 ms 101348 KB Output is correct
9 Correct 612 ms 118892 KB Output is correct
10 Correct 782 ms 138008 KB Output is correct
11 Correct 544 ms 100608 KB Output is correct
12 Correct 751 ms 100976 KB Output is correct
13 Correct 699 ms 112228 KB Output is correct
14 Correct 710 ms 107428 KB Output is correct
15 Correct 648 ms 102716 KB Output is correct
16 Correct 694 ms 100992 KB Output is correct
17 Correct 656 ms 101048 KB Output is correct
18 Correct 5 ms 9724 KB Output is correct
19 Correct 7 ms 9684 KB Output is correct
20 Correct 7 ms 9736 KB Output is correct
21 Correct 6 ms 9684 KB Output is correct
22 Correct 6 ms 9684 KB Output is correct
23 Correct 6 ms 9684 KB Output is correct
24 Correct 621 ms 101540 KB Output is correct
25 Correct 841 ms 102280 KB Output is correct
26 Correct 800 ms 127076 KB Output is correct
27 Correct 706 ms 100204 KB Output is correct
28 Correct 777 ms 99912 KB Output is correct
29 Correct 668 ms 99996 KB Output is correct
30 Correct 586 ms 104244 KB Output is correct
31 Correct 617 ms 115912 KB Output is correct
32 Correct 885 ms 156100 KB Output is correct
33 Correct 619 ms 101580 KB Output is correct
34 Correct 866 ms 101744 KB Output is correct
35 Correct 5 ms 9684 KB Output is correct
36 Correct 7 ms 9676 KB Output is correct
37 Correct 7 ms 9684 KB Output is correct
38 Correct 8 ms 9844 KB Output is correct
39 Correct 6 ms 9716 KB Output is correct
40 Correct 6 ms 9684 KB Output is correct
41 Correct 6 ms 9684 KB Output is correct
42 Correct 6 ms 9684 KB Output is correct
43 Correct 6 ms 9716 KB Output is correct
44 Correct 7 ms 9716 KB Output is correct
45 Correct 8 ms 9712 KB Output is correct
46 Correct 8 ms 9684 KB Output is correct
47 Correct 8 ms 9764 KB Output is correct
48 Correct 6 ms 9684 KB Output is correct
49 Correct 9 ms 9684 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 7 ms 9684 KB Output is correct
2 Correct 1319 ms 171824 KB Output is correct
3 Correct 3737 ms 859036 KB Output is correct
4 Correct 1681 ms 265792 KB Output is correct
5 Correct 2682 ms 102224 KB Output is correct
6 Correct 2197 ms 102100 KB Output is correct
7 Correct 1611 ms 106992 KB Output is correct
8 Correct 645 ms 105724 KB Output is correct
9 Correct 1473 ms 156444 KB Output is correct
10 Correct 3575 ms 888396 KB Output is correct
11 Correct 1553 ms 98996 KB Output is correct
12 Execution timed out 4086 ms 161476 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 9684 KB Output is correct
2 Correct 1311 ms 157704 KB Output is correct
3 Correct 3672 ms 873108 KB Output is correct
4 Correct 2113 ms 252936 KB Output is correct
5 Correct 2343 ms 105444 KB Output is correct
6 Correct 2126 ms 107520 KB Output is correct
7 Correct 1708 ms 107104 KB Output is correct
8 Correct 598 ms 105996 KB Output is correct
9 Correct 1522 ms 169344 KB Output is correct
10 Correct 3671 ms 892448 KB Output is correct
11 Correct 1616 ms 101784 KB Output is correct
12 Execution timed out 4085 ms 138048 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 6 ms 9812 KB Output is correct
2 Correct 12 ms 9736 KB Output is correct
3 Correct 5 ms 9712 KB Output is correct
4 Correct 7 ms 10620 KB Output is correct
5 Correct 9 ms 10324 KB Output is correct
6 Correct 10 ms 10196 KB Output is correct
7 Correct 9 ms 10232 KB Output is correct
8 Correct 7 ms 10224 KB Output is correct
9 Correct 6 ms 9724 KB Output is correct
10 Correct 6 ms 9684 KB Output is correct
11 Correct 7 ms 9684 KB Output is correct
12 Correct 6 ms 9684 KB Output is correct
13 Correct 8 ms 9684 KB Output is correct
14 Correct 8 ms 9684 KB Output is correct
15 Correct 7 ms 9720 KB Output is correct
16 Correct 6 ms 9684 KB Output is correct
17 Correct 6 ms 9696 KB Output is correct
18 Correct 5 ms 9684 KB Output is correct
19 Correct 5 ms 9684 KB Output is correct
20 Correct 6 ms 9684 KB Output is correct
21 Correct 6 ms 9712 KB Output is correct
22 Correct 7 ms 9712 KB Output is correct
23 Correct 8 ms 9776 KB Output is correct
24 Correct 7 ms 9684 KB Output is correct
25 Correct 8 ms 9684 KB Output is correct
26 Correct 7 ms 9720 KB Output is correct
27 Correct 6 ms 9684 KB Output is correct
28 Correct 7 ms 9712 KB Output is correct
29 Correct 7 ms 9728 KB Output is correct
30 Correct 594 ms 106472 KB Output is correct
31 Correct 792 ms 102724 KB Output is correct
32 Correct 746 ms 116856 KB Output is correct
33 Correct 686 ms 99372 KB Output is correct
34 Correct 641 ms 98884 KB Output is correct
35 Correct 617 ms 99272 KB Output is correct
36 Correct 495 ms 101348 KB Output is correct
37 Correct 612 ms 118892 KB Output is correct
38 Correct 782 ms 138008 KB Output is correct
39 Correct 544 ms 100608 KB Output is correct
40 Correct 751 ms 100976 KB Output is correct
41 Correct 699 ms 112228 KB Output is correct
42 Correct 710 ms 107428 KB Output is correct
43 Correct 648 ms 102716 KB Output is correct
44 Correct 694 ms 100992 KB Output is correct
45 Correct 656 ms 101048 KB Output is correct
46 Correct 5 ms 9724 KB Output is correct
47 Correct 7 ms 9684 KB Output is correct
48 Correct 7 ms 9736 KB Output is correct
49 Correct 6 ms 9684 KB Output is correct
50 Correct 6 ms 9684 KB Output is correct
51 Correct 6 ms 9684 KB Output is correct
52 Correct 621 ms 101540 KB Output is correct
53 Correct 841 ms 102280 KB Output is correct
54 Correct 800 ms 127076 KB Output is correct
55 Correct 706 ms 100204 KB Output is correct
56 Correct 777 ms 99912 KB Output is correct
57 Correct 668 ms 99996 KB Output is correct
58 Correct 586 ms 104244 KB Output is correct
59 Correct 617 ms 115912 KB Output is correct
60 Correct 885 ms 156100 KB Output is correct
61 Correct 619 ms 101580 KB Output is correct
62 Correct 866 ms 101744 KB Output is correct
63 Correct 5 ms 9684 KB Output is correct
64 Correct 7 ms 9676 KB Output is correct
65 Correct 7 ms 9684 KB Output is correct
66 Correct 8 ms 9844 KB Output is correct
67 Correct 6 ms 9716 KB Output is correct
68 Correct 6 ms 9684 KB Output is correct
69 Correct 6 ms 9684 KB Output is correct
70 Correct 6 ms 9684 KB Output is correct
71 Correct 6 ms 9716 KB Output is correct
72 Correct 7 ms 9716 KB Output is correct
73 Correct 8 ms 9712 KB Output is correct
74 Correct 8 ms 9684 KB Output is correct
75 Correct 8 ms 9764 KB Output is correct
76 Correct 6 ms 9684 KB Output is correct
77 Correct 9 ms 9684 KB Output is correct
78 Correct 7 ms 9684 KB Output is correct
79 Correct 1319 ms 171824 KB Output is correct
80 Correct 3737 ms 859036 KB Output is correct
81 Correct 1681 ms 265792 KB Output is correct
82 Correct 2682 ms 102224 KB Output is correct
83 Correct 2197 ms 102100 KB Output is correct
84 Correct 1611 ms 106992 KB Output is correct
85 Correct 645 ms 105724 KB Output is correct
86 Correct 1473 ms 156444 KB Output is correct
87 Correct 3575 ms 888396 KB Output is correct
88 Correct 1553 ms 98996 KB Output is correct
89 Execution timed out 4086 ms 161476 KB Time limit exceeded
90 Halted 0 ms 0 KB -