oj.uz

답안 #850832

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
850832 2023-09-17T13:40:53 Z EJIC_B_KEDAX Sprinkler (JOI22_sprinkler) C++14
41 / 100
 4000 ms 205964 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;
    }
    int pr[200200][41], lev[200200][41];
    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++) {
        int nw = i, lv = 0, nlev = 0;
        for (int c = 0; c < 41; c++) {
            while (c > nlev) {
                nlev++;
                if (p[nw] != -1) {
                    lv++;
                    nw = p[nw];
                }
            }
            pr[i][c] = nw;
            lev[i][c] = lv;
        }
    }
    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--;
            for (int l = max(-dk, dist[x] - n + 1); l <= dk; l++) {
                if (dist[x] - l < 0) {
                    break;
                }
                int c = (dk + l) / 2;
                if (c - l >= 0 && c - l <= dk) {
                    int l1, r1;
                    l1 = seg[pr[x][c]][lev[x][c] - l].x;
                    r1 = seg[pr[x][c]][lev[x][c] - 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:217:27: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  217 |         for (int j = 0; j < d[i].size(); j++) {
      |                         ~~^~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 78676 KB Output is correct
2 Correct 39 ms 78664 KB Output is correct
3 Correct 39 ms 78664 KB Output is correct
4 Correct 42 ms 81244 KB Output is correct
5 Correct 43 ms 80976 KB Output is correct
6 Correct 41 ms 80980 KB Output is correct
7 Correct 42 ms 81144 KB Output is correct
8 Correct 44 ms 81152 KB Output is correct
9 Correct 40 ms 78588 KB Output is correct
10 Correct 40 ms 78684 KB Output is correct
11 Correct 41 ms 78684 KB Output is correct
12 Correct 40 ms 78676 KB Output is correct
13 Correct 41 ms 78676 KB Output is correct
14 Correct 39 ms 78556 KB Output is correct
15 Correct 39 ms 78552 KB Output is correct
16 Correct 39 ms 78684 KB Output is correct
17 Correct 40 ms 78728 KB Output is correct
18 Correct 41 ms 78672 KB Output is correct
19 Correct 51 ms 78700 KB Output is correct
20 Correct 41 ms 78672 KB Output is correct
21 Correct 42 ms 78676 KB Output is correct
22 Correct 52 ms 78608 KB Output is correct
23 Correct 39 ms 78748 KB Output is correct
24 Correct 41 ms 78684 KB Output is correct
25 Correct 41 ms 78676 KB Output is correct
26 Correct 40 ms 78568 KB Output is correct
27 Correct 42 ms 78728 KB Output is correct
28 Correct 42 ms 78672 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 78836 KB Output is correct
2 Correct 468 ms 184940 KB Output is correct
3 Correct 671 ms 182008 KB Output is correct
4 Correct 536 ms 204380 KB Output is correct
5 Correct 537 ms 183480 KB Output is correct
6 Correct 527 ms 183544 KB Output is correct
7 Correct 543 ms 182988 KB Output is correct
8 Correct 463 ms 182880 KB Output is correct
9 Correct 541 ms 205764 KB Output is correct
10 Correct 578 ms 202848 KB Output is correct
11 Correct 470 ms 184652 KB Output is correct
12 Correct 672 ms 181992 KB Output is correct
13 Correct 385 ms 182224 KB Output is correct
14 Correct 497 ms 183568 KB Output is correct
15 Correct 494 ms 182520 KB Output is correct
16 Correct 515 ms 182624 KB Output is correct
17 Correct 532 ms 182508 KB Output is correct
18 Correct 40 ms 78672 KB Output is correct
19 Correct 38 ms 78564 KB Output is correct
20 Correct 39 ms 78680 KB Output is correct
21 Correct 38 ms 78676 KB Output is correct
22 Correct 41 ms 78672 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 39 ms 78836 KB Output is correct
2 Correct 468 ms 184940 KB Output is correct
3 Correct 671 ms 182008 KB Output is correct
4 Correct 536 ms 204380 KB Output is correct
5 Correct 537 ms 183480 KB Output is correct
6 Correct 527 ms 183544 KB Output is correct
7 Correct 543 ms 182988 KB Output is correct
8 Correct 463 ms 182880 KB Output is correct
9 Correct 541 ms 205764 KB Output is correct
10 Correct 578 ms 202848 KB Output is correct
11 Correct 470 ms 184652 KB Output is correct
12 Correct 672 ms 181992 KB Output is correct
13 Correct 385 ms 182224 KB Output is correct
14 Correct 497 ms 183568 KB Output is correct
15 Correct 494 ms 182520 KB Output is correct
16 Correct 515 ms 182624 KB Output is correct
17 Correct 532 ms 182508 KB Output is correct
18 Correct 40 ms 78672 KB Output is correct
19 Correct 38 ms 78564 KB Output is correct
20 Correct 39 ms 78680 KB Output is correct
21 Correct 38 ms 78676 KB Output is correct
22 Correct 41 ms 78672 KB Output is correct
23 Correct 39 ms 78676 KB Output is correct
24 Correct 475 ms 184916 KB Output is correct
25 Correct 772 ms 182284 KB Output is correct
26 Correct 553 ms 204272 KB Output is correct
27 Correct 576 ms 183192 KB Output is correct
28 Correct 582 ms 183636 KB Output is correct
29 Correct 552 ms 184108 KB Output is correct
30 Correct 491 ms 182712 KB Output is correct
31 Correct 497 ms 205964 KB Output is correct
32 Correct 614 ms 202624 KB Output is correct
33 Correct 477 ms 185020 KB Output is correct
34 Correct 759 ms 181476 KB Output is correct
35 Correct 38 ms 78752 KB Output is correct
36 Correct 38 ms 78672 KB Output is correct
37 Correct 40 ms 78692 KB Output is correct
38 Correct 41 ms 78932 KB Output is correct
39 Correct 49 ms 78752 KB Output is correct
40 Correct 48 ms 78676 KB Output is correct
41 Correct 42 ms 78852 KB Output is correct
42 Correct 39 ms 78684 KB Output is correct
43 Correct 37 ms 78684 KB Output is correct
44 Correct 39 ms 78764 KB Output is correct
45 Correct 45 ms 79100 KB Output is correct
46 Correct 49 ms 78676 KB Output is correct
47 Correct 43 ms 78676 KB Output is correct
48 Correct 40 ms 78676 KB Output is correct
49 Correct 42 ms 78928 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 78732 KB Output is correct
2 Correct 648 ms 203236 KB Output is correct
3 Correct 1869 ms 202504 KB Output is correct
4 Correct 914 ms 202868 KB Output is correct
5 Correct 1761 ms 181780 KB Output is correct
6 Correct 1405 ms 182412 KB Output is correct
7 Correct 942 ms 182528 KB Output is correct
8 Correct 451 ms 181356 KB Output is correct
9 Correct 590 ms 203308 KB Output is correct
10 Correct 1969 ms 202776 KB Output is correct
11 Correct 970 ms 182512 KB Output is correct
12 Execution timed out 4035 ms 181432 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 38 ms 78640 KB Output is correct
2 Correct 716 ms 205908 KB Output is correct
3 Correct 1766 ms 202812 KB Output is correct
4 Correct 879 ms 204216 KB Output is correct
5 Correct 1575 ms 183412 KB Output is correct
6 Correct 1480 ms 183628 KB Output is correct
7 Correct 1039 ms 182608 KB Output is correct
8 Correct 457 ms 182600 KB Output is correct
9 Correct 599 ms 205824 KB Output is correct
10 Correct 1839 ms 202896 KB Output is correct
11 Correct 822 ms 184508 KB Output is correct
12 Execution timed out 4038 ms 181944 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 41 ms 78676 KB Output is correct
2 Correct 39 ms 78664 KB Output is correct
3 Correct 39 ms 78664 KB Output is correct
4 Correct 42 ms 81244 KB Output is correct
5 Correct 43 ms 80976 KB Output is correct
6 Correct 41 ms 80980 KB Output is correct
7 Correct 42 ms 81144 KB Output is correct
8 Correct 44 ms 81152 KB Output is correct
9 Correct 40 ms 78588 KB Output is correct
10 Correct 40 ms 78684 KB Output is correct
11 Correct 41 ms 78684 KB Output is correct
12 Correct 40 ms 78676 KB Output is correct
13 Correct 41 ms 78676 KB Output is correct
14 Correct 39 ms 78556 KB Output is correct
15 Correct 39 ms 78552 KB Output is correct
16 Correct 39 ms 78684 KB Output is correct
17 Correct 40 ms 78728 KB Output is correct
18 Correct 41 ms 78672 KB Output is correct
19 Correct 51 ms 78700 KB Output is correct
20 Correct 41 ms 78672 KB Output is correct
21 Correct 42 ms 78676 KB Output is correct
22 Correct 52 ms 78608 KB Output is correct
23 Correct 39 ms 78748 KB Output is correct
24 Correct 41 ms 78684 KB Output is correct
25 Correct 41 ms 78676 KB Output is correct
26 Correct 40 ms 78568 KB Output is correct
27 Correct 42 ms 78728 KB Output is correct
28 Correct 42 ms 78672 KB Output is correct
29 Correct 39 ms 78836 KB Output is correct
30 Correct 468 ms 184940 KB Output is correct
31 Correct 671 ms 182008 KB Output is correct
32 Correct 536 ms 204380 KB Output is correct
33 Correct 537 ms 183480 KB Output is correct
34 Correct 527 ms 183544 KB Output is correct
35 Correct 543 ms 182988 KB Output is correct
36 Correct 463 ms 182880 KB Output is correct
37 Correct 541 ms 205764 KB Output is correct
38 Correct 578 ms 202848 KB Output is correct
39 Correct 470 ms 184652 KB Output is correct
40 Correct 672 ms 181992 KB Output is correct
41 Correct 385 ms 182224 KB Output is correct
42 Correct 497 ms 183568 KB Output is correct
43 Correct 494 ms 182520 KB Output is correct
44 Correct 515 ms 182624 KB Output is correct
45 Correct 532 ms 182508 KB Output is correct
46 Correct 40 ms 78672 KB Output is correct
47 Correct 38 ms 78564 KB Output is correct
48 Correct 39 ms 78680 KB Output is correct
49 Correct 38 ms 78676 KB Output is correct
50 Correct 41 ms 78672 KB Output is correct
51 Correct 39 ms 78676 KB Output is correct
52 Correct 475 ms 184916 KB Output is correct
53 Correct 772 ms 182284 KB Output is correct
54 Correct 553 ms 204272 KB Output is correct
55 Correct 576 ms 183192 KB Output is correct
56 Correct 582 ms 183636 KB Output is correct
57 Correct 552 ms 184108 KB Output is correct
58 Correct 491 ms 182712 KB Output is correct
59 Correct 497 ms 205964 KB Output is correct
60 Correct 614 ms 202624 KB Output is correct
61 Correct 477 ms 185020 KB Output is correct
62 Correct 759 ms 181476 KB Output is correct
63 Correct 38 ms 78752 KB Output is correct
64 Correct 38 ms 78672 KB Output is correct
65 Correct 40 ms 78692 KB Output is correct
66 Correct 41 ms 78932 KB Output is correct
67 Correct 49 ms 78752 KB Output is correct
68 Correct 48 ms 78676 KB Output is correct
69 Correct 42 ms 78852 KB Output is correct
70 Correct 39 ms 78684 KB Output is correct
71 Correct 37 ms 78684 KB Output is correct
72 Correct 39 ms 78764 KB Output is correct
73 Correct 45 ms 79100 KB Output is correct
74 Correct 49 ms 78676 KB Output is correct
75 Correct 43 ms 78676 KB Output is correct
76 Correct 40 ms 78676 KB Output is correct
77 Correct 42 ms 78928 KB Output is correct
78 Correct 46 ms 78732 KB Output is correct
79 Correct 648 ms 203236 KB Output is correct
80 Correct 1869 ms 202504 KB Output is correct
81 Correct 914 ms 202868 KB Output is correct
82 Correct 1761 ms 181780 KB Output is correct
83 Correct 1405 ms 182412 KB Output is correct
84 Correct 942 ms 182528 KB Output is correct
85 Correct 451 ms 181356 KB Output is correct
86 Correct 590 ms 203308 KB Output is correct
87 Correct 1969 ms 202776 KB Output is correct
88 Correct 970 ms 182512 KB Output is correct
89 Execution timed out 4035 ms 181432 KB Time limit exceeded
90 Halted 0 ms 0 KB -