oj.uz

Submission #1019484

# Submission time Handle Problem Language Result Execution time Memory
1019484 2024-07-10T23:56:15 Z vjudge1 Regions (IOI09_regions) C++17
75 / 100
 8000 ms 131072 KB 
#include<bits/stdc++.h>
using namespace std;
#define N 200100
#define SZ 410
int CC,in[N],out[N],id[N],prc[SZ][SZ],hv[SZ],CC2,reg[N],ANS,T[N];
vector<int>hav[N],adj[N];
map<int,int> sup[SZ],sub[SZ];
void upd(map<int,int>&mp,int x,int v){
    while(x<N) mp[x]+=v,x+=x&-x;
}
void query(map<int,int>&mp,int x,int v){
    while(x) ANS+=mp[x]*v,x-=x&-x;
}
void upd2(int x,int v){
    while(x<N) T[x]+=v,x+=x&-x;
}
void query2(int x,int v){
    while(x) ANS+=T[x]*v,x-=x&-x;
}
void dfs(int n){
    if(id[reg[n]])for(int i=1;i<SZ;i++)
        prc[i][id[reg[n]]]+=hv[i];
    hv[id[reg[n]]]++; in[n]=++CC;
    for(auto i:adj[n])dfs(i);
    hv[id[reg[n]]]--; out[n]=CC;
    if(id[reg[n]])
        upd(sup[id[reg[n]]],in[n],1),
        upd(sup[id[reg[n]]],out[n]+1,-1),
        upd(sub[id[reg[n]]],in[n],1);
}
int main(){
    cin.tie(0)->sync_with_stdio(0);
    int n,q,r;
    cin>>n>>r>>q;
    cin>>reg[1];
    for(int i=2;i<=n;i++){
        int p;cin>>p>>reg[i];
        adj[p].push_back(i);
    }
    for(int i=1;i<=n;i++)
        hav[reg[i]].push_back(i);
    for(int i=1;i<=r;i++)
        if(hav[i].size()>=500)
            id[i]=++CC2;
    dfs(1);
    while(q--){
        int a,b;
        cin>>a>>b;
        ANS=0;
        if(id[a]&&id[b])
            ANS=prc[id[a]][id[b]];
        else if(id[a]||id[b])
            if(hav[a].size()>hav[b].size())
                for(auto i:hav[b])
                    query(sup[id[a]],in[i],1);
            else for(auto i:hav[a])
                query(sub[id[b]],in[i]-1,-1),
                query(sub[id[b]],out[i],1);
        else {
            for(auto i:hav[a])
                upd2(in[i],1),
                upd2(out[i]+1,-1);
            for(auto i:hav[b])
                query2(in[i],1);
            for(auto i:hav[a])
                upd2(in[i],-1),
                upd2(out[i]+1,1);
        }
        cout<<ANS<<endl;
    }
}

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 10840 KB Output is correct
2 Correct 2 ms 10840 KB Output is correct
3 Correct 3 ms 10840 KB Output is correct
4 Correct 5 ms 10840 KB Output is correct
5 Correct 6 ms 10840 KB Output is correct
6 Correct 11 ms 10840 KB Output is correct
7 Correct 19 ms 10840 KB Output is correct
8 Correct 25 ms 10840 KB Output is correct
9 Correct 35 ms 11352 KB Output is correct
10 Correct 66 ms 11352 KB Output is correct
11 Correct 119 ms 11608 KB Output is correct
12 Correct 129 ms 11864 KB Output is correct
13 Correct 190 ms 11608 KB Output is correct
14 Correct 309 ms 12188 KB Output is correct
15 Correct 409 ms 15192 KB Output is correct

Subtask #2
60.0 / 85.0

# Verdict Execution time Memory Grader output
1 Execution timed out 8070 ms 72528 KB Time limit exceeded
2 Execution timed out 8082 ms 80464 KB Time limit exceeded
3 Execution timed out 8061 ms 55036 KB Time limit exceeded
4 Correct 327 ms 12120 KB Output is correct
5 Correct 328 ms 14168 KB Output is correct
6 Correct 3028 ms 22192 KB Output is correct
7 Correct 2217 ms 16116 KB Output is correct
8 Correct 2466 ms 28988 KB Output is correct
9 Correct 3322 ms 20720 KB Output is correct
10 Correct 6071 ms 26448 KB Output is correct
11 Correct 5451 ms 19892 KB Output is correct
12 Correct 2888 ms 52060 KB Output is correct
13 Correct 3582 ms 53392 KB Output is correct
14 Runtime error 2618 ms 131072 KB Execution killed with signal 9
15 Correct 5759 ms 59648 KB Output is correct
16 Correct 5653 ms 69040 KB Output is correct
17 Runtime error 2973 ms 131072 KB Execution killed with signal 9