oj.uz

Submission #875805

# Submission time Handle Problem Language Result Execution time Memory
875805 2023-11-20T14:00:16 Z danikoynov Sprinkler (JOI22_sprinkler) C++14
41 / 100
 4000 ms 98028 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}

const int maxq = 4e5 + 10;

struct query
{
    int type, ver, d, t;
    ll w;
}ask[maxq];

const int maxn = 2e5 + 10;

int n, q;
ll l, h[maxn];
vector < query > task[maxn];
vector < int > adj[maxn];

bool cmp(query a1, query a2)
{
    return a1.d < a2.d;
}

void input()
{
    cin >> n >> l;
    for (int i = 1; i < n; i ++)
    {
        int v, u;
        cin >> v >> u;
        adj[v].push_back(u);
        adj[u].push_back(v);
    }
    for (int i = 1; i <= n; i ++)
        cin >> h[i];
    cin >> q;
    for (int i = 1; i <= q; i ++)
    {
        cin >> ask[i].type;
        if (ask[i].type == 1)
            cin >> ask[i].ver >> ask[i].d >> ask[i].w;
        else
            cin >> ask[i].ver;
        ask[i].t = i;
    }
}

struct segment_tree
{
    vector < ll > tree, lazy;

    segment_tree(int len = 0)
    {
        tree.resize(4 * (len + 1));
        lazy.resize(4 * (len + 1));
        fill(tree.begin(), tree.end(), 1);
        fill(lazy.begin(), lazy.end(), 1);
    }

    void push_lazy(int &root, int &left, int &right)
    {

        tree[root] *= lazy[root];
        tree[root] %= l;
        if (left != right)
        {
            lazy[root * 2] *= (lazy[root]);
            lazy[root * 2 + 1] *= (lazy[root]);
            lazy[root * 2] %= l;
            lazy[root * 2 + 1] %= l;
        }

        lazy[root] = 1;
    }

    void update_range(int root, int left, int right, int qleft, int qright, ll val)
    {
        if (tree[root] == 0)
            return;
        if (lazy[root] != 1)
        push_lazy(root, left, right);
        if (left > qright || right < qleft)
            return;

        if (left >= qleft && right <= qright)
        {
            lazy[root] = val;
            push_lazy(root, left, right);
            return;
        }

        int mid = (left + right) / 2;
        update_range(root * 2, left, mid, qleft, qright, val);
        update_range(root * 2 + 1, mid + 1, right, qleft, qright, val);
    }

    ll get_point(int root, int left, int right, int pos)
    {
        if (lazy[root] != 1)
        push_lazy(root, left, right);
        if (left == right)
            return tree[root];

        int mid = (left + right) / 2;
        if (pos <= mid)
            return get_point(root * 2, left, mid, pos);
        return get_point(root * 2 + 1, mid + 1, right, pos);
    }
};

segment_tree st[maxn];
int par[maxn], depth[maxn];
vector < int > by_depth[maxn];
int tin[maxn], tout[maxn], timer, rev[maxn];
void dfs(int v)
{
    tin[v] = ++ timer;
    ///cout << "dfs " << v << " "  << depth[v] << endl;
    rev[v] = by_depth[depth[v]].size();
    by_depth[depth[v]].push_back(v);
    for (int u : adj[v])
    {
        if (u == par[v])
            continue;
        par[u] = v;
        depth[u] = depth[v] + 1;
        dfs(u);
    }
    tout[v] = timer;
}

const int maxd = 40;

void update_row(int row, int left, int right, ll val)
{

    int lf = 0, rf = (int)(by_depth[row].size()) - 1;
    while(lf <= rf)
    {
        int mf = (lf + rf) / 2;
        if (tin[by_depth[row][mf]] < left)
            lf = mf + 1;
        else
            rf = mf - 1;
    }

    int lb = lf;

    lf = 0;
    rf = (int)(by_depth[row].size()) - 1;
    while(lf <= rf)
    {
        int mf = (lf + rf) / 2;
        if (tin[by_depth[row][mf]] <= right)
            lf = mf + 1;
        else
            rf = mf - 1;
    }
    int rb = rf;

    st[row].update_range(1, 0, (int)(by_depth[row].size()) - 1, lb, rb, val);

}

