oj.uz

답안 #490605

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
490605 2021-11-28T09:54:02 Z dooompy Regions (IOI09_regions) C++11
35 / 100
 3195 ms 131076 KB 
#include "bits/stdc++.h"

using namespace std;

using ll = long long;

const int BLOCK = 450;

int region[200005];
vector<int> adj[200005];
int tin[200005], tout[200005];
vector<int> sorted[25005];
int ind[25005];
vector<int> largeRegions;
vector<vector<int>> par(BLOCK, vector<int>(25005));
vector<vector<int>> child(BLOCK, vector<int>(25005));
int timer = 1;

void dfs(int i) {
    tin[i] = timer++;
    sorted[region[i]].push_back(i);

    for (auto a : adj[i]) {
        dfs(a);
    }

    tout[i] = timer - 1;
}

void genPar(int cur, int original, int cnt) {
    par[ind[original]][region[cur]] += cnt;
    cnt += (region[cur] == original);
    for (auto a : par[cur]) {
        genPar(a, original, cnt);
    }
}

int genChild(int cur, int original) {
    int current = (region[cur] == original);

    for (auto a : par[cur]) {
        current += genChild(a, original);
    }

    child[ind[original]][region[cur]] += current;
    return current;
}

bool isAnc(int a, int b) {
    return tin[a] <= tin[b] && tout[b] <= tout[a];
}

int getAns(int reg1, int reg2) {
    int l = 0, r = 0;
    int ans = 0;
    stack<int> st;

    while (l < sorted[reg1].size() || r < sorted[reg2].size()) {
        if ((l < sorted[reg1].size()) && (r == sorted[reg2].size() || tin[sorted[reg1][l]] < tin[sorted[reg2][r]])) {
            while (!st.empty() && !isAnc(st.top(), sorted[reg1][l])) {
                st.pop();
            }

            st.push(sorted[reg1][l]);
            l++;
        } else {
            while (!st.empty() && !isAnc(st.top(), sorted[reg2][r])) {
                st.pop();
            }

            ans += st.size();
            r++;
        }
    }

    return ans;
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
//    freopen("", "r", stdin);
//    freopen("", "w", stdout);
    int n, r, q; cin >> n >> r >> q;
    cin >> region[1];

    for (int i = 2; i <= n; i++) {
        int s; cin >> s >> region[i];
        adj[s].push_back(i);
    }

    dfs(1);

    int idx = 0;

    for (int i = 1; i <= r; i++) {
        if (sorted[i].size() > BLOCK) {
            largeRegions.push_back(i);
            ind[i] = idx++;
        }
    }

    for (auto a : largeRegions) {
        genPar(1, a, 0);
        genChild(1, a);
    }

    for (int i = 0; i < q; i++) {
        int a, b; cin >> a >> b;

        if (sorted[a].size() <= BLOCK && sorted[b].size() <= BLOCK) {
            cout << getAns(a, b) << endl;
            continue;
        }

        if (sorted[a].size() > BLOCK) {
            cout << par[ind[a]][b] << endl;
        } else {
            cout << child[ind[b]][a] << endl;
        }
    }
}

Compilation message

regions.cpp: In function 'int getAns(int, int)':
regions.cpp:58:14: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     while (l < sorted[reg1].size() || r < sorted[reg2].size()) {
      |            ~~^~~~~~~~~~~~~~~~~~~~~
regions.cpp:58:41: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   58 |     while (l < sorted[reg1].size() || r < sorted[reg2].size()) {
      |                                       ~~^~~~~~~~~~~~~~~~~~~~~
regions.cpp:59:16: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         if ((l < sorted[reg1].size()) && (r == sorted[reg2].size() || tin[sorted[reg1][l]] < tin[sorted[reg2][r]])) {
      |              ~~^~~~~~~~~~~~~~~~~~~~~
regions.cpp:59:45: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |         if ((l < sorted[reg1].size()) && (r == sorted[reg2].size() || tin[sorted[reg1][l]] < tin[sorted[reg2][r]])) {
      |                                           ~~^~~~~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 40 ms 93804 KB Output is correct
2 Correct 39 ms 93740 KB Output is correct
3 Correct 41 ms 93744 KB Output is correct
4 Correct 44 ms 93800 KB Output is correct
5 Correct 50 ms 93748 KB Output is correct
6 Correct 56 ms 93852 KB Output is correct
7 Correct 70 ms 93756 KB Output is correct
8 Correct 78 ms 93860 KB Output is correct
9 Correct 83 ms 94272 KB Output is correct
10 Correct 126 ms 94212 KB Output is correct
11 Correct 165 ms 94528 KB Output is correct
12 Correct 179 ms 94888 KB Output is correct
13 Correct 278 ms 94528 KB Output is correct
14 Correct 241 ms 95168 KB Output is correct
15 Correct 291 ms 97748 KB Output is correct

Subtask #2
20.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 95 ms 131076 KB Execution killed with signal 9
2 Runtime error 100 ms 131076 KB Execution killed with signal 9
3 Runtime error 82 ms 131076 KB Execution killed with signal 9
4 Correct 373 ms 95224 KB Output is correct
5 Correct 470 ms 96736 KB Output is correct
6 Runtime error 85 ms 131076 KB Execution killed with signal 9
7 Runtime error 77 ms 131076 KB Execution killed with signal 9
8 Runtime error 76 ms 131076 KB Execution killed with signal 9
9 Correct 1852 ms 101964 KB Output is correct
10 Runtime error 105 ms 131076 KB Execution killed with signal 9
11 Correct 3195 ms 101580 KB Output is correct
12 Runtime error 121 ms 131076 KB Execution killed with signal 9
13 Runtime error 121 ms 131076 KB Execution killed with signal 9
14 Runtime error 118 ms 131076 KB Execution killed with signal 9
15 Runtime error 115 ms 131076 KB Execution killed with signal 9
16 Runtime error 103 ms 131076 KB Execution killed with signal 9
17 Runtime error 103 ms 131076 KB Execution killed with signal 9