oj.uz

Submission #978657

# Submission time Handle Problem Language Result Execution time Memory
978657 2024-05-09T12:33:59 Z vjudge1 Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 123188 KB 
#include <bits/stdc++.h>
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")

using namespace std;

int n,L,q;
vector<int> g[200005],f[200005];
int t[200005];
int h[200005],tin[200005],curtin;
int v[200005],pos[200005];
int firstson[200005][45],lastson[200005][45];

void dfs(int nod)
{
    tin[nod] = ++curtin;
    for (auto vecin : g[nod])
    {
        if (vecin != t[nod])
        {
            t[vecin] = nod;
            f[nod].push_back(vecin);
            h[vecin] = 1 + h[nod];
            dfs(vecin);
        }
    }
}

bool cmp(int x,int y)
{
    if (h[x] != h[y])
        return h[x] < h[y];
    return tin[x] < tin[y];
}

int aint[800005];

int vkk[200005];

int bulan = 25;

void update(int nod,int l,int r,int st,int dr,int val)
{
    if (r < st or dr < l)
        return;
    st = max(st,l);
    dr = min(dr,r);
    if (st == l and r == dr)
    {
        aint[nod] = 1ll * aint[nod] * val % L;
        //cout << nod << ' ' << l << ' ' << r << ' ' << aint[nod] << endl;
        return;
    }
    if (dr - st + 1 <= bulan)
    {
        for (int i = st; i <= dr; i++)
            vkk[i] = 1ll * vkk[i] * val % L;
        return;
    }
    int mij = (l + r) / 2;
    update(2 * nod,l,mij,st,dr,val);
    update(2 * nod + 1,mij + 1,r,st,dr,val);
}

int paint[200005];

void build(int nod,int l,int r)
{
    if (l == r)
        paint[l] = nod;
    else
    {
        int mij = (l + r) / 2;
        build(2 * nod,l,mij);
        build(2 * nod + 1,mij + 1,r);
    }
}

signed main()
{
    srand(6824);
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
    cin >> n >> L;
    for (int i = 1; i < n; i++)
    {
        int x,y;
        cin >> x >> y;
        g[x].push_back(y);
        g[y].push_back(x);
    }
    dfs(rand() % n + 1);
    for (int i = 1; i <= n; i++)
        v[i] = i;
    sort(v + 1,v + n + 1,cmp);
    for (int i = 1; i <= n; i++)
        pos[v[i]] = i;
    for (int i = 1; i <= 4 * n; i++)
        aint[i] = 1;
    build(1,1,n);
    for (int i = 1; i <= n; i++)
        vkk[i] = 1;
    for (int i = 1; i <= n; i++)
    {
        int xx;
        cin >> xx;
        update(1,1,n,pos[i],pos[i],xx);
    }
    for (int i = 1; i <= n; i++)
    {
        int nod = i;
        for (int j = 0; j <= 40; j++)
        {
            if (firstson[nod][j] == 0 or pos[i] < pos[firstson[nod][j]])
                firstson[nod][j] = i;
            if (lastson[nod][j] == 0 or pos[i] > pos[lastson[nod][j]])
                lastson[nod][j] = i;
            nod = t[nod];
            if (nod == 0)
                break;
        }
    }
    cin >> q;
    for (int i = 1; i <= q; i++)
    {
        int tip;
        cin >> tip;
        if (tip == 1)
        {
            int x,d,w;
            cin >> x >> d >> w;
            vector<int> ruta;
            int nod = x;
            for (int j = 0; j <= min(d,h[x]); j++)
            {
                ruta.push_back(nod);
                nod = t[nod];
            }
            nod = ruta.back();
            ruta.pop_back();
            int dist = d - (h[x] - h[nod]);
            for (int j = 0; j <= dist; j++)
            {
                if (firstson[nod][j] == 0)
                    break;
                int lu = pos[firstson[nod][j]],ru = pos[lastson[nod][j]];
                update(1,1,n,lu,ru,w);
            }
            while (!ruta.empty())
            {
                nod = ruta.back();
                ruta.pop_back();
                int dist = d - (h[x] - h[nod]);
                for (int j = dist - 1; j <= dist; j++)
                {
                    if (firstson[nod][j] == 0)
                        break;
                    int lu = pos[firstson[nod][j]],ru = pos[lastson[nod][j]];
                    if (ru - lu + 1 <= bulan)
                    {
                        for (int jj = lu; jj <= ru; jj++)
                            vkk[jj] = 1ll * vkk[jj] * w % L;
                    }
                    else
                        update(1,1,n,lu,ru,w);
                }
            }
        }
        else
        {
            int x;
            cin >> x;
            int vjj = vkk[pos[x]];
            x = paint[pos[x]];
            int rsp = 1ll * aint[1] * vjj % L;
            while (x != 1)
            {
                rsp = 1ll * rsp * aint[x] % L;
                x /= 2;
            }
            //cout << pos[x] << ' ';
            cout << rsp << '\n';
        }
    }
    return 0;
}

