oj.uz

Submission #501146

# Submission time Handle Problem Language Result Execution time Memory
501146 2022-01-02T13:22:43 Z Joo Regions (IOI09_regions) C++17
30 / 100
 8000 ms 35648 KB 
#include <bits/stdc++.h>
using namespace std;

const int N = 2e5+10, MR = 25010, CASE = 500;

int n, R, Q, sz[N], cnt[MR], re[N], tin[N], tout[N], ti;
vector<int> G[N], ch[N], sml[MR];
vector<vector<int>> ans;
vector<pair<int, int>> lar[MR];

void dfs1(int u, int p){
    sz[u] = 1;
    tin[u] = ++ti;
    for(int v : G[u]){
        dfs1(v, u);
        sz[u] += sz[v];
    }
    tout[u] = ti;
}

void dfs2(int u, int p, bool keep){
    int bc = -1;
    for(int v : G[u]) if(bc == -1 or sz[v] > sz[bc]) bc = v;

    for(int v : G[u]) if(v != bc) dfs2(v, u, 0);
    if(bc != -1){
        dfs2(bc, u, 1);
        swap(ch[u], ch[bc]);
    }
    ch[u].emplace_back(u);
    cnt[re[u]]++;

    for(int v : G[u]){
        if(v == bc) continue;
        for(int vv : ch[v]){
            cnt[re[vv]]++;
            ch[u].emplace_back(vv);
        }
    }
    for(int i = 1; i <= R; i++) ans[re[u]][i] += cnt[i];

    if(keep == 0){
        for(int v : ch[u]) cnt[re[v]]--;
    }
}

void chk(stack<int> st){
    cout << "CHKST : ";
    while(!st.empty()){
        cout << st.top() << " ";
        st.pop();
    }
    cout << "\n";
}

int getans(int r1, int r2){
    if(R <= CASE) return ans[r1][r2];

    int res = 0;    
    stack<int> st;
    for(int i = 0, j = -1; i < sml[r2].size(); i++){
        while(!st.empty() and sml[r2][i] > st.top()) st.pop(); //pop
        while(j+1 < lar[r1].size() and lar[r1][j+1].second < sml[r2][i]) j++;

        while(j+1 < lar[r1].size() and sml[r2][i] > lar[r1][j+1].first){ //add
            st.push(lar[r1][j+1].second);
            j++;
        }
        while(!st.empty() and sml[r2][i] > st.top()) st.pop(); //pop

        // chk(st);

        res += st.size();
    }
    return res;
}

int main(void){
    cin >> n >> R >> Q;
    cin >> re[1];
    for(int i = 2; i <= n; i++){
        int p; cin >> p >> re[i];
        G[p].emplace_back(i);
    }

    dfs1(1, -1);
    if(R <= CASE){
        ans.resize(R+10, vector<int>(R+10));
        dfs2(1, -1, 1);
    }
    else {
        for(int i = 1; i <= n; i++){
            sml[re[i]].emplace_back(tin[i]);
            lar[re[i]].emplace_back(tin[i], tout[i]);
        }
        for(int i = 1; i <= R; i++){
            sort(sml[i].begin(), sml[i].end());
            sort(lar[i].begin(), lar[i].end());
        }

    }

    while(Q--){
        int r1, r2; cin >> r1 >> r2;
        cout << getans(r1, r2) << endl;
    }

    return 0;
}

Compilation message

regions.cpp: In function 'int getans(int, int)':
regions.cpp:61:30: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   61 |     for(int i = 0, j = -1; i < sml[r2].size(); i++){
      |                            ~~^~~~~~~~~~~~~~~~
regions.cpp:63:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   63 |         while(j+1 < lar[r1].size() and lar[r1][j+1].second < sml[r2][i]) j++;
      |               ~~~~^~~~~~~~~~~~~~~~
regions.cpp:65:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<int, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   65 |         while(j+1 < lar[r1].size() and sml[r2][i] > lar[r1][j+1].first){ //add
      |               ~~~~^~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# Verdict Execution time Memory Grader output
1 Correct 5 ms 10824 KB Output is correct
2 Correct 5 ms 10824 KB Output is correct
3 Correct 6 ms 10824 KB Output is correct
4 Correct 11 ms 10824 KB Output is correct
5 Correct 13 ms 10824 KB Output is correct
6 Correct 27 ms 11208 KB Output is correct
7 Correct 35 ms 11080 KB Output is correct
8 Correct 43 ms 11080 KB Output is correct
9 Correct 67 ms 12084 KB Output is correct
10 Correct 113 ms 12312 KB Output is correct
11 Correct 120 ms 12236 KB Output is correct
12 Correct 178 ms 13504 KB Output is correct
13 Correct 208 ms 13040 KB Output is correct
14 Correct 176 ms 13076 KB Output is correct
15 Correct 223 ms 17740 KB Output is correct

Subtask #2
15.0 / 85.0

# Verdict Execution time Memory Grader output
1 Correct 733 ms 17308 KB Output is correct
2 Correct 1006 ms 16832 KB Output is correct
3 Correct 1202 ms 20368 KB Output is correct
4 Incorrect 225 ms 12820 KB Output isn't correct
5 Incorrect 296 ms 14784 KB Output isn't correct
6 Incorrect 843 ms 14208 KB Output isn't correct
7 Incorrect 1108 ms 15580 KB Output isn't correct
8 Incorrect 931 ms 21620 KB Output isn't correct
9 Incorrect 1664 ms 22076 KB Output isn't correct
10 Incorrect 2348 ms 27880 KB Output isn't correct
11 Incorrect 2517 ms 21844 KB Output isn't correct
12 Incorrect 3557 ms 23224 KB Output isn't correct
13 Incorrect 4556 ms 23684 KB Output isn't correct
14 Incorrect 5624 ms 23480 KB Output isn't correct
15 Incorrect 7231 ms 28600 KB Output isn't correct
16 Execution timed out 8012 ms 35648 KB Time limit exceeded
17 Incorrect 7468 ms 34380 KB Output isn't correct