oj.uz

Submission #925293

# Submission time Handle Problem Language Result Execution time Memory
925293 2024-02-11T11:00:40 Z alexdd Sprinkler (JOI22_sprinkler) C++17
53 / 100
 4000 ms 191824 KB 
#include<bits/stdc++.h>
using namespace std;

#define int long long
int n,MOD,phi;

int put(int a, int exp)
{
    if(exp==0)
        return 1;
    if(exp%2==0)
        return put((a*a)%MOD,exp/2);
    else
        return (put((a*a)%MOD,exp/2)*a)%MOD;
}

int aint[800005];
void build(int nod, int st, int dr)
{
    aint[nod]=1;
    if(st==dr)
        return;
    int mij=(st+dr)/2;
    build(nod*2,st,mij);
    build(nod*2+1,mij+1,dr);
}
void upd(int nod, int st, int dr, int le, int ri, int newv)
{
    if(le>ri)
        return;
    if(le==st && dr==ri)
    {
        aint[nod]=aint[nod]*newv%MOD;
        return;
    }
    int mij=(st+dr)/2;
    upd(nod*2,st,mij,le,min(mij,ri),newv);
    upd(nod*2+1,mij+1,dr,max(le,mij+1),ri,newv);
}
int qry(int nod, int st, int dr, int poz)
{
    if(st==dr)
        return aint[nod];
    int mij=(st+dr)/2;
    if(poz<=mij) return qry(nod*2,st,mij,poz)*aint[nod]%MOD;
    else return qry(nod*2+1,mij+1,dr,poz)*aint[nod]%MOD;
}

int aib0[200005];
int qry0(int poz)
{
    int aux=0;
    for(int i=poz;i>0;i-=(i&(-i)))
        aux+=aib0[i];
    return aux;
}
void upd0(int poz, int newv)
{
    for(int i=poz;i<=n;i+=(i&(-i)))
        aib0[i]+=newv;
}