/**
Rezolvarea se bazeaza pe faptul ca D mic
Dupa ce fac ordinea dfs, pun nodurile intr-un sir sortate dupa inaltime si, la egalitate, dupa tin
La un update, iau al max(h[i],D)-lea stramos al lui x, fie el y. Updatez, pe inaltimile h[y] + k pentru k de la 0 la D - (h[x] - h[y]), subarborele
Apoi, merg nod dupa nod cu y spre x, la fiecare pas updatez ultimele doua nivele la care ajunge nodul curent y
Un update este de range prod si query de point value, deci pot face cu un aib care tine chestiile modulo L
Complexitate update: D * log, query: log
Pentru a afla care sunt primul si ultimul nod de la o inaltime care sunt in subarborele meu, inaltime <= D + h[nod], pot doar sa precalculez in N*D

Complexitate: O(N * D + N * logN + Q * D * logN)

Exista o micuta problema, aib-ul nu cred ca isi face treaba deoarece L nu e prim, incercam aint si fingers crossed sa nu dea TLE
**/

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14936 KB Output is correct
4 Correct 4 ms 15196 KB Output is correct
5 Correct 7 ms 15196 KB Output is correct
6 Correct 5 ms 15196 KB Output is correct
7 Correct 5 ms 15316 KB Output is correct
8 Correct 6 ms 15196 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 3 ms 14684 KB Output is correct
15 Correct 3 ms 14936 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 3 ms 14680 KB Output is correct
19 Correct 3 ms 14892 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14904 KB Output is correct
22 Correct 3 ms 14684 KB Output is correct
23 Correct 3 ms 14684 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 3 ms 14900 KB Output is correct
26 Correct 3 ms 14684 KB Output is correct
27 Correct 3 ms 14684 KB Output is correct
28 Correct 3 ms 14684 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14684 KB Output is correct
2 Correct 582 ms 102740 KB Output is correct
3 Correct 659 ms 99688 KB Output is correct
4 Correct 659 ms 114540 KB Output is correct
5 Correct 595 ms 101040 KB Output is correct
6 Correct 392 ms 100180 KB Output is correct
7 Correct 384 ms 100044 KB Output is correct
8 Correct 288 ms 98720 KB Output is correct
9 Correct 618 ms 121856 KB Output is correct
10 Correct 716 ms 114952 KB Output is correct
11 Correct 580 ms 102672 KB Output is correct
12 Correct 686 ms 99532 KB Output is correct
13 Correct 390 ms 97736 KB Output is correct
14 Correct 414 ms 97368 KB Output is correct
15 Correct 377 ms 97768 KB Output is correct
16 Correct 362 ms 97580 KB Output is correct
17 Correct 408 ms 98396 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 3 ms 14772 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 4 ms 14888 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 14684 KB Output is correct
2 Correct 582 ms 102740 KB Output is correct
3 Correct 659 ms 99688 KB Output is correct
4 Correct 659 ms 114540 KB Output is correct
5 Correct 595 ms 101040 KB Output is correct
6 Correct 392 ms 100180 KB Output is correct
7 Correct 384 ms 100044 KB Output is correct
8 Correct 288 ms 98720 KB Output is correct
9 Correct 618 ms 121856 KB Output is correct
10 Correct 716 ms 114952 KB Output is correct
11 Correct 580 ms 102672 KB Output is correct
12 Correct 686 ms 99532 KB Output is correct
13 Correct 390 ms 97736 KB Output is correct
14 Correct 414 ms 97368 KB Output is correct
15 Correct 377 ms 97768 KB Output is correct
16 Correct 362 ms 97580 KB Output is correct
17 Correct 408 ms 98396 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 3 ms 14772 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 4 ms 14888 KB Output is correct
23 Correct 3 ms 14680 KB Output is correct
24 Correct 593 ms 102744 KB Output is correct
25 Correct 707 ms 99696 KB Output is correct
26 Correct 697 ms 119156 KB Output is correct
27 Correct 598 ms 101204 KB Output is correct
28 Correct 448 ms 100432 KB Output is correct
29 Correct 444 ms 99920 KB Output is correct
30 Correct 316 ms 98628 KB Output is correct
31 Correct 685 ms 117208 KB Output is correct
32 Correct 755 ms 117364 KB Output is correct
33 Correct 576 ms 102840 KB Output is correct
34 Correct 693 ms 99624 KB Output is correct
35 Correct 3 ms 14684 KB Output is correct
36 Correct 3 ms 14684 KB Output is correct
37 Correct 3 ms 14684 KB Output is correct
38 Correct 3 ms 14684 KB Output is correct
39 Correct 3 ms 14684 KB Output is correct
40 Correct 4 ms 14684 KB Output is correct
41 Correct 3 ms 14684 KB Output is correct
42 Correct 3 ms 14684 KB Output is correct
43 Correct 3 ms 14908 KB Output is correct
44 Correct 3 ms 14684 KB Output is correct
45 Correct 3 ms 14684 KB Output is correct
46 Correct 3 ms 14684 KB Output is correct
47 Correct 3 ms 14908 KB Output is correct
48 Correct 3 ms 14684 KB Output is correct
49 Correct 3 ms 14684 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 925 ms 117820 KB Output is correct
3 Correct 2522 ms 119688 KB Output is correct
4 Correct 1241 ms 120464 KB Output is correct
5 Correct 1398 ms 100008 KB Output is correct
6 Correct 1267 ms 99024 KB Output is correct
7 Correct 1055 ms 98676 KB Output is correct
8 Correct 316 ms 97424 KB Output is correct
9 Correct 882 ms 116644 KB Output is correct
10 Correct 2559 ms 119708 KB Output is correct
11 Correct 911 ms 99988 KB Output is correct
12 Correct 3421 ms 99856 KB Output is correct
13 Execution timed out 4022 ms 97652 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 856 ms 123188 KB Output is correct
3 Correct 2649 ms 118892 KB Output is correct
4 Correct 1251 ms 115764 KB Output is correct
5 Correct 1440 ms 101372 KB Output is correct
6 Correct 1287 ms 100412 KB Output is correct
7 Correct 1120 ms 100040 KB Output is correct
8 Correct 334 ms 98436 KB Output is correct
9 Correct 873 ms 116424 KB Output is correct
10 Correct 2562 ms 113496 KB Output is correct
11 Correct 952 ms 102928 KB Output is correct
12 Correct 3357 ms 99516 KB Output is correct
13 Execution timed out 4059 ms 97684 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14936 KB Output is correct
4 Correct 4 ms 15196 KB Output is correct
5 Correct 7 ms 15196 KB Output is correct
6 Correct 5 ms 15196 KB Output is correct
7 Correct 5 ms 15316 KB Output is correct
8 Correct 6 ms 15196 KB Output is correct
9 Correct 3 ms 14684 KB Output is correct
10 Correct 3 ms 14684 KB Output is correct
11 Correct 3 ms 14684 KB Output is correct
12 Correct 3 ms 14684 KB Output is correct
13 Correct 3 ms 14684 KB Output is correct
14 Correct 3 ms 14684 KB Output is correct
15 Correct 3 ms 14936 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 3 ms 14684 KB Output is correct
18 Correct 3 ms 14680 KB Output is correct
19 Correct 3 ms 14892 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14904 KB Output is correct
22 Correct 3 ms 14684 KB Output is correct
23 Correct 3 ms 14684 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 3 ms 14900 KB Output is correct
26 Correct 3 ms 14684 KB Output is correct
27 Correct 3 ms 14684 KB Output is correct
28 Correct 3 ms 14684 KB Output is correct
29 Correct 5 ms 14684 KB Output is correct
30 Correct 582 ms 102740 KB Output is correct
31 Correct 659 ms 99688 KB Output is correct
32 Correct 659 ms 114540 KB Output is correct
33 Correct 595 ms 101040 KB Output is correct
34 Correct 392 ms 100180 KB Output is correct
35 Correct 384 ms 100044 KB Output is correct
36 Correct 288 ms 98720 KB Output is correct
37 Correct 618 ms 121856 KB Output is correct
38 Correct 716 ms 114952 KB Output is correct
39 Correct 580 ms 102672 KB Output is correct
40 Correct 686 ms 99532 KB Output is correct
41 Correct 390 ms 97736 KB Output is correct
42 Correct 414 ms 97368 KB Output is correct
43 Correct 377 ms 97768 KB Output is correct
44 Correct 362 ms 97580 KB Output is correct
45 Correct 408 ms 98396 KB Output is correct
46 Correct 3 ms 14684 KB Output is correct
47 Correct 3 ms 14684 KB Output is correct
48 Correct 3 ms 14772 KB Output is correct
49 Correct 3 ms 14684 KB Output is correct
50 Correct 4 ms 14888 KB Output is correct
51 Correct 3 ms 14680 KB Output is correct
52 Correct 593 ms 102744 KB Output is correct
53 Correct 707 ms 99696 KB Output is correct
54 Correct 697 ms 119156 KB Output is correct
55 Correct 598 ms 101204 KB Output is correct
56 Correct 448 ms 100432 KB Output is correct
57 Correct 444 ms 99920 KB Output is correct
58 Correct 316 ms 98628 KB Output is correct
59 Correct 685 ms 117208 KB Output is correct
60 Correct 755 ms 117364 KB Output is correct
61 Correct 576 ms 102840 KB Output is correct
62 Correct 693 ms 99624 KB Output is correct
63 Correct 3 ms 14684 KB Output is correct
64 Correct 3 ms 14684 KB Output is correct
65 Correct 3 ms 14684 KB Output is correct
66 Correct 3 ms 14684 KB Output is correct
67 Correct 3 ms 14684 KB Output is correct
68 Correct 4 ms 14684 KB Output is correct
69 Correct 3 ms 14684 KB Output is correct
70 Correct 3 ms 14684 KB Output is correct
71 Correct 3 ms 14908 KB Output is correct
72 Correct 3 ms 14684 KB Output is correct
73 Correct 3 ms 14684 KB Output is correct
74 Correct 3 ms 14684 KB Output is correct
75 Correct 3 ms 14908 KB Output is correct
76 Correct 3 ms 14684 KB Output is correct
77 Correct 3 ms 14684 KB Output is correct
78 Correct 3 ms 14684 KB Output is correct
79 Correct 925 ms 117820 KB Output is correct
80 Correct 2522 ms 119688 KB Output is correct
81 Correct 1241 ms 120464 KB Output is correct
82 Correct 1398 ms 100008 KB Output is correct
83 Correct 1267 ms 99024 KB Output is correct
84 Correct 1055 ms 98676 KB Output is correct
85 Correct 316 ms 97424 KB Output is correct
86 Correct 882 ms 116644 KB Output is correct
87 Correct 2559 ms 119708 KB Output is correct
88 Correct 911 ms 99988 KB Output is correct
89 Correct 3421 ms 99856 KB Output is correct
90 Execution timed out 4022 ms 97652 KB Time limit exceeded
91 Halted 0 ms 0 KB -