oj.uz

답안 #964914

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
964914 2024-04-17T17:20:48 Z PieArmy Regions (IOI09_regions) C++17
95 / 100
 2103 ms 131072 KB 
typedef long long ll;;
#include <bits/stdc++.h>
#define pb push_back
using namespace std;

int n,sq,R,Q;
int say[25001],renk[200001],fazlapos[25001],bas[200001],son[200001];
ll pre[25001][450],pre2[450][25001];
vector<int>child[200001],var[25001],sirali[25001];

ll cal(int a,int b){
    if(say[b]==0||say[a]==0){
        return 0;
    }
    if(say[b]>sq){
        return pre[a][fazlapos[b]];
    }
    if(say[a]>sq){
        return pre2[fazlapos[a]][b];
    }
    int sta[say[a]];
    ll tavan=-1;
    int apos=0;
    ll ans=0;
    for(int i=0;i<say[b];i++){
        while(tavan!=-1&&son[sta[tavan]]<bas[var[b][i]]){
            tavan--;
        }
        while(apos<say[a]&&bas[sirali[a][apos]]<=bas[var[b][i]]){
            if(son[sirali[a][apos]]>=bas[var[b][i]]){
                tavan++;
                sta[tavan]=sirali[a][apos];
            }
            apos++;
        }
        ans+=tavan+1;
    }
    return ans;
}

int main(){
    cin>>n>>R>>Q;
    sq=sqrt(n);
    cin>>renk[1];
    int time=0;
    say[renk[1]]++;
    for(int &x:fazlapos)
        x=-1;
    for(int i=2;i<=n;i++){
        int par;cin>>par;
        child[par].pb(i);
        cin>>renk[i];
        if(say[renk[i]]==sq){
            fazlapos[renk[i]]=time;
            time++;
        }
        say[renk[i]]++;
    }
    function<ll(int,int)>f=[&](int pos,int tur)->ll{
        ll res=0;
        for(int x:child[pos]){
            res+=f(x,tur);
        }
        if(renk[pos]==tur)return res+1;
        pre[renk[pos]][fazlapos[tur]]+=res;
        return res;
    };
    function<void(int,int,ll)>f2=[&](int pos,int tur,ll sum)->void{
        if(renk[pos]!=tur)pre2[fazlapos[tur]][renk[pos]]+=sum;
        else sum++;
        for(int x:child[pos]){
            f2(x,tur,sum);
        }
    };
    for(int i=1;i<=R;i++){
        if(fazlapos[i]==-1)continue;
        f(1,i);
        f2(1,i,0);
    }
    time=1;
    function<void(int)>turla=[&](int pos)->void{
        if(say[renk[pos]]<=sq){
            bas[pos]=time;
            var[renk[pos]].pb(pos);
            sirali[renk[pos]].pb(pos);
        }
        time++;
        for(int x:child[pos]){
            turla(x);
        }
        son[pos]=time-1;
    };
    turla(1);
    for(int i=1;i<=R;i++){
        if(say[i]>sq)continue;
        sort(sirali[i].begin(),sirali[i].end(),[&](const int &x,const int &y){
            if(bas[x]==bas[y]){
                return son[x]<son[y];
            }
            return bas[x]<bas[y];
        });
    }
    while(Q--){
        int a,b;cin>>a>>b;
        cout<<cal(a,b)<<endl;
    }
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 8792 KB Output is correct
3 Correct 3 ms 8884 KB Output is correct
4 Correct 4 ms 8792 KB Output is correct
5 Correct 5 ms 8792 KB Output is correct
6 Correct 13 ms 8792 KB Output is correct
7 Correct 23 ms 8792 KB Output is correct
8 Correct 30 ms 8792 KB Output is correct
9 Correct 31 ms 9304 KB Output is correct
10 Correct 46 ms 9304 KB Output is correct
11 Correct 69 ms 9560 KB Output is correct
12 Correct 94 ms 10024 KB Output is correct
13 Correct 108 ms 9796 KB Output is correct
14 Correct 135 ms 14468 KB Output is correct
15 Correct 182 ms 18740 KB Output is correct

Subtask #2
80.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Correct 741 ms 21536 KB Output is correct
2 Correct 789 ms 17872 KB Output is correct
3 Correct 1269 ms 22232 KB Output is correct
4 Correct 177 ms 10672 KB Output is correct
5 Correct 251 ms 12248 KB Output is correct
6 Correct 544 ms 50452 KB Output is correct
7 Correct 753 ms 59680 KB Output is correct
8 Correct 976 ms 77820 KB Output is correct
9 Correct 1325 ms 18052 KB Output is correct
10 Runtime error 861 ms 131072 KB Execution killed with signal 9
11 Correct 2103 ms 17344 KB Output is correct
12 Correct 889 ms 78352 KB Output is correct
13 Correct 1115 ms 79128 KB Output is correct
14 Correct 1663 ms 96352 KB Output is correct
15 Correct 1813 ms 114188 KB Output is correct
16 Correct 1808 ms 125312 KB Output is correct
17 Correct 1875 ms 112308 KB Output is correct