int h[200005];
vector<int> con[200005];
int parent[200005];
int tole[200005][45];
int tori[200005][45];
int cntd[200005];
int cntd2[200005];
int depth[200005];
int pos[200005];
int care[200005];
void dfs(int nod)
{
    cntd[depth[nod]]++;
    for(auto adj:con[nod])
    {
        if(adj!=parent[nod])
        {
            depth[adj]=depth[nod]+1;
            parent[adj]=nod;
            dfs(adj);
        }
    }
}
void dfs2(int nod)
{
    cntd2[depth[nod]]++;
    pos[nod] = cntd[depth[nod]-1] + cntd2[depth[nod]];
    care[pos[nod]]=nod;
    //cout<<nod<<" "<<pos[nod]<<" pos\n";
    for(int d=0;d<=42;d++)
    {
        tole[nod][d] = n+5;
        tori[nod][d] = -1;
    }
    tole[nod][0] = tori[nod][0] = pos[nod];
    for(auto adj:con[nod])
    {
        if(adj!=parent[nod])
        {
            dfs2(adj);
            for(int d=1;d<=42;d++)
            {
                tole[nod][d] = min(tole[nod][d], tole[adj][d-1]);
                tori[nod][d] = max(tori[nod][d], tori[adj][d-1]);
            }
        }
    }
}
void faupd(int le, int ri, int newv)
{
    if(le>ri)
        return;
    if(newv!=0)
    {
        if(ri-le+1 <= 15)
        {
            for(int i=le;i<=ri;i++)
                h[care[i]] = (h[care[i]]*newv)%MOD;
        }
        else
            upd(1,1,n,le,ri,newv);
    }
    else
    {
        upd0(le,1);
        upd0(ri+1,-1);
    }
}
int calc_phi(int x)
{
    int d=2,prod=x;
    while(d*d<=x)
    {
        if(x%d==0)
        {
            while(x%d==0)
                x/=d;
            prod = prod / d * (d-1);
        }
        if(d==2)
            d--;
        d+=2;
    }
    if(x>1)
        prod = prod / x * (x-1);
    return prod;
}
int getrez(int poz)
{
    if(qry0(poz)>0)
        return 0;
    else
        return qry(1,1,n,poz);
}
int le[200005],ri[200005];
signed main()
{
    ios_base::sync_with_stdio(0);cin.tie(0);
    cin>>n>>MOD;
    phi = calc_phi(MOD);
    int a,b;
    for(int i=1;i<n;i++)
    {
        cin>>a>>b;
        con[a].push_back(b);
        con[b].push_back(a);
    }
    depth[1]=1;
    dfs(1);
    for(int i=2;i<=n;i++)
        cntd[i]+=cntd[i-1];
    dfs2(1);
    for(int i=1;i<=n;i++)
    {
        cin>>h[i];
    }
    build(1,1,n);
    int cntq,tip,d;
    cin>>cntq;
    for(int pas=1;pas<=cntq;pas++)
    {
        cin>>tip;
        if(tip==1)
        {
            cin>>a>>d>>b;
            for(int i=max((int)1,depth[a]-d);i<=min(n,depth[a]+d);i++)
            {
                le[i]=n+5;
                ri[i]=-1;
            }
            int cur=a;
            for(int i=0;i<=d;i++)
            {
                if(cur==0)
                    break;
                ///j > -1 + d - (i+1)


                int lim=0;
                if(parent[cur]!=0)
                    lim=max(lim, d - i - 1);
                for(int j=lim;j<=d-i;j++)
                {
                    if(depth[cur]+j>n)
                        break;
                    le[depth[cur]+j] = min(le[depth[cur]+j], tole[cur][j]);
                    ri[depth[cur]+j] = max(ri[depth[cur]+j], tori[cur][j]);
                }
                cur = parent[cur];
            }
            for(int i=max((int)1,depth[a]-d);i<=min(n,depth[a]+d);i++)
            {
                faupd(le[i],ri[i],b);
            }
        }
        else
        {
            cin>>a;
            cout<<(h[a]*getrez(pos[a]))%MOD<<"\n";
            //cout<<h[a]<<" "<<qry_brut(pos[a])<<" zzz\n";
        }
    }
    return 0;
}

Subtask #1
3.0 / 3.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 20824 KB Output is correct
2 Correct 3 ms 20828 KB Output is correct
3 Correct 3 ms 22876 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 4 ms 20828 KB Output is correct
6 Correct 4 ms 20828 KB Output is correct
7 Correct 4 ms 20828 KB Output is correct
8 Correct 4 ms 20828 KB Output is correct
9 Correct 4 ms 20828 KB Output is correct
10 Correct 3 ms 20828 KB Output is correct
11 Correct 3 ms 20828 KB Output is correct
12 Correct 3 ms 20828 KB Output is correct
13 Correct 3 ms 20828 KB Output is correct
14 Correct 3 ms 20828 KB Output is correct
15 Correct 3 ms 20828 KB Output is correct
16 Correct 4 ms 20828 KB Output is correct
17 Correct 3 ms 20824 KB Output is correct
18 Correct 3 ms 20824 KB Output is correct
19 Correct 3 ms 20828 KB Output is correct
20 Correct 3 ms 20828 KB Output is correct
21 Correct 3 ms 20828 KB Output is correct
22 Correct 4 ms 22876 KB Output is correct
23 Correct 3 ms 22876 KB Output is correct
24 Correct 3 ms 20824 KB Output is correct
25 Correct 3 ms 20828 KB Output is correct
26 Correct 3 ms 20828 KB Output is correct
27 Correct 4 ms 20828 KB Output is correct
28 Correct 6 ms 20828 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 20828 KB Output is correct
2 Correct 433 ms 177552 KB Output is correct
3 Correct 410 ms 174448 KB Output is correct
4 Correct 450 ms 185116 KB Output is correct
5 Correct 427 ms 176012 KB Output is correct
6 Correct 411 ms 176244 KB Output is correct
7 Correct 414 ms 176112 KB Output is correct
8 Correct 414 ms 176268 KB Output is correct
9 Correct 428 ms 191824 KB Output is correct
10 Correct 466 ms 187412 KB Output is correct
11 Correct 417 ms 177680 KB Output is correct
12 Correct 410 ms 174420 KB Output is correct
13 Correct 370 ms 174732 KB Output is correct
14 Correct 362 ms 174608 KB Output is correct
15 Correct 345 ms 174580 KB Output is correct
16 Correct 378 ms 174420 KB Output is correct
17 Correct 380 ms 175148 KB Output is correct
18 Correct 3 ms 20828 KB Output is correct
19 Correct 4 ms 20828 KB Output is correct
20 Correct 4 ms 21080 KB Output is correct
21 Correct 3 ms 20828 KB Output is correct
22 Correct 3 ms 20828 KB Output is correct

