oj.uz

Submission #978628

# Submission time Handle Problem Language Result Execution time Memory
978628 2024-05-09T11:55:44 Z vjudge1 Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 201028 KB 
#include <bits/stdc++.h>

using namespace std;

#define int long long

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];

void update(int nod,int l,int r,int st,int dr,int val)
{
    if (r < st or dr < l)
        return;
    if (st <= l and r <= dr)
    {
        aint[nod] = aint[nod] * val % L;
        //cout << nod << ' ' << l << ' ' << r << ' ' << aint[nod] << endl;
        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 query(int nod,int l,int r,int pos)
{
    if (l == r)
    {
        //cout << nod << ' ' << l << ' ' << r << ' ' << aint[nod] << endl;
        return aint[nod];
    }
    int mij = (l + r) / 2;
    if (pos <= mij)
        return aint[nod] * query(2 * nod,l,mij,pos) % L;
    else
        return aint[nod] * query(2 * nod + 1,mij + 1,r,pos) % L;
}

signed main()
{
    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(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;
    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]];
                    update(1,1,n,lu,ru,w);
                }
            }
        }
        else
        {
            int x;
            cin >> x;
            int rsp = query(1,1,n,pos[x]);
            //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 14936 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 6 ms 15708 KB Output is correct
5 Correct 5 ms 15708 KB Output is correct
6 Correct 5 ms 15708 KB Output is correct
7 Correct 4 ms 15708 KB Output is correct
8 Correct 5 ms 15652 KB Output is correct
9 Correct 4 ms 14684 KB Output is correct
10 Correct 4 ms 14684 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 3 ms 14684 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14936 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 3 ms 14940 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 3 ms 14936 KB Output is correct
23 Correct 3 ms 14936 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 3 ms 14832 KB Output is correct
26 Correct 3 ms 14684 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 3 ms 14936 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 690 ms 188096 KB Output is correct
3 Correct 980 ms 188484 KB Output is correct
4 Correct 803 ms 197392 KB Output is correct
5 Correct 769 ms 188648 KB Output is correct
6 Correct 552 ms 187808 KB Output is correct
7 Correct 547 ms 187860 KB Output is correct
8 Correct 394 ms 186424 KB Output is correct
9 Correct 768 ms 201028 KB Output is correct
10 Correct 969 ms 200548 KB Output is correct
11 Correct 659 ms 187984 KB Output is correct
12 Correct 893 ms 188384 KB Output is correct
13 Correct 470 ms 187948 KB Output is correct
14 Correct 483 ms 187284 KB Output is correct
15 Correct 450 ms 186504 KB Output is correct
16 Correct 454 ms 187052 KB Output is correct
17 Correct 486 ms 187920 KB Output is correct
18 Correct 3 ms 14940 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 4 ms 14940 KB Output is correct
21 Correct 3 ms 14940 KB Output is correct
22 Correct 3 ms 14936 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 690 ms 188096 KB Output is correct
3 Correct 980 ms 188484 KB Output is correct
4 Correct 803 ms 197392 KB Output is correct
5 Correct 769 ms 188648 KB Output is correct
6 Correct 552 ms 187808 KB Output is correct
7 Correct 547 ms 187860 KB Output is correct
8 Correct 394 ms 186424 KB Output is correct
9 Correct 768 ms 201028 KB Output is correct
10 Correct 969 ms 200548 KB Output is correct
11 Correct 659 ms 187984 KB Output is correct
12 Correct 893 ms 188384 KB Output is correct
13 Correct 470 ms 187948 KB Output is correct
14 Correct 483 ms 187284 KB Output is correct
15 Correct 450 ms 186504 KB Output is correct
16 Correct 454 ms 187052 KB Output is correct
17 Correct 486 ms 187920 KB Output is correct
18 Correct 3 ms 14940 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 4 ms 14940 KB Output is correct
21 Correct 3 ms 14940 KB Output is correct
22 Correct 3 ms 14936 KB Output is correct
23 Correct 3 ms 14684 KB Output is correct
24 Correct 677 ms 188288 KB Output is correct
25 Correct 1084 ms 188612 KB Output is correct
26 Correct 855 ms 200788 KB Output is correct
27 Correct 809 ms 188332 KB Output is correct
28 Correct 610 ms 187944 KB Output is correct
29 Correct 597 ms 187464 KB Output is correct
30 Correct 404 ms 186424 KB Output is correct
31 Correct 732 ms 197456 KB Output is correct
32 Correct 1131 ms 200624 KB Output is correct
33 Correct 681 ms 188048 KB Output is correct
34 Correct 1101 ms 188520 KB Output is correct
35 Correct 3 ms 14684 KB Output is correct
36 Correct 3 ms 14876 KB Output is correct
37 Correct 3 ms 14940 KB Output is correct
38 Correct 3 ms 14940 KB Output is correct
39 Correct 3 ms 14936 KB Output is correct
40 Correct 3 ms 14684 KB Output is correct
41 Correct 4 ms 14832 KB Output is correct
42 Correct 3 ms 14684 KB Output is correct
43 Correct 3 ms 14836 KB Output is correct
44 Correct 3 ms 14940 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 14940 KB Output is correct
48 Correct 3 ms 14684 KB Output is correct
49 Correct 3 ms 14940 KB Output is correct

Subtask #4
0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14680 KB Output is correct
2 Correct 1521 ms 198464 KB Output is correct
3 Execution timed out 4067 ms 193592 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14684 KB Output is correct
2 Correct 1490 ms 196828 KB Output is correct
3 Execution timed out 4059 ms 190804 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 14936 KB Output is correct
2 Correct 3 ms 14684 KB Output is correct
3 Correct 3 ms 14684 KB Output is correct
4 Correct 6 ms 15708 KB Output is correct
5 Correct 5 ms 15708 KB Output is correct
6 Correct 5 ms 15708 KB Output is correct
7 Correct 4 ms 15708 KB Output is correct
8 Correct 5 ms 15652 KB Output is correct
9 Correct 4 ms 14684 KB Output is correct
10 Correct 4 ms 14684 KB Output is correct
11 Correct 3 ms 14940 KB Output is correct
12 Correct 3 ms 14940 KB Output is correct
13 Correct 3 ms 14940 KB Output is correct
14 Correct 3 ms 14684 KB Output is correct
15 Correct 3 ms 14940 KB Output is correct
16 Correct 3 ms 14936 KB Output is correct
17 Correct 3 ms 14936 KB Output is correct
18 Correct 3 ms 14940 KB Output is correct
19 Correct 3 ms 14684 KB Output is correct
20 Correct 3 ms 14684 KB Output is correct
21 Correct 3 ms 14684 KB Output is correct
22 Correct 3 ms 14936 KB Output is correct
23 Correct 3 ms 14936 KB Output is correct
24 Correct 3 ms 14684 KB Output is correct
25 Correct 3 ms 14832 KB Output is correct
26 Correct 3 ms 14684 KB Output is correct
27 Correct 3 ms 14940 KB Output is correct
28 Correct 3 ms 14936 KB Output is correct
29 Correct 3 ms 14684 KB Output is correct
30 Correct 690 ms 188096 KB Output is correct
31 Correct 980 ms 188484 KB Output is correct
32 Correct 803 ms 197392 KB Output is correct
33 Correct 769 ms 188648 KB Output is correct
34 Correct 552 ms 187808 KB Output is correct
35 Correct 547 ms 187860 KB Output is correct
36 Correct 394 ms 186424 KB Output is correct
37 Correct 768 ms 201028 KB Output is correct
38 Correct 969 ms 200548 KB Output is correct
39 Correct 659 ms 187984 KB Output is correct
40 Correct 893 ms 188384 KB Output is correct
41 Correct 470 ms 187948 KB Output is correct
42 Correct 483 ms 187284 KB Output is correct
43 Correct 450 ms 186504 KB Output is correct
44 Correct 454 ms 187052 KB Output is correct
45 Correct 486 ms 187920 KB Output is correct
46 Correct 3 ms 14940 KB Output is correct
47 Correct 3 ms 14684 KB Output is correct
48 Correct 4 ms 14940 KB Output is correct
49 Correct 3 ms 14940 KB Output is correct
50 Correct 3 ms 14936 KB Output is correct
51 Correct 3 ms 14684 KB Output is correct
52 Correct 677 ms 188288 KB Output is correct
53 Correct 1084 ms 188612 KB Output is correct
54 Correct 855 ms 200788 KB Output is correct
55 Correct 809 ms 188332 KB Output is correct
56 Correct 610 ms 187944 KB Output is correct
57 Correct 597 ms 187464 KB Output is correct
58 Correct 404 ms 186424 KB Output is correct
59 Correct 732 ms 197456 KB Output is correct
60 Correct 1131 ms 200624 KB Output is correct
61 Correct 681 ms 188048 KB Output is correct
62 Correct 1101 ms 188520 KB Output is correct
63 Correct 3 ms 14684 KB Output is correct
64 Correct 3 ms 14876 KB Output is correct
65 Correct 3 ms 14940 KB Output is correct
66 Correct 3 ms 14940 KB Output is correct
67 Correct 3 ms 14936 KB Output is correct
68 Correct 3 ms 14684 KB Output is correct
69 Correct 4 ms 14832 KB Output is correct
70 Correct 3 ms 14684 KB Output is correct
71 Correct 3 ms 14836 KB Output is correct
72 Correct 3 ms 14940 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 14940 KB Output is correct
76 Correct 3 ms 14684 KB Output is correct
77 Correct 3 ms 14940 KB Output is correct
78 Correct 3 ms 14680 KB Output is correct
79 Correct 1521 ms 198464 KB Output is correct
80 Execution timed out 4067 ms 193592 KB Time limit exceeded
81 Halted 0 ms 0 KB -