oj.uz

Submission #932878

# Submission time Handle Problem Language Result Execution time Memory
932878 2024-02-24T10:38:20 Z alextodoran Sprinkler (JOI22_sprinkler) C++17
100 / 100
 2854 ms 66668 KB 
/**
 ____ ____ ____ ____ ____
||a |||t |||o |||d |||o ||
||__|||__|||__|||__|||__||
|/__\|/__\|/__\|/__\|/__\|

**/

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;


int _out_loc; char _out_buff[50000];

void write_ch(char ch)
{
    if (_out_loc == 50000) {
        fwrite(_out_buff, 1, 50000, stdout);
        _out_loc = 0;
        _out_buff[_out_loc++] = ch;
    } else {
        _out_buff[_out_loc++] = ch;
    }
}

void write_u32(unsigned int vu32)
{
    if (vu32 <= 9) {
        write_ch(vu32 + '0');
    } else {
        write_u32(vu32 / 10);
        write_ch(vu32 % 10 + '0');
    }
}

void write_appendix()
{
    fwrite(_out_buff, 1, _out_loc, stdout);
}

const int BUFFER_SIZE = 30000;

char buffer[BUFFER_SIZE];
int bpos = BUFFER_SIZE - 1;

char read_char ()
{
    bpos++;
    if(bpos == BUFFER_SIZE)
    {
        fread(buffer, sizeof(char), BUFFER_SIZE, stdin);
        bpos = 0;
    }
    return buffer[bpos];
}

bool isDigit[] = {
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0,
0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0, 0};

int read_int ()
{
    int ans = 0;
    char c;
    while(isDigit[c = read_char()])
    {
        ans = ans * 10 + c - '0';
    }
    return ans;
}

const int N_MAX = 200000;
const int Q_MAX = 400000;

int N, MOD;
vector <int> adj[N_MAX + 2];
int H[N_MAX + 2];
int Q;
int type[Q_MAX + 2];
int vert[Q_MAX + 2];
int dist[Q_MAX + 2];
int water[Q_MAX + 2];

bool used[N_MAX + 2];

int parent[N_MAX + 2];
int depth[N_MAX + 2];

int order[N_MAX + 2];
int L[N_MAX + 2];
int R[N_MAX + 2];
int curr;

void dfs (int u) {
    order[++curr] = u;
    L[u] = R[u] = curr;
    for (int v : adj[u]) {
        if (v != parent[u]) {
            parent[v] = u;
            depth[v] = depth[u] + 1;
            dfs(v);
            R[u] = R[v];
        }
    }
}

vector <int> onDepth[N_MAX + 2];
int* SGT[N_MAX + 2];

void build (int* SGT, int node, int l, int r, vector <int> &arr) {
    if (l == r) {
        SGT[node] = 1;
        return;
    }
    SGT[node] = 1;
    int mid = (l + r) / 2;
    int lSon = node * 2, rSon = node * 2 + 1;
    build(SGT, lSon, l, mid, arr);
    build(SGT, rSon, mid + 1, r, arr);
}
void build (int d) {
    build(SGT[d], 1, 0, (int) onDepth[d].size() - 1, onDepth[d]);
}

void init () {
    dfs(1);
    for (int i = 1; i <= N; i++) {
        int u = order[i];
        if (used[u] == true) {
            onDepth[depth[u]].push_back(u);
            onDepth[depth[u] + 1].push_back(u);
        }
    }
    for (int d = 0; d <= N; d++) {
        if (onDepth[d].empty() == false) {
            SGT[d] = new int[(int) onDepth[d].size() * 4 + 2];
            build(d);
        }
    }
}

void update (int* SGT, int node, int l, int r, int ul, int ur, int uval) {
    if (ul <= l && r <= ur) {
        SGT[node] = (ll) SGT[node] * uval % MOD;
        return;
    }
    int mid = (l + r) >> 1;
    int lSon = node << 1, rSon = lSon | 1;
    if (SGT[node] != 1) {
        SGT[lSon] = (ll) SGT[lSon] * SGT[node] % MOD;
        SGT[rSon] = (ll) SGT[rSon] * SGT[node] % MOD;
        SGT[node] = 1;
    }
    if (ul <= mid) {
        update(SGT, lSon, l, mid, ul, ur, uval);
    }
    if (mid + 1 <= ur) {
        update(SGT, rSon, mid + 1, r, ul, ur, uval);
    }
}
void update (int d, int ul, int ur, int uval) {
    if (ul <= ur) {
        update(SGT[d], 1, 0, (int) onDepth[d].size() - 1, ul, ur, uval);
    }
}