Subtask #3
29.0 / 29.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 20828 KB Output is correct
2 Correct 433 ms 177552 KB Output is correct
3 Correct 410 ms 174448 KB Output is correct
4 Correct 450 ms 185116 KB Output is correct
5 Correct 427 ms 176012 KB Output is correct
6 Correct 411 ms 176244 KB Output is correct
7 Correct 414 ms 176112 KB Output is correct
8 Correct 414 ms 176268 KB Output is correct
9 Correct 428 ms 191824 KB Output is correct
10 Correct 466 ms 187412 KB Output is correct
11 Correct 417 ms 177680 KB Output is correct
12 Correct 410 ms 174420 KB Output is correct
13 Correct 370 ms 174732 KB Output is correct
14 Correct 362 ms 174608 KB Output is correct
15 Correct 345 ms 174580 KB Output is correct
16 Correct 378 ms 174420 KB Output is correct
17 Correct 380 ms 175148 KB Output is correct
18 Correct 3 ms 20828 KB Output is correct
19 Correct 4 ms 20828 KB Output is correct
20 Correct 4 ms 21080 KB Output is correct
21 Correct 3 ms 20828 KB Output is correct
22 Correct 3 ms 20828 KB Output is correct
23 Correct 3 ms 22872 KB Output is correct
24 Correct 448 ms 177588 KB Output is correct
25 Correct 434 ms 174324 KB Output is correct
26 Correct 506 ms 189524 KB Output is correct
27 Correct 498 ms 175880 KB Output is correct
28 Correct 452 ms 176232 KB Output is correct
29 Correct 504 ms 176040 KB Output is correct
30 Correct 431 ms 176268 KB Output is correct
31 Correct 514 ms 187216 KB Output is correct
32 Correct 514 ms 187396 KB Output is correct
33 Correct 400 ms 177488 KB Output is correct
34 Correct 467 ms 174416 KB Output is correct
35 Correct 3 ms 20828 KB Output is correct
36 Correct 3 ms 20828 KB Output is correct
37 Correct 3 ms 20828 KB Output is correct
38 Correct 3 ms 20828 KB Output is correct
39 Correct 3 ms 20828 KB Output is correct
40 Correct 3 ms 20828 KB Output is correct
41 Correct 3 ms 20828 KB Output is correct
42 Correct 3 ms 20824 KB Output is correct
43 Correct 3 ms 22872 KB Output is correct
44 Correct 4 ms 22876 KB Output is correct
45 Correct 4 ms 20828 KB Output is correct
46 Correct 4 ms 20824 KB Output is correct
47 Correct 3 ms 20832 KB Output is correct
48 Correct 3 ms 20828 KB Output is correct
49 Correct 4 ms 20992 KB Output is correct

