oj.uz

답안 #274471

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
274471 2020-08-19T12:09:11 Z evpipis Regions (IOI09_regions) C++11
60 / 100
 8000 ms 131076 KB 
#include <bits/stdc++.h>
using namespace std;

#define pb push_back

const int k = 90, len = 2e5+5;
int cnt_st[len], cnt_en[len], order[len], pos[len], cnt;
vector<int> vec[len], adj[len], store_big, buck[len];
int par[len], reg[len], big[len], n, r, q;
int prec[len/k][len/k];

struct node{
    int val;
    node *lef, *rig;

    node(int v = 0, node *l = NULL, node *r = NULL){
        val = v;
        lef = l;
        rig = r;
    }
};

typedef node *pnode;
pnode null, root[len];

pnode update(pnode t, int l, int r, int i){
    if (l == r)
        return new node(t->val+1, null, null);

    int mid = (l+r)/2;
    if (i <= mid)
        return new node(t->val+1, update(t->lef, l, mid, i), t->rig);
    else
        return new node(t->val+1, t->lef, update(t->rig, mid+1, r, i));
}

int query(pnode t, int l, int r, int i){
    while (l < r){
        int mid = (l+r)/2;
        if (i <= mid)
            t = t->lef, r = mid;
        else
            t = t->rig, l = mid+1;
    }

    return t->val;
}

void fix(int u){
    cnt_st[u] = ++cnt;
    order[cnt] = u;
    root[u] = update(root[par[u]], 1, r, reg[u]);

    for (auto v: adj[u])
        fix(v);

    cnt_en[u] = cnt;
}

int bs(int myr, int l, int r){
    return upper_bound(vec[myr].begin(), vec[myr].end(), r) - lower_bound(vec[myr].begin(), vec[myr].end(), l);
}

int main(){
    scanf("%d %d %d", &n, &r, &q);
    scanf("%d", &reg[1]);
    buck[reg[1]].pb(1);
    for (int i = 2; i <= n; i++){
        scanf("%d %d", &par[i], &reg[i]);
        buck[reg[i]].pb(i);
        adj[par[i]].pb(i);
    }

    for (int i = 1; i <= r; i++)
        big[i] = (buck[i].size() > k);

    /// make persistent segment tree
    null = new node();
    null->lef = null->rig = null;
    root[0] = null;
    fix(1);

    /// fix vec[]
    for (int i = 1; i <= n; i++)
        vec[reg[order[i]]].pb(i);

    /// compute prec[]
    for (int i = 1; i <= r; i++)
        if (big[i])
            pos[i] = store_big.size(), store_big.pb(i);

    for (int u = 1; u <= n; u++){
        if (!big[reg[u]]) continue;

        int r1 = reg[u];
        for (auto r2: store_big)
            prec[pos[r1]][pos[r2]] += bs(r2, cnt_st[u], cnt_en[u]);
    }

    // answer queries
    while (q--){
        int r1, r2;
        scanf("%d %d", &r1, &r2);

        if (!big[r1]){
            int ans = 0;
            for (auto u: buck[r1])
                ans += bs(r2, cnt_st[u], cnt_en[u]);
            printf("%d\n", ans), fflush(stdout);
        }
        else if (!big[r2]){
            int ans = 0;
            for (auto u: buck[r2])
                ans += query(root[u], 1, r, r1);
            printf("%d\n", ans), fflush(stdout);
        }
        else{
            printf("%d\n", prec[pos[r1]][pos[r2]]), fflush(stdout);
        }
    }
    return 0;
}

Compilation message

regions.cpp: In function 'int main()':
regions.cpp:65:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   65 |     scanf("%d %d %d", &n, &r, &q);
      |     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
regions.cpp:66:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   66 |     scanf("%d", &reg[1]);
      |     ~~~~~^~~~~~~~~~~~~~~
regions.cpp:69:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   69 |         scanf("%d %d", &par[i], &reg[i]);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~
regions.cpp:103:14: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  103 |         scanf("%d %d", &r1, &r2);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 11 ms 14464 KB Output is correct
2 Correct 12 ms 14464 KB Output is correct
3 Correct 15 ms 14464 KB Output is correct
4 Correct 13 ms 14464 KB Output is correct
5 Correct 21 ms 14592 KB Output is correct
6 Correct 22 ms 14720 KB Output is correct
7 Correct 40 ms 14976 KB Output is correct
8 Correct 50 ms 15232 KB Output is correct
9 Correct 90 ms 16384 KB Output is correct
10 Correct 140 ms 18176 KB Output is correct
11 Correct 143 ms 19840 KB Output is correct
12 Correct 201 ms 22136 KB Output is correct
13 Correct 178 ms 23040 KB Output is correct
14 Correct 592 ms 25720 KB Output is correct
15 Correct 582 ms 31012 KB Output is correct

Subtask #2
45.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1522 ms 41652 KB Output is correct
2 Correct 1771 ms 42228 KB Output is correct
3 Correct 2829 ms 48504 KB Output is correct
4 Correct 591 ms 29176 KB Output is correct
5 Correct 484 ms 33660 KB Output is correct
6 Correct 862 ms 40824 KB Output is correct
7 Correct 1628 ms 51448 KB Output is correct
8 Correct 3000 ms 71132 KB Output is correct
9 Correct 7365 ms 99964 KB Output is correct
10 Execution timed out 8016 ms 117880 KB Time limit exceeded
11 Execution timed out 8061 ms 129144 KB Time limit exceeded
12 Execution timed out 8034 ms 121080 KB Time limit exceeded
13 Execution timed out 8023 ms 121080 KB Time limit exceeded
14 Execution timed out 8029 ms 127480 KB Time limit exceeded
15 Runtime error 307 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
16 Runtime error 262 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)
17 Runtime error 297 ms 131076 KB Execution killed with signal 9 (could be triggered by violating memory limits)