oj.uz

답안 #601240

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
601240 2022-07-21T13:45:18 Z PixelCat Regions (IOI09_regions) C++14
100 / 100
 4448 ms 68460 KB 
/*       code by the cute PixelCat owo       */
/*   as cute as nacho neko (aka. my wife)!   */

// #pragma GCC optimize("O4,unroll-loops,no-stack-protector")
#include <bits/stdc++.h>
#define int LL  //__int128
#define double long double
using namespace std;
using LL = long long;
using uLL = unsigned long long;
using pii = pair<int, int>;

#define For(i, a, b) for (int i = a; i <= b; i++)
#define Fors(i, a, b, s) for (int i = a; i <= b; i += s)
#define Forr(i, a, b) for (int i = a; i >= b; i--)
#define F first
#define S second
#define L(id) (id * 2 + 1)
#define R(id) (id * 2 + 2)
#define LO(x) (x & (-x))

#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) ((int)x.size())
#define mkp make_pair

// #define MOD (int)(998244353)
#define MOD (int)(1e9 + 7)
// #define INF (int)(9000000000000000000ll)  // 9e18
#define INF (int)(1000000000000000000ll)  // 1e18
#define EPS (1e-6)

#ifdef NYAOWO
#include "../library/debug.hpp"
inline void USACO(const string &s) {
    cerr << "USACO: " << s << "\n";
}

#else
#define debug(...)
inline void timer() {}
inline void USACO(const string &s) {
    freopen((s + ".in").c_str(), "r", stdin);
    freopen((s + ".out").c_str(), "w", stdout);
}

#endif

inline void NYA() {
    ios::sync_with_stdio(false);
    cin.tie(0);
}
inline int gcd(int a, int b) {
    return __gcd(a, b);
}
inline int lcm(int a, int b) {
    return a / gcd(a, b) * b;
}
int fpow(int b, int p, const int &mod = MOD) {
    int ans = 1;
    while (p) {
        if (p & 1) ans = ans * b % mod;
        p /= 2;
        b = b * b % mod;
    }
    return ans;
}
int fpow(int b, int p) {
    return fpow(b, p, MOD);
}
template <typename T>
inline void chmin(T &_a, const T &_b) {
    if (_b < _a) _a = _b;
}
template <typename T>
inline void chmax(T &_a, const T &_b) {
    if (_b > _a) _a = _b;
}
// static mt19937_64 rng(
//     chrono::steady_clock::now().time_since_epoch().count());

const int MAXN = 200020;
const int MAXR = 25020;
const int K = 38;

#define IS_BIG(R) (sz(pos[R]) >= K)

// euler tour
int32_t size[MAXN];
int16_t color[MAXN];
vector<int32_t> pos[MAXR];

map<int16_t, vector<int32_t>> ans_big; // {r1 -> {r2 -> ans}}

int buildEulerTour(int cur, vector<vector<int32_t>> &adj, vector<int16_t> &t_col) {
    static int now_id = 1;
    int id = now_id; now_id++;
    size[id] = 1;
    color[id] = t_col[cur];
    pos[color[id]].eb(id);
    for(auto &i:adj[cur]) {
        size[id] += buildEulerTour(i, adj, t_col);
    }
    return size[id];
}

void read_tree(int n) {
    vector<vector<int32_t>> adj(n + 1);
    vector<int16_t> t_col(n + 1);
    cin >> t_col[1];
    For(i, 2, n) {
        int p; cin >> p;
        adj[p].eb(i);
        cin >> t_col[i];
    }
    buildEulerTour(1, adj, t_col);
}

void precal_big(int r, int n, int maxr) {
    vector<int32_t> buf(n + 1);
    for(auto &i:pos[r]) {
        buf[i + 1]++;
        buf[i + size[i]]--;
    }
    ans_big[r] = vector<int32_t>(maxr + 1);
    For(i, 1, n) {
        buf[i] += buf[i - 1];
        ans_big[r][color[i]] += buf[i];
    }
}

inline int count(int col, int l, int r) {
    return upper_bound(all(pos[col]), r) - lower_bound(all(pos[col]), l);
}

int query_smol(int r1, int r2) {
    int ans = 0;
    for(auto &i:pos[r1]) {
        ans += count(r2, i + 1, i + size[i] - 1);
    }
    return ans;
}

int query_big(int r1, int r2) {
    return ans_big[r1][r2];
}

int32_t main() {
    NYA();
    // QAQ
    int n, r, q;
    cin >> n >> r >> q;
    read_tree(n);
    For(i, 1, r) if(IS_BIG(i)) {
        precal_big(i, n, r);
    }
    while(q--) {
        int r1, r2; cin >> r1 >> r2;
        if(IS_BIG(r1)) {
            cout << query_big(r1, r2) << "\n" << flush;
        } else {
            cout << query_smol(r1, r2) << "\n" << flush;
        }
    }
    return 0;
}

Subtask #1
15.0 / 15.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 848 KB Output is correct
2 Correct 1 ms 848 KB Output is correct
3 Correct 2 ms 848 KB Output is correct
4 Correct 5 ms 848 KB Output is correct
5 Correct 8 ms 848 KB Output is correct
6 Correct 21 ms 976 KB Output is correct
7 Correct 33 ms 976 KB Output is correct
8 Correct 26 ms 976 KB Output is correct
9 Correct 22 ms 1488 KB Output is correct
10 Correct 78 ms 1488 KB Output is correct
11 Correct 200 ms 2000 KB Output is correct
12 Correct 225 ms 2512 KB Output is correct
13 Correct 308 ms 2256 KB Output is correct
14 Correct 246 ms 2872 KB Output is correct
15 Correct 353 ms 6224 KB Output is correct

Subtask #2
85.0 / 85.0

# 결과 실행 시간 메모리 Grader output
1 Correct 973 ms 6864 KB Output is correct
2 Correct 1049 ms 5604 KB Output is correct
3 Correct 1345 ms 9220 KB Output is correct
4 Correct 245 ms 3152 KB Output is correct
5 Correct 495 ms 10920 KB Output is correct
6 Correct 680 ms 4564 KB Output is correct
7 Correct 1004 ms 7680 KB Output is correct
8 Correct 1594 ms 22580 KB Output is correct
9 Correct 2892 ms 40260 KB Output is correct
10 Correct 3856 ms 68460 KB Output is correct
11 Correct 4448 ms 63484 KB Output is correct
12 Correct 3282 ms 42056 KB Output is correct
13 Correct 3563 ms 42948 KB Output is correct
14 Correct 3310 ms 45748 KB Output is correct
15 Correct 4233 ms 67848 KB Output is correct
16 Correct 3630 ms 65460 KB Output is correct
17 Correct 3987 ms 55664 KB Output is correct