oj.uz

Submission #850807

# Submission time Handle Problem Language Result Execution time Memory
850807 2023-09-17T13:20:59 Z EJIC_B_KEDAX Sprinkler (JOI22_sprinkler) C++14
53 / 100
 4000 ms 141848 KB 
#include <bits/stdc++.h>
#include <random>

#ifndef LOCAL
    #pragma GCC optimize("O3")
    #pragma GCC optimize("Ofast")
    #pragma GCC optimize("unroll-loops")
    #pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
typedef long long ll;
typedef double dd;
typedef long double ld;
typedef unsigned int uii;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()



void solve();

mt19937_64 mt(1);

int32_t main() {
#ifdef LOCAL
    freopen("input.in", "r", stdin);
    freopen("output.out", "w", stdout);
#else
    ios::sync_with_stdio(false);
    cin.tie(nullptr); cout.tie(nullptr);
    //freopen("amusing.in", "r", stdin);
    //freopen("amusing.out", "w", stdout);
#endif
    cout << fixed << setprecision(30);
    int tests = 1;
    //cin >> tests;
    while (tests--) {
        solve();
    }
}

ll mod;

class SegmentTree {
public:
    void build(const vector<int>& b) {
        int sz = 1;
        while (sz < b.size()) {
            sz *= 2;
        }
        x.resize(2 * sz - 1);
        vn.resize(2 * sz - 1, 1);
        size = 2 * sz - 1;
        for (int i = sz - 1; i < 2 * sz - 1; i++) {
            if (i - sz + 1 < b.size()) {
                x[i] = b[i - sz + 1];
            } else {
                x[i] = 0;
            }
        }
        for (int i = sz - 2; i >= 0; i--) {
            //update(i);
            x[i] = 0;
        }
    }

    int get(int l, int r, int i = 0, int lx = 0, int rx = -1) {
        if (rx == -1) {
            rx = size / 2;
        }
        if (lx > r || rx < l) {
            return 0;
        }

        if (lx >= l && rx <= r) {
            return x[i];
        }

        updateVN(i);
        return get(l, r, 2 * i + 1, lx, (rx + lx) / 2) + get(l, r, 2 * i + 2, (rx + lx) / 2 + 1, rx);
    }

    void change(int ind, int c, int i = 0, int lx = 0, int rx = -1) {
        if (rx == -1) {
            rx = size / 2;
        }
        if (lx == rx) {
            x[i] = c;
            return;
        }
        updateVN(i);
        if ((rx + lx) / 2 >= ind) {
            change(ind, c, 2 * i + 1, lx, (rx + lx) / 2);
        } else {
            change(ind, c, 2 * i + 2, (rx + lx) / 2 + 1, rx);
        }
        //update(i);
    }
    void plusOtr(int l, int r, ll p, int i = 0, int lx = 0, int rx = -1) {
        if (r < l) {
            return;
        }
        if (rx == -1) {
            rx = size / 2;
        }
        if (lx >= l && rx <= r) {
            x[i] = (x[i] * p) % mod;
            vn[i] = (vn[i] * p) % mod;
            return;
        }
        if (lx > r || rx < l) {
            return;
        }
        updateVN(i);
        plusOtr(l, r, p, 2 * i + 1, lx, (rx + lx) / 2);
        plusOtr(l, r, p, 2 * i + 2, (rx + lx) / 2 + 1, rx);
        //update(i);
    }
private:
    vector<ll> x, vn;
    int size;
    void updateVN(int i) {
        if (2 * i + 2 < size) {
            if (vn[i] != 1) {
                if (x[2 * i + 1]) {
                    x[2 * i + 1] = (x[2 * i + 1] * vn[i]) % mod;
                }
                vn[2 * i + 1] = (vn[2 * i + 1] * vn[i]) % mod;
                if (x[2 * i + 2]) {
                    x[2 * i + 2] = (x[2 * i + 2] * vn[i]) % mod;
                }
                vn[2 * i + 2] = (vn[2 * i + 2] * vn[i]) % mod;
                vn[i] = 1;
            }
        }
    }
    void update(int i) {
        if (2 * i + 2 < size) {
            x[i] = x[2 * i + 1] + x[2 * i + 2];
        }
    }
};