void make_query(int v)
{
    ll ans = h[v];
    ans = ans * st[depth[v]].get_point(1, 0, (int)(by_depth[depth[v]].size()) - 1, rev[v]);
    ans %= l;
    cout << ans << endl;
}
void simulate()
{
    for (int i = 1; i <= n; i ++)
        st[i] = segment_tree(by_depth[i].size());
    for (int i = 1; i <= q; i ++)
    {
        if (ask[i].type == 2)
            make_query(ask[i].ver);
        else
        {
            int cnt = 0, ver = ask[i].ver;
            while(ver != 1 && cnt <= ask[i].d)
            {
                int lf = ask[i].d - cnt;
                update_row(depth[ver] + lf, tin[ver], tout[ver], ask[i].w);
                ///cout << "update " << ver << " " << depth[ver] + lf << endl;
                //if (lf != 0)
                update_row(depth[ver] + lf - 1, tin[ver], tout[ver], ask[i].w);
                cnt ++;
                ver = par[ver];
            }
            if (ver == 1 && cnt <= ask[i].d)
            {
                int lf = ask[i].d - cnt;
                for (int j = 0; j <= lf; j ++)
                {
                    ///cout << "update " << ver << " " << depth[ver] + j << endl;
                    update_row(depth[ver] + j, tin[ver], tout[ver], ask[i].w);
                }
            }

        }

    }

}
void solve()
{
    input();
    ///offline_queries();
    depth[1] = 1;
    dfs(1);
    simulate();
}

