oj.uz

답안 #978630

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
978630 2024-05-09T11:58:53 Z vjudge1 Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 118612 KB 
#include <bits/stdc++.h>

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

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] = 1ll * 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 1ll * aint[nod] * query(2 * nod,l,mij,pos) % L;
    else
        return 1ll * 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

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 13144 KB Output is correct
2 Correct 3 ms 13148 KB Output is correct
3 Correct 3 ms 13148 KB Output is correct
4 Correct 5 ms 13656 KB Output is correct
5 Correct 6 ms 13776 KB Output is correct
6 Correct 4 ms 13660 KB Output is correct
7 Correct 4 ms 13912 KB Output is correct
8 Correct 3 ms 13660 KB Output is correct
9 Correct 4 ms 13148 KB Output is correct
10 Correct 3 ms 13148 KB Output is correct
11 Correct 3 ms 13148 KB Output is correct
12 Correct 3 ms 13148 KB Output is correct
13 Correct 3 ms 13148 KB Output is correct
14 Correct 4 ms 13264 KB Output is correct
15 Correct 3 ms 13148 KB Output is correct
16 Correct 4 ms 13148 KB Output is correct
17 Correct 3 ms 13148 KB Output is correct
18 Correct 3 ms 13148 KB Output is correct
19 Correct 3 ms 13148 KB Output is correct
20 Correct 3 ms 13148 KB Output is correct
21 Correct 3 ms 13148 KB Output is correct
22 Correct 3 ms 13148 KB Output is correct
23 Correct 3 ms 13148 KB Output is correct
24 Correct 3 ms 13144 KB Output is correct
25 Correct 3 ms 13148 KB Output is correct
26 Correct 3 ms 13148 KB Output is correct
27 Correct 3 ms 13148 KB Output is correct
28 Correct 3 ms 13344 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 13148 KB Output is correct
2 Correct 560 ms 101176 KB Output is correct
3 Correct 737 ms 97956 KB Output is correct
4 Correct 736 ms 112048 KB Output is correct
5 Correct 641 ms 99620 KB Output is correct
6 Correct 483 ms 98712 KB Output is correct
7 Correct 522 ms 98676 KB Output is correct
8 Correct 381 ms 97216 KB Output is correct
9 Correct 670 ms 118612 KB Output is correct
10 Correct 874 ms 114348 KB Output is correct
11 Correct 558 ms 101020 KB Output is correct
12 Correct 757 ms 98132 KB Output is correct
13 Correct 440 ms 96196 KB Output is correct
14 Correct 469 ms 96180 KB Output is correct
15 Correct 410 ms 96336 KB Output is correct
16 Correct 413 ms 95784 KB Output is correct
17 Correct 438 ms 96732 KB Output is correct
18 Correct 3 ms 13144 KB Output is correct
19 Correct 3 ms 13148 KB Output is correct
20 Correct 3 ms 13148 KB Output is correct
21 Correct 3 ms 13148 KB Output is correct
22 Correct 3 ms 13144 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 13148 KB Output is correct
2 Correct 560 ms 101176 KB Output is correct
3 Correct 737 ms 97956 KB Output is correct
4 Correct 736 ms 112048 KB Output is correct
5 Correct 641 ms 99620 KB Output is correct
6 Correct 483 ms 98712 KB Output is correct
7 Correct 522 ms 98676 KB Output is correct
8 Correct 381 ms 97216 KB Output is correct
9 Correct 670 ms 118612 KB Output is correct
10 Correct 874 ms 114348 KB Output is correct
11 Correct 558 ms 101020 KB Output is correct
12 Correct 757 ms 98132 KB Output is correct
13 Correct 440 ms 96196 KB Output is correct
14 Correct 469 ms 96180 KB Output is correct
15 Correct 410 ms 96336 KB Output is correct
16 Correct 413 ms 95784 KB Output is correct
17 Correct 438 ms 96732 KB Output is correct
18 Correct 3 ms 13144 KB Output is correct
19 Correct 3 ms 13148 KB Output is correct
20 Correct 3 ms 13148 KB Output is correct
21 Correct 3 ms 13148 KB Output is correct
22 Correct 3 ms 13144 KB Output is correct
23 Correct 3 ms 13144 KB Output is correct
24 Correct 595 ms 101212 KB Output is correct
25 Correct 917 ms 98092 KB Output is correct
26 Correct 824 ms 116120 KB Output is correct
27 Correct 654 ms 99536 KB Output is correct
28 Correct 571 ms 98912 KB Output is correct
29 Correct 481 ms 98484 KB Output is correct
30 Correct 364 ms 97168 KB Output is correct
31 Correct 682 ms 113924 KB Output is correct
32 Correct 1142 ms 114000 KB Output is correct
33 Correct 640 ms 101300 KB Output is correct
34 Correct 956 ms 98024 KB Output is correct
35 Correct 4 ms 13148 KB Output is correct
36 Correct 3 ms 13148 KB Output is correct
37 Correct 3 ms 13148 KB Output is correct
38 Correct 4 ms 13148 KB Output is correct
39 Correct 3 ms 13348 KB Output is correct
40 Correct 3 ms 13148 KB Output is correct
41 Correct 3 ms 13144 KB Output is correct
42 Correct 3 ms 13148 KB Output is correct
43 Correct 4 ms 13148 KB Output is correct
44 Correct 3 ms 13148 KB Output is correct
45 Correct 8 ms 13348 KB Output is correct
46 Correct 3 ms 13148 KB Output is correct
47 Correct 3 ms 13148 KB Output is correct
48 Correct 3 ms 13148 KB Output is correct
49 Correct 3 ms 13148 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 13148 KB Output is correct
2 Correct 1453 ms 115556 KB Output is correct
3 Execution timed out 4033 ms 111200 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 13148 KB Output is correct
2 Correct 1398 ms 113140 KB Output is correct
3 Execution timed out 4061 ms 108088 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 13144 KB Output is correct
2 Correct 3 ms 13148 KB Output is correct
3 Correct 3 ms 13148 KB Output is correct
4 Correct 5 ms 13656 KB Output is correct
5 Correct 6 ms 13776 KB Output is correct
6 Correct 4 ms 13660 KB Output is correct
7 Correct 4 ms 13912 KB Output is correct
8 Correct 3 ms 13660 KB Output is correct
9 Correct 4 ms 13148 KB Output is correct
10 Correct 3 ms 13148 KB Output is correct
11 Correct 3 ms 13148 KB Output is correct
12 Correct 3 ms 13148 KB Output is correct
13 Correct 3 ms 13148 KB Output is correct
14 Correct 4 ms 13264 KB Output is correct
15 Correct 3 ms 13148 KB Output is correct
16 Correct 4 ms 13148 KB Output is correct
17 Correct 3 ms 13148 KB Output is correct
18 Correct 3 ms 13148 KB Output is correct
19 Correct 3 ms 13148 KB Output is correct
20 Correct 3 ms 13148 KB Output is correct
21 Correct 3 ms 13148 KB Output is correct
22 Correct 3 ms 13148 KB Output is correct
23 Correct 3 ms 13148 KB Output is correct
24 Correct 3 ms 13144 KB Output is correct
25 Correct 3 ms 13148 KB Output is correct
26 Correct 3 ms 13148 KB Output is correct
27 Correct 3 ms 13148 KB Output is correct
28 Correct 3 ms 13344 KB Output is correct
29 Correct 2 ms 13148 KB Output is correct
30 Correct 560 ms 101176 KB Output is correct
31 Correct 737 ms 97956 KB Output is correct
32 Correct 736 ms 112048 KB Output is correct
33 Correct 641 ms 99620 KB Output is correct
34 Correct 483 ms 98712 KB Output is correct
35 Correct 522 ms 98676 KB Output is correct
36 Correct 381 ms 97216 KB Output is correct
37 Correct 670 ms 118612 KB Output is correct
38 Correct 874 ms 114348 KB Output is correct
39 Correct 558 ms 101020 KB Output is correct
40 Correct 757 ms 98132 KB Output is correct
41 Correct 440 ms 96196 KB Output is correct
42 Correct 469 ms 96180 KB Output is correct
43 Correct 410 ms 96336 KB Output is correct
44 Correct 413 ms 95784 KB Output is correct
45 Correct 438 ms 96732 KB Output is correct
46 Correct 3 ms 13144 KB Output is correct
47 Correct 3 ms 13148 KB Output is correct
48 Correct 3 ms 13148 KB Output is correct
49 Correct 3 ms 13148 KB Output is correct
50 Correct 3 ms 13144 KB Output is correct
51 Correct 3 ms 13144 KB Output is correct
52 Correct 595 ms 101212 KB Output is correct
53 Correct 917 ms 98092 KB Output is correct
54 Correct 824 ms 116120 KB Output is correct
55 Correct 654 ms 99536 KB Output is correct
56 Correct 571 ms 98912 KB Output is correct
57 Correct 481 ms 98484 KB Output is correct
58 Correct 364 ms 97168 KB Output is correct
59 Correct 682 ms 113924 KB Output is correct
60 Correct 1142 ms 114000 KB Output is correct
61 Correct 640 ms 101300 KB Output is correct
62 Correct 956 ms 98024 KB Output is correct
63 Correct 4 ms 13148 KB Output is correct
64 Correct 3 ms 13148 KB Output is correct
65 Correct 3 ms 13148 KB Output is correct
66 Correct 4 ms 13148 KB Output is correct
67 Correct 3 ms 13348 KB Output is correct
68 Correct 3 ms 13148 KB Output is correct
69 Correct 3 ms 13144 KB Output is correct
70 Correct 3 ms 13148 KB Output is correct
71 Correct 4 ms 13148 KB Output is correct
72 Correct 3 ms 13148 KB Output is correct
73 Correct 8 ms 13348 KB Output is correct
74 Correct 3 ms 13148 KB Output is correct
75 Correct 3 ms 13148 KB Output is correct
76 Correct 3 ms 13148 KB Output is correct
77 Correct 3 ms 13148 KB Output is correct
78 Correct 4 ms 13148 KB Output is correct
79 Correct 1453 ms 115556 KB Output is correct
80 Execution timed out 4033 ms 111200 KB Time limit exceeded
81 Halted 0 ms 0 KB -