pair<int, int> seg[200200][41];

void dfs(int s, int p, vector<vector<int>>& g, int dist[], vector<vector<int>>& d, int pr[]) {
    if (p != -1) {
        dist[s] = dist[p] + 1;
    } else {
        dist[s] = 0;
    }
    pr[s] = p;
    d[dist[s]].push_back(s);
    seg[s][0] = {d[dist[s]].size() - 1, d[dist[s]].size() - 1};
    for (int i = 1; i < 41; i++) {
        seg[s][i] = {INT32_MAX, INT32_MIN};
    }
    bool f = true;
    for (int i : g[s]) {
        if (i != p) {
            dfs(i, s, g, dist, d, pr);
            for (int j = 1; j < 41; j++) {
                seg[s][j].x = min(seg[s][j].x, seg[i][j - 1].x);
            }
            for (int j = 1; j < 41; j++) {
                seg[s][j].y = max(seg[s][j].y, seg[i][j - 1].y);
            }
        }
    }
}

void solve() {
    int n;
    cin >> n >> mod;
    vector<vector<int>> g(n), d(n);
    int deg[200200], dist[200200], h[200200], p[200200];
    for (int i = 0; i < n; i++) {
        deg[i] = 0;
    }
    for (int i = 0; i < n - 1; i++) {
        int u, v;
        cin >> u >> v; u--; v--;
        g[u].push_back(v);
        g[v].push_back(u);
        deg[u]++;
        deg[v]++;
    }
    int root = 0;
    for (int i = 0; i < n; i++) {
        if (deg[i] == 1) {
            root = i;
            break;
        }
    }
    dfs(root, -1, g, dist, d, p);
    for (int i = 0; i < n; i++) {
        cin >> h[i];
    }
    for (int i = 0; i < n; i++) {
        for (int j = 0; j < d[i].size(); j++) {
            d[i][j] = h[d[i][j]];
        }
    }
    SegmentTree dec[200200];
    for (int i = 0; i < n; i++) {
        dec[i].build(d[i]);
    }
    int q;
    cin >> q;
    while (q--) {
        int t;
        cin >> t;
        if (t == 1) {
            int x, dk, wk;
            cin >> x >> dk >> wk; x--;
            int nw = x, lev = 0, nlev = 0;
            for (int l = -dk; l <= dk; l++) {
                if (dist[x] - l < 0) {
                    break;
                }
                if (dist[x] - l >= n) {
                    continue;
                }
                int c = (dk + l) / 2;
                while (c > nlev) {
                    nlev++;
                    if (p[nw] != -1) {
                        lev++;
                        nw = p[nw];
                    }
                }
                if (c - l >= 0 && c - l <= dk) {
                    int l1, r1;
                    l1 = seg[nw][lev - l].x;
                    r1 = seg[nw][lev - l].y;
                    dec[dist[x] - l].plusOtr(l1, r1, wk);
                }
            }
        } else {
            int x;
            cin >> x; x--;
            cout << (dec[dist[x]].get(seg[x][0].x, seg[x][0].y) % mod + mod) % mod << '\n';
        }
    }
}

Compilation message

