Submission #74083

#	Time	Username	Problem	Language	Result	Execution time	Memory
74083		funcsr	Regions (IOI09_regions)	C++17	100 / 100	3650 ms	89680 KiB

regions

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <string>
#include <cstring>
#include <vector>
#include <queue>
#include <set>
#include <map>
#include <cmath>
#include <iomanip>
#include <cassert>
#include <bitset>
using namespace std;

typedef pair<int, int> P;
#define rep(i, n) for (int i=0; i<(n); i++)
#define all(c) (c).begin(), (c).end()
#define uniq(c) c.erase(unique(all(c)), (c).end())
#define index(xs, x) (int)(lower_bound(all(xs), x) - xs.begin())
#define _1 first
#define _2 second
#define pb push_back
#define INF 1145141919
#define MOD 1000000007
const int B = 200;

int N, K, Q;
int ord[200000];
vector<int> G[200000];
int L[200000], R[200000];
vector<int> U[200000];
vector<int> tour[200000];
vector<int> pre[200000];
int TT[2000000];

void dfs(int x, int &size) {
  L[x] = size++;
  tour[ord[x]].pb(L[x]);
  for (int t : G[x]) dfs(t, size);
  R[x] = size-1;
}

signed main() {
  ios::sync_with_stdio(false); cin.tie(0);
  cin >> N >> K >> Q;
  rep(i, N) {
    if (i != 0) {
      int p; cin >> p; p--;
      G[p].pb(i);
    }
    cin >> ord[i];
    ord[i]--;
    U[ord[i]].pb(i);
  }
  int k = 0;
  dfs(0, k);
  rep(g, K) if (U[g].size() >= B) {
    pre[g] = vector<int>(K, 0);
    rep(i, N) TT[i] = 0;
    for (int e1 : U[g]) TT[L[e1]]++, TT[R[e1]+1]--;
    rep(i, N-1) TT[i+1] += TT[i];
    rep(i, N) pre[g][ord[i]] += TT[L[i]];
  }


  rep(_, Q) {
    int r1, r2;
    cin >> r1 >> r2;
    r1--, r2--;
    long long s = 0;
    if (!pre[r1].empty()) s = pre[r1][r2];
    else {
      for (int e1 : U[r1]) s += index(tour[r2], R[e1]+1)-index(tour[r2], L[e1]);
    }
    cout << s << endl;
  }
  return 0;
}

• Subtask 1: 15 / 15
• Subtask 2: 85 / 85