int query (int* SGT, int node, int l, int r, int qpos) {
    if (l == r) {
        return SGT[node];
    }
    int mid = (l + r) >> 1;
    int lSon = node << 1, rSon = lSon | 1;
    if (SGT[node] != 1) {
        SGT[lSon] = (ll) SGT[lSon] * SGT[node] % MOD;
        SGT[rSon] = (ll) SGT[rSon] * SGT[node] % MOD;
        SGT[node] = 1;
    }
    if (qpos <= mid) {
        return query(SGT, lSon, l, mid, qpos);
    } else {
        return query(SGT, rSon, mid + 1, r, qpos);
    }
}
int query (int d, int qpos) {
    return query(SGT[d], 1, 0, (int) onDepth[d].size() - 1, qpos);
}

int findL (int d, int node) {
    int l = 0, r = (int) onDepth[d].size();
    while (l < r) {
        int mid = (l + r) / 2;
        if (L[node] <= L[onDepth[d][mid]]) {
            r = mid;
        } else {
            l = mid + 1;
        }
    }
    return l;
}
int findR (int d, int node) {
    int l = -1, r = (int) onDepth[d].size() - 1;
    while (l < r) {
        int mid = (l + r + 1) / 2;
        if (R[onDepth[d][mid]] <= R[node]) {
            l = mid;
        } else {
            r = mid - 1;
        }
    }
    return r;
}

void upd (int d, int node, int w) {
    if (d > N || onDepth[d].empty() == true) {
        return;
    }
    update(d, findL(d, node), findR(d, node), w);
}

int main () {
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);

    N = read_int(); MOD = read_int();
//    N = N_MAX; MOD = 1000000000;
    for (int i = 1; i <= N - 1; i++) {
        int u, v;
        u = read_int(); v = read_int();
//        u = i + 1; v = rand() % i + 1;
        adj[u].push_back(v);
        adj[v].push_back(u);
    }
    for (int u = 1; u <= N; u++) {
        H[u] = read_int();
//        H[u] = rand() % MOD + 1;
    }
    Q = read_int();
//    Q = N_MAX;
    for (int i = 1; i <= Q; i++) {
        type[i] = read_int();
        vert[i] = read_int();
        if (type[i] == 1) {
            dist[i] = read_int();
            water[i] = read_int();
        } else {
            used[vert[i]] = true;
        }
    }

    init();

    for (int i = 1; i <= Q; i++) {
        int u = vert[i];
        if (type[i] == 1) {
            int r = dist[i];
            int w = water[i];
            int d = depth[u] + r;
            while (d > depth[u]) {
                upd(d, u, w);
                if (u != 1) {
                    u = parent[u];
                }
                d -= 2;
            }
            if (d == depth[u]) {
                H[u] = (ll) H[u] * w % MOD;
            }
        } else {
            write_u32((ll) H[u] * query(depth[u], findL(depth[u], u)) % MOD
                                * query(depth[u] + 1, findL(depth[u] + 1, u)) % MOD);
            write_ch('\n');
        }
    }
    write_appendix();

    return 0;
}

Compilation message

sprinkler.cpp: In function 'int read_int()':
sprinkler.cpp:82:21: warning: array subscript has type 'char' [-Wchar-subscripts]
   82 |     while(isDigit[c = read_char()])
      |                   ~~^~~~~~~~~~~~~
sprinkler.cpp: In function 'char read_char()':
sprinkler.cpp:54:14: warning: ignoring return value of 'size_t fread(void*, size_t, size_t, FILE*)' declared with attribute 'warn_unused_result' [-Wunused-result]
   54 |         fread(buffer, sizeof(char), BUFFER_SIZE, stdin);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22360 KB Output is correct
