oj.uz

답안 #925136

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
925136 2024-02-10T20:13:32 Z alexdd Sprinkler (JOI22_sprinkler) C++17
41 / 100
 4000 ms 195732 KB 
#include<bits/stdc++.h>
#pragma GCC optimize("O3,unroll-loops")
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];
int lazy[800005];
void build(int nod, int st, int dr)
{
    aint[nod]=1;
    lazy[nod]=1;
    if(st==dr)
        return;
    int mij=(st+dr)/2;
    build(nod*2,st,mij);
    build(nod*2+1,mij+1,dr);
}
void propagate(int nod)
{
    lazy[nod*2]=lazy[nod*2]*lazy[nod]%MOD;
    lazy[nod*2+1]=lazy[nod*2+1]*lazy[nod]%MOD;
    aint[nod*2]=aint[nod*2]*lazy[nod]%MOD;
    aint[nod*2+1]=aint[nod*2+1]*lazy[nod]%MOD;
    lazy[nod]=1;
}
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;
        lazy[nod]=lazy[nod]*newv%MOD;
        return;
    }
    propagate(nod);
    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);
    aint[nod]=aint[nod*2]*aint[nod*2+1]%MOD;
}
int qry(int nod, int st, int dr, int poz)
{
    if(st==dr)
        return aint[nod];
    propagate(nod);
    int mij=(st+dr)/2;
    if(poz<=mij) return qry(nod*2,st,mij,poz);
    else return qry(nod*2+1,mij+1,dr,poz);
}

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];
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]];
    //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, int inv)
{
    if(le>ri)
        return;
    if(newv!=0)
    {
        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;
                for(int j=0;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];
            }
            int inv=put(b,phi-1);
            for(int i=max((int)1,depth[a]-d);i<=min(n,depth[a]+d);i++)
            {
                faupd(le[i],ri[i],b,inv);
            }
        }
        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

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 24920 KB Output is correct
2 Correct 4 ms 24924 KB Output is correct
3 Correct 3 ms 24924 KB Output is correct
4 Correct 10 ms 24920 KB Output is correct
5 Correct 10 ms 25116 KB Output is correct
6 Correct 7 ms 24924 KB Output is correct
7 Correct 7 ms 24924 KB Output is correct
8 Correct 5 ms 24924 KB Output is correct
9 Correct 4 ms 24920 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 4 ms 24924 KB Output is correct
12 Correct 4 ms 24920 KB Output is correct
13 Correct 4 ms 24924 KB Output is correct
14 Correct 4 ms 24924 KB Output is correct
15 Correct 4 ms 24920 KB Output is correct
16 Correct 4 ms 25180 KB Output is correct
17 Correct 4 ms 24920 KB Output is correct
18 Correct 4 ms 24924 KB Output is correct
19 Correct 4 ms 24924 KB Output is correct
20 Correct 3 ms 24924 KB Output is correct
21 Correct 4 ms 24924 KB Output is correct
22 Correct 4 ms 24924 KB Output is correct
23 Correct 4 ms 24920 KB Output is correct
24 Correct 4 ms 24924 KB Output is correct
25 Correct 4 ms 24924 KB Output is correct
26 Correct 4 ms 24924 KB Output is correct
27 Correct 4 ms 24924 KB Output is correct
28 Correct 4 ms 24924 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24920 KB Output is correct
2 Correct 476 ms 181580 KB Output is correct
3 Correct 1014 ms 178512 KB Output is correct
4 Correct 720 ms 189304 KB Output is correct
5 Correct 665 ms 179912 KB Output is correct
6 Correct 620 ms 179928 KB Output is correct
7 Correct 672 ms 180244 KB Output is correct
8 Correct 574 ms 180512 KB Output is correct
9 Correct 550 ms 195732 KB Output is correct
10 Correct 1054 ms 191508 KB Output is correct
11 Correct 504 ms 181572 KB Output is correct
12 Correct 982 ms 178528 KB Output is correct
13 Correct 1169 ms 178836 KB Output is correct
14 Correct 1200 ms 178992 KB Output is correct
15 Correct 1049 ms 178612 KB Output is correct
16 Correct 1042 ms 178844 KB Output is correct
17 Correct 1087 ms 179624 KB Output is correct
18 Correct 4 ms 24920 KB Output is correct
19 Correct 4 ms 24924 KB Output is correct
20 Correct 4 ms 24924 KB Output is correct
21 Correct 5 ms 24924 KB Output is correct
22 Correct 4 ms 24924 KB Output is correct

