oj.uz

답안 #852557

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
852557 2023-09-22T05:30:50 Z abcvuitunggio Regions (IOI09_regions) C++17
75 / 100
 1063 ms 131072 KB 
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int sz=55;
int n,R,q,r1,r2,cnt[200001][sz+1],c[25001][sz+1],c2[25001][sz+1],r[200001],p[200001],tin[200001],tout[200001],t,C[25001],pos[25001];
vector <int> ke[200001],ve[25001],V;
void dfs(int u){
    tin[u]=++t;
    ve[r[u]].push_back(t);
    if (pos[r[u]]<=sz)
        cnt[u][pos[r[u]]]++;
    for (int v:ke[u]){
        for (int i=1;i<=sz;i++)
            cnt[v][i]+=cnt[u][i];
        dfs(v);
    }
    for (int i=1;i<=sz;i++)
        c[r[u]][i]+=cnt[u][i];
    tout[u]=++t;
    ve[r[u]].push_back(-t);
}
void dfs2(int u){
    if (pos[r[u]]<=sz)
        cnt[u][pos[r[u]]]++;
    for (int v:ke[u]){
        dfs2(v);
        for (int i=1;i<=sz;i++)
            cnt[u][i]+=cnt[v][i];
    }
    for (int i=1;i<=sz;i++)
        c2[r[u]][i]+=cnt[u][i];
}
int32_t main(){
    ios_base::sync_with_stdio(NULL);cin.tie(nullptr);
    cin >> n >> R >> q;
    for (int i=1;i<=n;i++){
        if (i>1){
            cin >> p[i];
            ke[p[i]].push_back(i);
        }
        cin >> r[i];
        C[r[i]]++;
    }
    for (int i=1;i<=R;i++)
        V.push_back(i);
    sort(V.begin(),V.end(),[](int i, int j){return C[i]>C[j];});
    for (int i=0;i<V.size();i++)
        pos[V[i]]=i+1;
    dfs(1);
    memset(cnt,0,sizeof(cnt));
    dfs2(1);
    while (q--){
        cin >> r1 >> r2;
        if (pos[r1]<=sz){
            cout << c[r2][pos[r1]] << endl;
            continue;
        }
        if (pos[r2]<=sz){
            cout << c2[r1][pos[r2]] << endl;
            continue;
        }
        int j=0,cnt=0,res=0;
        for (int i=0;i<ve[r2].size();i++){
            while (j<ve[r1].size()){
                if (abs(ve[r1][j])>abs(ve[r2][i]))
                    break;
                cnt+=(ve[r1][j]>0)-(ve[r1][j]<0);
                j++;
            }
            if (ve[r2][i]>0)
                res+=cnt;
        }
        cout << res << endl;
    }
}

Compilation message

regions.cpp: In function 'int32_t main()':
regions.cpp:47:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   47 |     for (int i=0;i<V.size();i++)
      |                  ~^~~~~~~~~
regions.cpp:63:23: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         for (int i=0;i<ve[r2].size();i++){
      |                      ~^~~~~~~~~~~~~~
regions.cpp:64:21: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   64 |             while (j<ve[r1].size()){
      |                    ~^~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 15 ms 103256 KB Output is correct
2 Correct 12 ms 103440 KB Output is correct
3 Correct 14 ms 103420 KB Output is correct
4 Correct 15 ms 103512 KB Output is correct
5 Correct 16 ms 103512 KB Output is correct
6 Correct 20 ms 102744 KB Output is correct
7 Correct 29 ms 103512 KB Output is correct
8 Correct 29 ms 102744 KB Output is correct
9 Correct 36 ms 103256 KB Output is correct
10 Correct 54 ms 103372 KB Output is correct
11 Correct 79 ms 103532 KB Output is correct
12 Correct 115 ms 104152 KB Output is correct
13 Correct 117 ms 103832 KB Output is correct
14 Correct 121 ms 104428 KB Output is correct
15 Correct 162 ms 108140 KB Output is correct

Subtask #2
60.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Correct 530 ms 108496 KB Output is correct
2 Correct 587 ms 107152 KB Output is correct
3 Correct 1002 ms 110012 KB Output is correct
4 Correct 155 ms 107320 KB Output is correct
5 Correct 214 ms 110804 KB Output is correct
6 Correct 330 ms 112508 KB Output is correct
7 Correct 477 ms 114888 KB Output is correct
8 Correct 572 ms 121380 KB Output is correct
9 Correct 985 ms 125112 KB Output is correct
10 Runtime error 111 ms 131072 KB Execution killed with signal 9
11 Runtime error 144 ms 131072 KB Execution killed with signal 9
12 Correct 750 ms 128320 KB Output is correct
13 Correct 899 ms 128908 KB Output is correct
14 Correct 1063 ms 129668 KB Output is correct
15 Runtime error 137 ms 131072 KB Execution killed with signal 9
16 Runtime error 79 ms 131072 KB Execution killed with signal 9
17 Runtime error 81 ms 131072 KB Execution killed with signal 9