2 Correct 5 ms 22352 KB Output is correct
3 Correct 4 ms 22396 KB Output is correct
4 Correct 4 ms 22364 KB Output is correct
5 Correct 5 ms 22360 KB Output is correct
6 Correct 5 ms 22364 KB Output is correct
7 Correct 5 ms 22364 KB Output is correct
8 Correct 5 ms 22360 KB Output is correct
9 Correct 4 ms 22364 KB Output is correct
10 Correct 4 ms 22400 KB Output is correct
11 Correct 4 ms 22364 KB Output is correct
12 Correct 4 ms 22440 KB Output is correct
13 Correct 4 ms 22364 KB Output is correct
14 Correct 4 ms 22364 KB Output is correct
15 Correct 4 ms 22364 KB Output is correct
16 Correct 4 ms 22360 KB Output is correct
17 Correct 5 ms 22428 KB Output is correct
18 Correct 4 ms 22364 KB Output is correct
19 Correct 4 ms 22364 KB Output is correct
20 Correct 4 ms 22364 KB Output is correct
21 Correct 4 ms 22364 KB Output is correct
22 Correct 4 ms 22364 KB Output is correct
23 Correct 4 ms 22364 KB Output is correct
24 Correct 4 ms 22364 KB Output is correct
25 Correct 4 ms 22364 KB Output is correct
26 Correct 4 ms 22364 KB Output is correct
27 Correct 4 ms 22360 KB Output is correct
28 Correct 4 ms 22360 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22364 KB Output is correct
2 Correct 242 ms 47752 KB Output is correct
3 Correct 177 ms 42876 KB Output is correct
4 Correct 179 ms 58372 KB Output is correct
5 Correct 201 ms 46196 KB Output is correct
6 Correct 243 ms 44292 KB Output is correct
7 Correct 236 ms 45372 KB Output is correct
8 Correct 217 ms 45196 KB Output is correct
9 Correct 218 ms 66668 KB Output is correct
10 Correct 120 ms 56300 KB Output is correct
11 Correct 239 ms 47772 KB Output is correct
12 Correct 171 ms 42480 KB Output is correct
13 Correct 112 ms 43204 KB Output is correct
14 Correct 149 ms 43044 KB Output is correct
15 Correct 157 ms 42284 KB Output is correct
16 Correct 174 ms 43164 KB Output is correct
17 Correct 208 ms 43412 KB Output is correct
18 Correct 4 ms 22364 KB Output is correct
19 Correct 4 ms 22348 KB Output is correct
20 Correct 5 ms 22364 KB Output is correct
21 Correct 4 ms 22616 KB Output is correct
22 Correct 4 ms 22364 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22364 KB Output is correct
2 Correct 242 ms 47752 KB Output is correct
3 Correct 177 ms 42876 KB Output is correct
4 Correct 179 ms 58372 KB Output is correct
5 Correct 201 ms 46196 KB Output is correct
6 Correct 243 ms 44292 KB Output is correct
7 Correct 236 ms 45372 KB Output is correct
8 Correct 217 ms 45196 KB Output is correct
9 Correct 218 ms 66668 KB Output is correct
10 Correct 120 ms 56300 KB Output is correct
11 Correct 239 ms 47772 KB Output is correct
12 Correct 171 ms 42480 KB Output is correct
13 Correct 112 ms 43204 KB Output is correct
14 Correct 149 ms 43044 KB Output is correct
15 Correct 157 ms 42284 KB Output is correct
16 Correct 174 ms 43164 KB Output is correct
17 Correct 208 ms 43412 KB Output is correct
18 Correct 4 ms 22364 KB Output is correct
19 Correct 4 ms 22348 KB Output is correct
20 Correct 5 ms 22364 KB Output is correct
21 Correct 4 ms 22616 KB Output is correct
22 Correct 4 ms 22364 KB Output is correct
23 Correct 4 ms 22360 KB Output is correct
24 Correct 268 ms 47704 KB Output is correct
25 Correct 239 ms 42596 KB Output is correct
26 Correct 180 ms 64084 KB Output is correct
27 Correct 221 ms 46040 KB Output is correct
28 Correct 327 ms 44820 KB Output is correct
29 Correct 313 ms 44828 KB Output is correct
30 Correct 255 ms 45072 KB Output is correct
31 Correct 231 ms 60608 KB Output is correct
32 Correct 166 ms 56520 KB Output is correct
33 Correct 273 ms 47732 KB Output is correct
34 Correct 262 ms 42492 KB Output is correct
35 Correct 5 ms 22420 KB Output is correct
36 Correct 4 ms 22396 KB Output is correct
37 Correct 4 ms 22396 KB Output is correct
38 Correct 4 ms 22364 KB Output is correct
39 Correct 4 ms 22364 KB Output is correct
40 Correct 4 ms 22364 KB Output is correct
41 Correct 4 ms 22360 KB Output is correct
42 Correct 4 ms 22364 KB Output is correct
43 Correct 4 ms 22376 KB Output is correct
44 Correct 4 ms 22404 KB Output is correct
45 Correct 5 ms 22364 KB Output is correct
46 Correct 4 ms 22364 KB Output is correct
47 Correct 5 ms 22364 KB Output is correct
48 Correct 5 ms 22648 KB Output is correct
49 Correct 5 ms 22364 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22364 KB Output is correct
2 Correct 287 ms 63548 KB Output is correct
3 Correct 541 ms 51460 KB Output is correct
4 Correct 375 ms 57928 KB Output is correct
5 Correct 1232 ms 43500 KB Output is correct
6 Correct 924 ms 42016 KB Output is correct
7 Correct 541 ms 42432 KB Output is correct
8 Correct 217 ms 41928 KB Output is correct
9 Correct 271 ms 57668 KB Output is correct
10 Correct 438 ms 53308 KB Output is correct
11 Correct 672 ms 44916 KB Output is correct
12 Correct 2432 ms 40112 KB Output is correct
13 Correct 1179 ms 40376 KB Output is correct
14 Correct 766 ms 40804 KB Output is correct
15 Correct 4 ms 22360 KB Output is correct
16 Correct 4 ms 22364 KB Output is correct
17 Correct 4 ms 22364 KB Output is correct
18 Correct 5 ms 22364 KB Output is correct
19 Correct 4 ms 22364 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22364 KB Output is correct
2 Correct 279 ms 59576 KB Output is correct
3 Correct 494 ms 48756 KB Output is correct
4 Correct 375 ms 56020 KB Output is correct
5 Correct 1201 ms 44736 KB Output is correct
6 Correct 876 ms 43412 KB Output is correct
7 Correct 674 ms 43840 KB Output is correct
8 Correct 233 ms 42948 KB Output is correct
9 Correct 292 ms 65220 KB Output is correct
10 Correct 424 ms 54100 KB Output is correct
11 Correct 704 ms 47392 KB Output is correct
12 Correct 2808 ms 40356 KB Output is correct
13 Correct 1427 ms 40272 KB Output is correct
14 Correct 839 ms 40972 KB Output is correct
15 Correct 4 ms 22364 KB Output is correct
16 Correct 4 ms 22364 KB Output is correct
17 Correct 4 ms 22360 KB Output is correct
18 Correct 6 ms 22364 KB Output is correct
19 Correct 4 ms 22364 KB Output is correct