Subtask #3
29.0 / 29.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24920 KB Output is correct
2 Correct 476 ms 181580 KB Output is correct
3 Correct 1014 ms 178512 KB Output is correct
4 Correct 720 ms 189304 KB Output is correct
5 Correct 665 ms 179912 KB Output is correct
6 Correct 620 ms 179928 KB Output is correct
7 Correct 672 ms 180244 KB Output is correct
8 Correct 574 ms 180512 KB Output is correct
9 Correct 550 ms 195732 KB Output is correct
10 Correct 1054 ms 191508 KB Output is correct
11 Correct 504 ms 181572 KB Output is correct
12 Correct 982 ms 178528 KB Output is correct
13 Correct 1169 ms 178836 KB Output is correct
14 Correct 1200 ms 178992 KB Output is correct
15 Correct 1049 ms 178612 KB Output is correct
16 Correct 1042 ms 178844 KB Output is correct
17 Correct 1087 ms 179624 KB Output is correct
18 Correct 4 ms 24920 KB Output is correct
19 Correct 4 ms 24924 KB Output is correct
20 Correct 4 ms 24924 KB Output is correct
21 Correct 5 ms 24924 KB Output is correct
22 Correct 4 ms 24924 KB Output is correct
23 Correct 3 ms 24924 KB Output is correct
24 Correct 548 ms 181856 KB Output is correct
25 Correct 1239 ms 178560 KB Output is correct
26 Correct 862 ms 193692 KB Output is correct
27 Correct 761 ms 180288 KB Output is correct
28 Correct 759 ms 180300 KB Output is correct
29 Correct 742 ms 180268 KB Output is correct
30 Correct 716 ms 180924 KB Output is correct
31 Correct 613 ms 191508 KB Output is correct
32 Correct 1494 ms 191884 KB Output is correct
33 Correct 565 ms 181580 KB Output is correct
34 Correct 1354 ms 178940 KB Output is correct
35 Correct 4 ms 24920 KB Output is correct
36 Correct 4 ms 24924 KB Output is correct
37 Correct 4 ms 24924 KB Output is correct
38 Correct 5 ms 24924 KB Output is correct
39 Correct 4 ms 24924 KB Output is correct
40 Correct 4 ms 24924 KB Output is correct
41 Correct 4 ms 24924 KB Output is correct
42 Correct 4 ms 24924 KB Output is correct
43 Correct 4 ms 24924 KB Output is correct
44 Correct 4 ms 24924 KB Output is correct
45 Correct 4 ms 25076 KB Output is correct
46 Correct 4 ms 24924 KB Output is correct
47 Correct 4 ms 24924 KB Output is correct
48 Correct 4 ms 24924 KB Output is correct
49 Correct 4 ms 24924 KB Output is correct

Subtask #4
0 / 12.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24920 KB Output is correct
2 Correct 869 ms 193308 KB Output is correct
3 Execution timed out 4006 ms 188936 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #5
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 24924 KB Output is correct
2 Correct 2591 ms 190844 KB Output is correct
3 Execution timed out 4046 ms 184916 KB Time limit exceeded
4 Halted 0 ms 0 KB -