sprinkler.cpp: In member function 'void SegmentTree::build(const std::vector<int>&)':
sprinkler.cpp:50:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   50 |         while (sz < b.size()) {
      |                ~~~^~~~~~~~~~
sprinkler.cpp:57:28: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   57 |             if (i - sz + 1 < b.size()) {
      |                 ~~~~~~~~~~~^~~~~~~~~~
sprinkler.cpp: In function 'void dfs(int, int, std::vector<std::vector<int> >&, int*, std::vector<std::vector<int> >&, int*)':
sprinkler.cpp:160:10: warning: unused variable 'f' [-Wunused-variable]
  160 |     bool f = true;
      |          ^
sprinkler.cpp: In function 'void solve()':
sprinkler.cpp:202:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  202 |         for (int j = 0; j < d[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14680 KB Output is correct
2 Correct 8 ms 14428 KB Output is correct
3 Correct 7 ms 14424 KB Output is correct
4 Correct 10 ms 16980 KB Output is correct
5 Correct 10 ms 16820 KB Output is correct
6 Correct 11 ms 16988 KB Output is correct
7 Correct 9 ms 16876 KB Output is correct
8 Correct 9 ms 16732 KB Output is correct
9 Correct 8 ms 14424 KB Output is correct
10 Correct 8 ms 14428 KB Output is correct
11 Correct 8 ms 14428 KB Output is correct
12 Correct 8 ms 14452 KB Output is correct
13 Correct 8 ms 14424 KB Output is correct
14 Correct 8 ms 14428 KB Output is correct
15 Correct 8 ms 14428 KB Output is correct
16 Correct 9 ms 14568 KB Output is correct
17 Correct 8 ms 14428 KB Output is correct
18 Correct 8 ms 14564 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 8 ms 14424 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct
23 Correct 10 ms 14680 KB Output is correct
24 Correct 8 ms 14424 KB Output is correct
25 Correct 8 ms 14428 KB Output is correct
26 Correct 8 ms 14428 KB Output is correct
27 Correct 8 ms 14428 KB Output is correct
28 Correct 10 ms 14360 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14428 KB Output is correct
2 Correct 379 ms 120544 KB Output is correct
3 Correct 459 ms 117840 KB Output is correct
4 Correct 425 ms 140112 KB Output is correct
5 Correct 449 ms 118864 KB Output is correct
6 Correct 404 ms 119192 KB Output is correct
7 Correct 416 ms 118988 KB Output is correct
8 Correct 334 ms 118596 KB Output is correct
9 Correct 408 ms 141756 KB Output is correct
10 Correct 418 ms 138580 KB Output is correct
11 Correct 386 ms 120568 KB Output is correct
12 Correct 477 ms 117840 KB Output is correct
13 Correct 325 ms 118156 KB Output is correct
14 Correct 431 ms 119488 KB Output is correct
15 Correct 423 ms 118320 KB Output is correct
16 Correct 450 ms 118476 KB Output is correct
17 Correct 468 ms 118012 KB Output is correct
18 Correct 8 ms 14456 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 8 ms 14428 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 10 ms 14428 KB Output is correct
2 Correct 379 ms 120544 KB Output is correct
3 Correct 459 ms 117840 KB Output is correct
4 Correct 425 ms 140112 KB Output is correct
5 Correct 449 ms 118864 KB Output is correct
6 Correct 404 ms 119192 KB Output is correct
7 Correct 416 ms 118988 KB Output is correct
8 Correct 334 ms 118596 KB Output is correct
9 Correct 408 ms 141756 KB Output is correct
10 Correct 418 ms 138580 KB Output is correct
11 Correct 386 ms 120568 KB Output is correct
12 Correct 477 ms 117840 KB Output is correct
13 Correct 325 ms 118156 KB Output is correct
14 Correct 431 ms 119488 KB Output is correct
15 Correct 423 ms 118320 KB Output is correct
16 Correct 450 ms 118476 KB Output is correct
17 Correct 468 ms 118012 KB Output is correct
18 Correct 8 ms 14456 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 8 ms 14428 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct
23 Correct 9 ms 14428 KB Output is correct
24 Correct 393 ms 120864 KB Output is correct
25 Correct 616 ms 118092 KB Output is correct
26 Correct 472 ms 140040 KB Output is correct
27 Correct 438 ms 119320 KB Output is correct
28 Correct 439 ms 119376 KB Output is correct
29 Correct 509 ms 119716 KB Output is correct
30 Correct 380 ms 118600 KB Output is correct
31 Correct 372 ms 141648 KB Output is correct
32 Correct 489 ms 138436 KB Output is correct
33 Correct 343 ms 120692 KB Output is correct
34 Correct 532 ms 117080 KB Output is correct
35 Correct 8 ms 14424 KB Output is correct
36 Correct 8 ms 14428 KB Output is correct
37 Correct 8 ms 14428 KB Output is correct
38 Correct 8 ms 14492 KB Output is correct
39 Correct 10 ms 14428 KB Output is correct
40 Correct 8 ms 14428 KB Output is correct
41 Correct 8 ms 14428 KB Output is correct
42 Correct 8 ms 14428 KB Output is correct
43 Correct 8 ms 14428 KB Output is correct
44 Correct 8 ms 14428 KB Output is correct
45 Correct 8 ms 14512 KB Output is correct
46 Correct 8 ms 14428 KB Output is correct
47 Correct 8 ms 14408 KB Output is correct
48 Correct 8 ms 14428 KB Output is correct
49 Correct 8 ms 14428 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14428 KB Output is correct
2 Correct 606 ms 139012 KB Output is correct
3 Correct 2375 ms 138548 KB Output is correct
4 Correct 901 ms 138752 KB Output is correct
5 Correct 1498 ms 117628 KB Output is correct
6 Correct 1394 ms 118340 KB Output is correct
7 Correct 923 ms 118560 KB Output is correct
8 Correct 373 ms 117032 KB Output is correct
9 Correct 610 ms 138924 KB Output is correct
10 Correct 2286 ms 138740 KB Output is correct
11 Correct 856 ms 118224 KB Output is correct
12 Correct 3767 ms 117612 KB Output is correct
13 Correct 3341 ms 125912 KB Output is correct
14 Correct 2709 ms 130164 KB Output is correct
15 Correct 8 ms 14424 KB Output is correct
16 Correct 8 ms 14428 KB Output is correct
17 Correct 8 ms 14428 KB Output is correct
18 Correct 8 ms 14424 KB Output is correct
19 Correct 10 ms 14684 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14424 KB Output is correct
2 Correct 639 ms 141652 KB Output is correct
3 Correct 2319 ms 138680 KB Output is correct
4 Correct 945 ms 140180 KB Output is correct
5 Correct 1571 ms 119196 KB Output is correct
6 Correct 1449 ms 119540 KB Output is correct
7 Correct 968 ms 118340 KB Output is correct
8 Correct 379 ms 118488 KB Output is correct
9 Correct 643 ms 141848 KB Output is correct
10 Correct 2331 ms 138488 KB Output is correct
11 Correct 813 ms 120472 KB Output is correct
12 Execution timed out 4014 ms 118148 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 8 ms 14680 KB Output is correct
2 Correct 8 ms 14428 KB Output is correct
3 Correct 7 ms 14424 KB Output is correct
4 Correct 10 ms 16980 KB Output is correct
5 Correct 10 ms 16820 KB Output is correct
6 Correct 11 ms 16988 KB Output is correct
7 Correct 9 ms 16876 KB Output is correct
8 Correct 9 ms 16732 KB Output is correct
9 Correct 8 ms 14424 KB Output is correct
10 Correct 8 ms 14428 KB Output is correct
11 Correct 8 ms 14428 KB Output is correct
12 Correct 8 ms 14452 KB Output is correct
13 Correct 8 ms 14424 KB Output is correct
14 Correct 8 ms 14428 KB Output is correct
15 Correct 8 ms 14428 KB Output is correct
16 Correct 9 ms 14568 KB Output is correct
17 Correct 8 ms 14428 KB Output is correct
18 Correct 8 ms 14564 KB Output is correct
19 Correct 8 ms 14428 KB Output is correct
20 Correct 8 ms 14428 KB Output is correct
21 Correct 8 ms 14424 KB Output is correct
22 Correct 8 ms 14428 KB Output is correct
23 Correct 10 ms 14680 KB Output is correct
24 Correct 8 ms 14424 KB Output is correct
25 Correct 8 ms 14428 KB Output is correct
26 Correct 8 ms 14428 KB Output is correct
27 Correct 8 ms 14428 KB Output is correct
28 Correct 10 ms 14360 KB Output is correct
29 Correct 10 ms 14428 KB Output is correct
30 Correct 379 ms 120544 KB Output is correct
31 Correct 459 ms 117840 KB Output is correct
32 Correct 425 ms 140112 KB Output is correct
33 Correct 449 ms 118864 KB Output is correct
34 Correct 404 ms 119192 KB Output is correct
35 Correct 416 ms 118988 KB Output is correct
36 Correct 334 ms 118596 KB Output is correct
37 Correct 408 ms 141756 KB Output is correct
38 Correct 418 ms 138580 KB Output is correct
39 Correct 386 ms 120568 KB Output is correct
40 Correct 477 ms 117840 KB Output is correct
41 Correct 325 ms 118156 KB Output is correct
42 Correct 431 ms 119488 KB Output is correct
43 Correct 423 ms 118320 KB Output is correct
44 Correct 450 ms 118476 KB Output is correct
45 Correct 468 ms 118012 KB Output is correct
46 Correct 8 ms 14456 KB Output is correct
47 Correct 8 ms 14428 KB Output is correct
48 Correct 8 ms 14428 KB Output is correct
49 Correct 8 ms 14428 KB Output is correct
50 Correct 8 ms 14428 KB Output is correct
51 Correct 9 ms 14428 KB Output is correct
52 Correct 393 ms 120864 KB Output is correct
53 Correct 616 ms 118092 KB Output is correct
54 Correct 472 ms 140040 KB Output is correct
55 Correct 438 ms 119320 KB Output is correct
56 Correct 439 ms 119376 KB Output is correct
57 Correct 509 ms 119716 KB Output is correct
58 Correct 380 ms 118600 KB Output is correct
59 Correct 372 ms 141648 KB Output is correct
60 Correct 489 ms 138436 KB Output is correct
61 Correct 343 ms 120692 KB Output is correct
62 Correct 532 ms 117080 KB Output is correct
63 Correct 8 ms 14424 KB Output is correct
64 Correct 8 ms 14428 KB Output is correct
65 Correct 8 ms 14428 KB Output is correct
66 Correct 8 ms 14492 KB Output is correct
67 Correct 10 ms 14428 KB Output is correct
68 Correct 8 ms 14428 KB Output is correct
69 Correct 8 ms 14428 KB Output is correct
70 Correct 8 ms 14428 KB Output is correct
71 Correct 8 ms 14428 KB Output is correct
72 Correct 8 ms 14428 KB Output is correct
73 Correct 8 ms 14512 KB Output is correct
74 Correct 8 ms 14428 KB Output is correct
75 Correct 8 ms 14408 KB Output is correct
76 Correct 8 ms 14428 KB Output is correct
77 Correct 8 ms 14428 KB Output is correct
78 Correct 8 ms 14428 KB Output is correct
79 Correct 606 ms 139012 KB Output is correct
80 Correct 2375 ms 138548 KB Output is correct
81 Correct 901 ms 138752 KB Output is correct
82 Correct 1498 ms 117628 KB Output is correct
83 Correct 1394 ms 118340 KB Output is correct
84 Correct 923 ms 118560 KB Output is correct
85 Correct 373 ms 117032 KB Output is correct
86 Correct 610 ms 138924 KB Output is correct
87 Correct 2286 ms 138740 KB Output is correct
88 Correct 856 ms 118224 KB Output is correct
89 Correct 3767 ms 117612 KB Output is correct
90 Correct 3341 ms 125912 KB Output is correct
91 Correct 2709 ms 130164 KB Output is correct
92 Correct 8 ms 14424 KB Output is correct
93 Correct 8 ms 14428 KB Output is correct
94 Correct 8 ms 14428 KB Output is correct
95 Correct 8 ms 14424 KB Output is correct
96 Correct 10 ms 14684 KB Output is correct
97 Correct 8 ms 14424 KB Output is correct
98 Correct 639 ms 141652 KB Output is correct
99 Correct 2319 ms 138680 KB Output is correct
100 Correct 945 ms 140180 KB Output is correct
101 Correct 1571 ms 119196 KB Output is correct
102 Correct 1449 ms 119540 KB Output is correct
103 Correct 968 ms 118340 KB Output is correct
104 Correct 379 ms 118488 KB Output is correct
105 Correct 643 ms 141848 KB Output is correct
106 Correct 2331 ms 138488 KB Output is correct
107 Correct 813 ms 120472 KB Output is correct
108 Execution timed out 4014 ms 118148 KB Time limit exceeded
109 Halted 0 ms 0 KB -