Subtask #4
12.0 / 12.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 22876 KB Output is correct
2 Correct 547 ms 188900 KB Output is correct
3 Correct 1901 ms 184924 KB Output is correct
4 Correct 856 ms 185828 KB Output is correct
5 Correct 766 ms 174404 KB Output is correct
6 Correct 638 ms 174672 KB Output is correct
7 Correct 555 ms 174580 KB Output is correct
8 Correct 342 ms 174772 KB Output is correct
9 Correct 551 ms 184556 KB Output is correct
10 Correct 1827 ms 187128 KB Output is correct
11 Correct 528 ms 174660 KB Output is correct
12 Correct 1861 ms 174132 KB Output is correct
13 Correct 1199 ms 175444 KB Output is correct
14 Correct 1199 ms 176024 KB Output is correct
15 Correct 3 ms 21080 KB Output is correct
16 Correct 4 ms 20828 KB Output is correct
17 Correct 4 ms 20828 KB Output is correct
18 Correct 4 ms 22876 KB Output is correct
19 Correct 4 ms 22876 KB Output is correct

Subtask #5
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 20824 KB Output is correct
2 Correct 689 ms 186604 KB Output is correct
3 Correct 1603 ms 181472 KB Output is correct
4 Correct 842 ms 184452 KB Output is correct
5 Correct 1056 ms 176048 KB Output is correct
6 Correct 1038 ms 175912 KB Output is correct
7 Correct 890 ms 176212 KB Output is correct
8 Correct 388 ms 176248 KB Output is correct
9 Correct 624 ms 190660 KB Output is correct
10 Correct 1594 ms 187660 KB Output is correct
11 Correct 712 ms 177492 KB Output is correct
12 Correct 2901 ms 176356 KB Output is correct
13 Execution timed out 4014 ms 183584 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 20824 KB Output is correct
2 Correct 3 ms 20828 KB Output is correct
3 Correct 3 ms 22876 KB Output is correct
4 Correct 4 ms 21084 KB Output is correct
5 Correct 4 ms 20828 KB Output is correct
6 Correct 4 ms 20828 KB Output is correct
7 Correct 4 ms 20828 KB Output is correct
8 Correct 4 ms 20828 KB Output is correct
9 Correct 4 ms 20828 KB Output is correct
10 Correct 3 ms 20828 KB Output is correct
11 Correct 3 ms 20828 KB Output is correct
12 Correct 3 ms 20828 KB Output is correct
13 Correct 3 ms 20828 KB Output is correct
14 Correct 3 ms 20828 KB Output is correct
15 Correct 3 ms 20828 KB Output is correct
16 Correct 4 ms 20828 KB Output is correct
17 Correct 3 ms 20824 KB Output is correct
18 Correct 3 ms 20824 KB Output is correct
19 Correct 3 ms 20828 KB Output is correct
20 Correct 3 ms 20828 KB Output is correct
21 Correct 3 ms 20828 KB Output is correct
22 Correct 4 ms 22876 KB Output is correct
23 Correct 3 ms 22876 KB Output is correct
24 Correct 3 ms 20824 KB Output is correct
25 Correct 3 ms 20828 KB Output is correct
26 Correct 3 ms 20828 KB Output is correct
27 Correct 4 ms 20828 KB Output is correct
28 Correct 6 ms 20828 KB Output is correct
29 Correct 3 ms 20828 KB Output is correct
30 Correct 433 ms 177552 KB Output is correct
31 Correct 410 ms 174448 KB Output is correct
32 Correct 450 ms 185116 KB Output is correct
33 Correct 427 ms 176012 KB Output is correct
34 Correct 411 ms 176244 KB Output is correct
35 Correct 414 ms 176112 KB Output is correct
36 Correct 414 ms 176268 KB Output is correct
37 Correct 428 ms 191824 KB Output is correct
38 Correct 466 ms 187412 KB Output is correct
39 Correct 417 ms 177680 KB Output is correct
40 Correct 410 ms 174420 KB Output is correct
41 Correct 370 ms 174732 KB Output is correct
42 Correct 362 ms 174608 KB Output is correct
43 Correct 345 ms 174580 KB Output is correct
44 Correct 378 ms 174420 KB Output is correct
45 Correct 380 ms 175148 KB Output is correct
46 Correct 3 ms 20828 KB Output is correct
47 Correct 4 ms 20828 KB Output is correct
48 Correct 4 ms 21080 KB Output is correct
49 Correct 3 ms 20828 KB Output is correct
50 Correct 3 ms 20828 KB Output is correct
51 Correct 3 ms 22872 KB Output is correct
52 Correct 448 ms 177588 KB Output is correct
53 Correct 434 ms 174324 KB Output is correct
54 Correct 506 ms 189524 KB Output is correct
55 Correct 498 ms 175880 KB Output is correct
56 Correct 452 ms 176232 KB Output is correct
57 Correct 504 ms 176040 KB Output is correct
58 Correct 431 ms 176268 KB Output is correct
59 Correct 514 ms 187216 KB Output is correct
60 Correct 514 ms 187396 KB Output is correct
61 Correct 400 ms 177488 KB Output is correct
62 Correct 467 ms 174416 KB Output is correct
63 Correct 3 ms 20828 KB Output is correct
64 Correct 3 ms 20828 KB Output is correct
65 Correct 3 ms 20828 KB Output is correct
66 Correct 3 ms 20828 KB Output is correct
67 Correct 3 ms 20828 KB Output is correct
68 Correct 3 ms 20828 KB Output is correct
69 Correct 3 ms 20828 KB Output is correct
70 Correct 3 ms 20824 KB Output is correct
71 Correct 3 ms 22872 KB Output is correct
72 Correct 4 ms 22876 KB Output is correct
73 Correct 4 ms 20828 KB Output is correct
74 Correct 4 ms 20824 KB Output is correct
75 Correct 3 ms 20832 KB Output is correct
76 Correct 3 ms 20828 KB Output is correct
77 Correct 4 ms 20992 KB Output is correct
78 Correct 3 ms 22876 KB Output is correct
79 Correct 547 ms 188900 KB Output is correct
80 Correct 1901 ms 184924 KB Output is correct
81 Correct 856 ms 185828 KB Output is correct
82 Correct 766 ms 174404 KB Output is correct
83 Correct 638 ms 174672 KB Output is correct
84 Correct 555 ms 174580 KB Output is correct
85 Correct 342 ms 174772 KB Output is correct
86 Correct 551 ms 184556 KB Output is correct
87 Correct 1827 ms 187128 KB Output is correct
88 Correct 528 ms 174660 KB Output is correct
89 Correct 1861 ms 174132 KB Output is correct
90 Correct 1199 ms 175444 KB Output is correct
91 Correct 1199 ms 176024 KB Output is correct
92 Correct 3 ms 21080 KB Output is correct
93 Correct 4 ms 20828 KB Output is correct
94 Correct 4 ms 20828 KB Output is correct
95 Correct 4 ms 22876 KB Output is correct
96 Correct 4 ms 22876 KB Output is correct
97 Correct 3 ms 20824 KB Output is correct
98 Correct 689 ms 186604 KB Output is correct
99 Correct 1603 ms 181472 KB Output is correct
100 Correct 842 ms 184452 KB Output is correct
101 Correct 1056 ms 176048 KB Output is correct
102 Correct 1038 ms 175912 KB Output is correct
103 Correct 890 ms 176212 KB Output is correct
104 Correct 388 ms 176248 KB Output is correct
105 Correct 624 ms 190660 KB Output is correct
106 Correct 1594 ms 187660 KB Output is correct
107 Correct 712 ms 177492 KB Output is correct
108 Correct 2901 ms 176356 KB Output is correct
109 Execution timed out 4014 ms 183584 KB Time limit exceeded
110 Halted 0 ms 0 KB -