Subtask #6
0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 24920 KB Output is correct
2 Correct 4 ms 24924 KB Output is correct
3 Correct 3 ms 24924 KB Output is correct
4 Correct 10 ms 24920 KB Output is correct
5 Correct 10 ms 25116 KB Output is correct
6 Correct 7 ms 24924 KB Output is correct
7 Correct 7 ms 24924 KB Output is correct
8 Correct 5 ms 24924 KB Output is correct
9 Correct 4 ms 24920 KB Output is correct
10 Correct 4 ms 24924 KB Output is correct
11 Correct 4 ms 24924 KB Output is correct
12 Correct 4 ms 24920 KB Output is correct
13 Correct 4 ms 24924 KB Output is correct
14 Correct 4 ms 24924 KB Output is correct
15 Correct 4 ms 24920 KB Output is correct
16 Correct 4 ms 25180 KB Output is correct
17 Correct 4 ms 24920 KB Output is correct
18 Correct 4 ms 24924 KB Output is correct
19 Correct 4 ms 24924 KB Output is correct
20 Correct 3 ms 24924 KB Output is correct
21 Correct 4 ms 24924 KB Output is correct
22 Correct 4 ms 24924 KB Output is correct
23 Correct 4 ms 24920 KB Output is correct
24 Correct 4 ms 24924 KB Output is correct
25 Correct 4 ms 24924 KB Output is correct
26 Correct 4 ms 24924 KB Output is correct
27 Correct 4 ms 24924 KB Output is correct
28 Correct 4 ms 24924 KB Output is correct
29 Correct 3 ms 24920 KB Output is correct
30 Correct 476 ms 181580 KB Output is correct
31 Correct 1014 ms 178512 KB Output is correct
32 Correct 720 ms 189304 KB Output is correct
33 Correct 665 ms 179912 KB Output is correct
34 Correct 620 ms 179928 KB Output is correct
35 Correct 672 ms 180244 KB Output is correct
36 Correct 574 ms 180512 KB Output is correct
37 Correct 550 ms 195732 KB Output is correct
38 Correct 1054 ms 191508 KB Output is correct
39 Correct 504 ms 181572 KB Output is correct
40 Correct 982 ms 178528 KB Output is correct
41 Correct 1169 ms 178836 KB Output is correct
42 Correct 1200 ms 178992 KB Output is correct
43 Correct 1049 ms 178612 KB Output is correct
44 Correct 1042 ms 178844 KB Output is correct
45 Correct 1087 ms 179624 KB Output is correct
46 Correct 4 ms 24920 KB Output is correct
47 Correct 4 ms 24924 KB Output is correct
48 Correct 4 ms 24924 KB Output is correct
49 Correct 5 ms 24924 KB Output is correct
50 Correct 4 ms 24924 KB Output is correct
51 Correct 3 ms 24924 KB Output is correct
52 Correct 548 ms 181856 KB Output is correct
53 Correct 1239 ms 178560 KB Output is correct
54 Correct 862 ms 193692 KB Output is correct
55 Correct 761 ms 180288 KB Output is correct
56 Correct 759 ms 180300 KB Output is correct
57 Correct 742 ms 180268 KB Output is correct
58 Correct 716 ms 180924 KB Output is correct
59 Correct 613 ms 191508 KB Output is correct
60 Correct 1494 ms 191884 KB Output is correct
61 Correct 565 ms 181580 KB Output is correct
62 Correct 1354 ms 178940 KB Output is correct
63 Correct 4 ms 24920 KB Output is correct
64 Correct 4 ms 24924 KB Output is correct
65 Correct 4 ms 24924 KB Output is correct
66 Correct 5 ms 24924 KB Output is correct
67 Correct 4 ms 24924 KB Output is correct
68 Correct 4 ms 24924 KB Output is correct
69 Correct 4 ms 24924 KB Output is correct
70 Correct 4 ms 24924 KB Output is correct
71 Correct 4 ms 24924 KB Output is correct
72 Correct 4 ms 24924 KB Output is correct
73 Correct 4 ms 25076 KB Output is correct
74 Correct 4 ms 24924 KB Output is correct
75 Correct 4 ms 24924 KB Output is correct
76 Correct 4 ms 24924 KB Output is correct
77 Correct 4 ms 24924 KB Output is correct
78 Correct 3 ms 24920 KB Output is correct
79 Correct 869 ms 193308 KB Output is correct
80 Execution timed out 4006 ms 188936 KB Time limit exceeded
81 Halted 0 ms 0 KB -