int main()
{
    speed();
    solve();
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47960 KB Output is correct
2 Correct 24 ms 47752 KB Output is correct
3 Correct 25 ms 47960 KB Output is correct
4 Correct 25 ms 47964 KB Output is correct
5 Correct 26 ms 47984 KB Output is correct
6 Correct 25 ms 47964 KB Output is correct
7 Correct 25 ms 47964 KB Output is correct
8 Correct 29 ms 48060 KB Output is correct
9 Correct 25 ms 47976 KB Output is correct
10 Correct 24 ms 47964 KB Output is correct
11 Correct 24 ms 47920 KB Output is correct
12 Correct 24 ms 47964 KB Output is correct
13 Correct 24 ms 47964 KB Output is correct
14 Correct 24 ms 47764 KB Output is correct
15 Correct 24 ms 47848 KB Output is correct
16 Correct 26 ms 47956 KB Output is correct
17 Correct 24 ms 47960 KB Output is correct
18 Correct 24 ms 47964 KB Output is correct
19 Correct 25 ms 47964 KB Output is correct
20 Correct 25 ms 47940 KB Output is correct
21 Correct 25 ms 47964 KB Output is correct
22 Correct 24 ms 47964 KB Output is correct
23 Correct 24 ms 47808 KB Output is correct
24 Correct 24 ms 47964 KB Output is correct
25 Correct 27 ms 47972 KB Output is correct
26 Correct 24 ms 47964 KB Output is correct
27 Correct 25 ms 47964 KB Output is correct
28 Correct 24 ms 47824 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47964 KB Output is correct
2 Correct 305 ms 81280 KB Output is correct
3 Correct 643 ms 78036 KB Output is correct
4 Correct 370 ms 90612 KB Output is correct
5 Correct 409 ms 79520 KB Output is correct
6 Correct 533 ms 79508 KB Output is correct
7 Correct 530 ms 79844 KB Output is correct
8 Correct 336 ms 79948 KB Output is correct
9 Correct 378 ms 98028 KB Output is correct
10 Correct 399 ms 93524 KB Output is correct
11 Correct 291 ms 81120 KB Output is correct
12 Correct 598 ms 78160 KB Output is correct
13 Correct 283 ms 78404 KB Output is correct
14 Correct 522 ms 78492 KB Output is correct
15 Correct 514 ms 78288 KB Output is correct
16 Correct 412 ms 78156 KB Output is correct
17 Correct 693 ms 78948 KB Output is correct
18 Correct 27 ms 47964 KB Output is correct
19 Correct 26 ms 47972 KB Output is correct
20 Correct 25 ms 47996 KB Output is correct
21 Correct 25 ms 47956 KB Output is correct
22 Correct 28 ms 47960 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 47964 KB Output is correct
2 Correct 305 ms 81280 KB Output is correct
3 Correct 643 ms 78036 KB Output is correct
4 Correct 370 ms 90612 KB Output is correct
5 Correct 409 ms 79520 KB Output is correct
6 Correct 533 ms 79508 KB Output is correct
7 Correct 530 ms 79844 KB Output is correct
8 Correct 336 ms 79948 KB Output is correct
9 Correct 378 ms 98028 KB Output is correct
10 Correct 399 ms 93524 KB Output is correct
11 Correct 291 ms 81120 KB Output is correct
12 Correct 598 ms 78160 KB Output is correct
13 Correct 283 ms 78404 KB Output is correct
14 Correct 522 ms 78492 KB Output is correct
15 Correct 514 ms 78288 KB Output is correct
16 Correct 412 ms 78156 KB Output is correct
17 Correct 693 ms 78948 KB Output is correct
18 Correct 27 ms 47964 KB Output is correct
19 Correct 26 ms 47972 KB Output is correct
20 Correct 25 ms 47996 KB Output is correct
21 Correct 25 ms 47956 KB Output is correct
22 Correct 28 ms 47960 KB Output is correct
23 Correct 24 ms 47964 KB Output is correct
24 Correct 326 ms 81084 KB Output is correct
25 Correct 835 ms 78032 KB Output is correct
26 Correct 378 ms 95800 KB Output is correct
27 Correct 493 ms 79636 KB Output is correct
28 Correct 655 ms 79336 KB Output is correct
29 Correct 645 ms 79508 KB Output is correct
30 Correct 415 ms 80044 KB Output is correct
31 Correct 326 ms 92492 KB Output is correct
32 Correct 455 ms 93560 KB Output is correct
33 Correct 369 ms 81208 KB Output is correct
34 Correct 979 ms 77904 KB Output is correct
35 Correct 28 ms 47980 KB Output is correct
36 Correct 25 ms 47964 KB Output is correct
37 Correct 27 ms 48216 KB Output is correct
38 Correct 24 ms 47912 KB Output is correct
39 Correct 24 ms 47964 KB Output is correct
40 Correct 24 ms 47964 KB Output is correct
41 Correct 24 ms 47876 KB Output is correct
42 Correct 27 ms 47956 KB Output is correct
43 Correct 25 ms 47960 KB Output is correct
44 Correct 25 ms 47988 KB Output is correct
45 Correct 25 ms 47964 KB Output is correct
46 Correct 24 ms 47964 KB Output is correct
47 Correct 24 ms 47836 KB Output is correct
48 Correct 25 ms 47828 KB Output is correct
49 Correct 25 ms 47960 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 25 ms 47964 KB Output is correct
2 Correct 499 ms 95104 KB Output is correct
3 Correct 1524 ms 90164 KB Output is correct
4 Correct 774 ms 91216 KB Output is correct
5 Correct 2467 ms 77988 KB Output is correct
6 Correct 960 ms 77904 KB Output is correct
7 Correct 598 ms 77864 KB Output is correct
8 Correct 253 ms 78576 KB Output is correct
9 Correct 442 ms 89936 KB Output is correct
10 Correct 1244 ms 93152 KB Output is correct
11 Correct 1041 ms 78380 KB Output is correct
12 Execution timed out 4046 ms 78164 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 47964 KB Output is correct
2 Correct 500 ms 91752 KB Output is correct
3 Correct 1805 ms 86388 KB Output is correct
4 Correct 752 ms 89428 KB Output is correct
5 Correct 2629 ms 79612 KB Output is correct
6 Correct 2339 ms 79568 KB Output is correct
7 Correct 1508 ms 79452 KB Output is correct
8 Correct 298 ms 79688 KB Output is correct
9 Correct 488 ms 96640 KB Output is correct
10 Correct 1431 ms 94084 KB Output is correct
11 Correct 1228 ms 80964 KB Output is correct
12 Execution timed out 4057 ms 77908 KB Time limit exceeded
13 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 24 ms 47960 KB Output is correct
2 Correct 24 ms 47752 KB Output is correct
3 Correct 25 ms 47960 KB Output is correct
4 Correct 25 ms 47964 KB Output is correct
5 Correct 26 ms 47984 KB Output is correct
6 Correct 25 ms 47964 KB Output is correct
7 Correct 25 ms 47964 KB Output is correct
8 Correct 29 ms 48060 KB Output is correct
9 Correct 25 ms 47976 KB Output is correct
10 Correct 24 ms 47964 KB Output is correct
11 Correct 24 ms 47920 KB Output is correct
12 Correct 24 ms 47964 KB Output is correct
13 Correct 24 ms 47964 KB Output is correct
14 Correct 24 ms 47764 KB Output is correct
15 Correct 24 ms 47848 KB Output is correct
16 Correct 26 ms 47956 KB Output is correct
17 Correct 24 ms 47960 KB Output is correct
18 Correct 24 ms 47964 KB Output is correct
19 Correct 25 ms 47964 KB Output is correct
20 Correct 25 ms 47940 KB Output is correct
21 Correct 25 ms 47964 KB Output is correct
22 Correct 24 ms 47964 KB Output is correct
23 Correct 24 ms 47808 KB Output is correct
24 Correct 24 ms 47964 KB Output is correct
25 Correct 27 ms 47972 KB Output is correct
26 Correct 24 ms 47964 KB Output is correct
27 Correct 25 ms 47964 KB Output is correct
28 Correct 24 ms 47824 KB Output is correct
29 Correct 23 ms 47964 KB Output is correct
30 Correct 305 ms 81280 KB Output is correct
31 Correct 643 ms 78036 KB Output is correct
32 Correct 370 ms 90612 KB Output is correct
33 Correct 409 ms 79520 KB Output is correct
34 Correct 533 ms 79508 KB Output is correct
35 Correct 530 ms 79844 KB Output is correct
36 Correct 336 ms 79948 KB Output is correct
37 Correct 378 ms 98028 KB Output is correct
38 Correct 399 ms 93524 KB Output is correct
39 Correct 291 ms 81120 KB Output is correct
40 Correct 598 ms 78160 KB Output is correct
41 Correct 283 ms 78404 KB Output is correct
42 Correct 522 ms 78492 KB Output is correct
43 Correct 514 ms 78288 KB Output is correct
44 Correct 412 ms 78156 KB Output is correct
45 Correct 693 ms 78948 KB Output is correct
46 Correct 27 ms 47964 KB Output is correct
47 Correct 26 ms 47972 KB Output is correct
48 Correct 25 ms 47996 KB Output is correct
49 Correct 25 ms 47956 KB Output is correct
50 Correct 28 ms 47960 KB Output is correct
51 Correct 24 ms 47964 KB Output is correct
52 Correct 326 ms 81084 KB Output is correct
53 Correct 835 ms 78032 KB Output is correct
54 Correct 378 ms 95800 KB Output is correct
55 Correct 493 ms 79636 KB Output is correct
56 Correct 655 ms 79336 KB Output is correct
57 Correct 645 ms 79508 KB Output is correct
58 Correct 415 ms 80044 KB Output is correct
59 Correct 326 ms 92492 KB Output is correct
60 Correct 455 ms 93560 KB Output is correct
61 Correct 369 ms 81208 KB Output is correct
62 Correct 979 ms 77904 KB Output is correct
63 Correct 28 ms 47980 KB Output is correct
64 Correct 25 ms 47964 KB Output is correct
65 Correct 27 ms 48216 KB Output is correct
66 Correct 24 ms 47912 KB Output is correct
67 Correct 24 ms 47964 KB Output is correct
68 Correct 24 ms 47964 KB Output is correct
69 Correct 24 ms 47876 KB Output is correct
70 Correct 27 ms 47956 KB Output is correct
71 Correct 25 ms 47960 KB Output is correct
72 Correct 25 ms 47988 KB Output is correct
73 Correct 25 ms 47964 KB Output is correct
74 Correct 24 ms 47964 KB Output is correct
75 Correct 24 ms 47836 KB Output is correct
76 Correct 25 ms 47828 KB Output is correct
77 Correct 25 ms 47960 KB Output is correct
78 Correct 25 ms 47964 KB Output is correct
79 Correct 499 ms 95104 KB Output is correct
80 Correct 1524 ms 90164 KB Output is correct
81 Correct 774 ms 91216 KB Output is correct
82 Correct 2467 ms 77988 KB Output is correct
83 Correct 960 ms 77904 KB Output is correct
84 Correct 598 ms 77864 KB Output is correct
85 Correct 253 ms 78576 KB Output is correct
86 Correct 442 ms 89936 KB Output is correct
87 Correct 1244 ms 93152 KB Output is correct
88 Correct 1041 ms 78380 KB Output is correct
89 Execution timed out 4046 ms 78164 KB Time limit exceeded
90 Halted 0 ms 0 KB -