Subtask #6
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 22360 KB Output is correct
2 Correct 5 ms 22352 KB Output is correct
3 Correct 4 ms 22396 KB Output is correct
4 Correct 4 ms 22364 KB Output is correct
5 Correct 5 ms 22360 KB Output is correct
6 Correct 5 ms 22364 KB Output is correct
7 Correct 5 ms 22364 KB Output is correct
8 Correct 5 ms 22360 KB Output is correct
9 Correct 4 ms 22364 KB Output is correct
10 Correct 4 ms 22400 KB Output is correct
11 Correct 4 ms 22364 KB Output is correct
12 Correct 4 ms 22440 KB Output is correct
13 Correct 4 ms 22364 KB Output is correct
14 Correct 4 ms 22364 KB Output is correct
15 Correct 4 ms 22364 KB Output is correct
16 Correct 4 ms 22360 KB Output is correct
17 Correct 5 ms 22428 KB Output is correct
18 Correct 4 ms 22364 KB Output is correct
19 Correct 4 ms 22364 KB Output is correct
20 Correct 4 ms 22364 KB Output is correct
21 Correct 4 ms 22364 KB Output is correct
22 Correct 4 ms 22364 KB Output is correct
23 Correct 4 ms 22364 KB Output is correct
24 Correct 4 ms 22364 KB Output is correct
25 Correct 4 ms 22364 KB Output is correct
26 Correct 4 ms 22364 KB Output is correct
27 Correct 4 ms 22360 KB Output is correct
28 Correct 4 ms 22360 KB Output is correct
29 Correct 4 ms 22364 KB Output is correct
30 Correct 242 ms 47752 KB Output is correct
31 Correct 177 ms 42876 KB Output is correct
32 Correct 179 ms 58372 KB Output is correct
33 Correct 201 ms 46196 KB Output is correct
34 Correct 243 ms 44292 KB Output is correct
35 Correct 236 ms 45372 KB Output is correct
36 Correct 217 ms 45196 KB Output is correct
37 Correct 218 ms 66668 KB Output is correct
38 Correct 120 ms 56300 KB Output is correct
39 Correct 239 ms 47772 KB Output is correct
40 Correct 171 ms 42480 KB Output is correct
41 Correct 112 ms 43204 KB Output is correct
42 Correct 149 ms 43044 KB Output is correct
43 Correct 157 ms 42284 KB Output is correct
44 Correct 174 ms 43164 KB Output is correct
45 Correct 208 ms 43412 KB Output is correct
46 Correct 4 ms 22364 KB Output is correct
47 Correct 4 ms 22348 KB Output is correct
48 Correct 5 ms 22364 KB Output is correct
49 Correct 4 ms 22616 KB Output is correct
50 Correct 4 ms 22364 KB Output is correct
51 Correct 4 ms 22360 KB Output is correct
52 Correct 268 ms 47704 KB Output is correct
53 Correct 239 ms 42596 KB Output is correct
54 Correct 180 ms 64084 KB Output is correct
55 Correct 221 ms 46040 KB Output is correct
56 Correct 327 ms 44820 KB Output is correct
57 Correct 313 ms 44828 KB Output is correct
58 Correct 255 ms 45072 KB Output is correct
59 Correct 231 ms 60608 KB Output is correct
60 Correct 166 ms 56520 KB Output is correct
61 Correct 273 ms 47732 KB Output is correct
62 Correct 262 ms 42492 KB Output is correct
63 Correct 5 ms 22420 KB Output is correct
64 Correct 4 ms 22396 KB Output is correct
65 Correct 4 ms 22396 KB Output is correct
66 Correct 4 ms 22364 KB Output is correct
67 Correct 4 ms 22364 KB Output is correct
68 Correct 4 ms 22364 KB Output is correct
69 Correct 4 ms 22360 KB Output is correct
70 Correct 4 ms 22364 KB Output is correct
71 Correct 4 ms 22376 KB Output is correct
72 Correct 4 ms 22404 KB Output is correct
73 Correct 5 ms 22364 KB Output is correct
74 Correct 4 ms 22364 KB Output is correct
75 Correct 5 ms 22364 KB Output is correct
76 Correct 5 ms 22648 KB Output is correct
77 Correct 5 ms 22364 KB Output is correct
78 Correct 4 ms 22364 KB Output is correct
79 Correct 287 ms 63548 KB Output is correct
80 Correct 541 ms 51460 KB Output is correct
81 Correct 375 ms 57928 KB Output is correct
82 Correct 1232 ms 43500 KB Output is correct
83 Correct 924 ms 42016 KB Output is correct
84 Correct 541 ms 42432 KB Output is correct
85 Correct 217 ms 41928 KB Output is correct
86 Correct 271 ms 57668 KB Output is correct
87 Correct 438 ms 53308 KB Output is correct
88 Correct 672 ms 44916 KB Output is correct
89 Correct 2432 ms 40112 KB Output is correct
90 Correct 1179 ms 40376 KB Output is correct
91 Correct 766 ms 40804 KB Output is correct
92 Correct 4 ms 22360 KB Output is correct
93 Correct 4 ms 22364 KB Output is correct
94 Correct 4 ms 22364 KB Output is correct
95 Correct 5 ms 22364 KB Output is correct
96 Correct 4 ms 22364 KB Output is correct
97 Correct 4 ms 22364 KB Output is correct
98 Correct 279 ms 59576 KB Output is correct
99 Correct 494 ms 48756 KB Output is correct
100 Correct 375 ms 56020 KB Output is correct
101 Correct 1201 ms 44736 KB Output is correct
102 Correct 876 ms 43412 KB Output is correct
103 Correct 674 ms 43840 KB Output is correct
104 Correct 233 ms 42948 KB Output is correct
105 Correct 292 ms 65220 KB Output is correct
106 Correct 424 ms 54100 KB Output is correct
107 Correct 704 ms 47392 KB Output is correct
108 Correct 2808 ms 40356 KB Output is correct
109 Correct 1427 ms 40272 KB Output is correct
110 Correct 839 ms 40972 KB Output is correct
111 Correct 4 ms 22364 KB Output is correct
112 Correct 4 ms 22364 KB Output is correct
113 Correct 4 ms 22360 KB Output is correct
114 Correct 6 ms 22364 KB Output is correct
115 Correct 4 ms 22364 KB Output is correct
116 Correct 671 ms 45884 KB Output is correct
117 Correct 2813 ms 42856 KB Output is correct
118 Correct 364 ms 63884 KB Output is correct
119 Correct 1278 ms 46180 KB Output is correct
120 Correct 1018 ms 44368 KB Output is correct
121 Correct 772 ms 45436 KB Output is correct
122 Correct 262 ms 44980 KB Output is correct
123 Correct 312 ms 62576 KB Output is correct
124 Correct 469 ms 52052 KB Output is correct
125 Correct 746 ms 46932 KB Output is correct
126 Correct 2854 ms 42696 KB Output is correct
127 Correct 2207 ms 42520 KB Output is correct
128 Correct 1125 ms 43092 KB Output is correct
129 Correct 1315 ms 43728 KB Output is correct