제출 #1220013

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1220013		comgaTramAnh	Regions (IOI09_regions)	C++20	80 / 100	8098 ms	113508 KiB

regions

#include <iostream>
#include <vector>
#include <algorithm>
#include <utility> 
#include <math.h>
int n, R, numQueries;
int timeDfs = 0;  
int f[25005][852]; 
int id[25005]; 
std::vector <int> adj[200005]; 
int home[200005]; 
int cnt[25005]; 
int l[200005], r[200005]; 
std::vector <int> listTime[25005];  
std::vector <std::pair <int, int>> save;
std::vector <int> heavy, light;
std::vector <int> listVertex[25005];  
void dfs(int u, int father) {
  cnt[home[u]]++; 
  for (int i = 0; i < (int) heavy.size(); i++) {
    f[id[home[u]]][id[heavy[i]]] += cnt[heavy[i]] - (home[u] == heavy[i]); 
  }
  for (int i = 0; i < (int) adj[u].size(); i++) {
    int v = adj[u][i];
    if (v == father) {
      continue; 
    }
    dfs(v, u); 
  }                            
  cnt[home[u]]--; 
}
void euler_tour(int u, int father) {
  timeDfs++;
  l[u] = timeDfs;
  listTime[home[u]].push_back(l[u]); 
  for (int i = 0; i < (int) adj[u].size(); i++) {
    int v = adj[u][i];
    if (v == father) {
      continue; 
    }
    euler_tour(v, u); 
  }  
  r[u] = timeDfs; 
}
int main() {
  std::ios_base::sync_with_stdio(false);
  std::cin.tie(NULL);
  std::cin >> n >> R >> numQueries; 
  std::cin >> home[1]; 
  for (int i = 2; i <= n; i++) {
    int parent;
    std::cin >> parent >> home[i]; 
    adj[parent].push_back(i);
    adj[i].push_back(parent);
  }
  for (int i = 1; i <= n; i++) {
    cnt[home[i]]++;  
    listVertex[home[i]].push_back(i); 
  }
  for (int i = 1; i <= R; i++) {
    save.push_back(std::make_pair(cnt[i], i)); 
  }
  std::sort(save.begin(), save.end());
  std::reverse(save.begin(), save.end()); 
  const int block = 300;
  for (int i = 0; i < (int) save.size(); i++) {
    id[save[i].second] = i;
    if (save[i].first >= block) {
      heavy.push_back(save[i].second); 
    }
    else {
      light.push_back(save[i].second); 
    }  
  }
  for (int i = 1; i <= R; i++) {
    cnt[i] = 0; 
  }
  dfs(1, -1);
  timeDfs = 0;
  euler_tour(1, -1);
  for (int query = 1; query <= numQueries; query++) {
    int r1, r2;
    std::cin >> r1 >> r2; 
    if (cnt[r2] >= block) {
      std::cout << f[id[r1]][id[r2]] << std::endl; 
    }
    else {
      std::vector <int> &vec = listVertex[r1]; 
      std::vector <int> &vTime = listTime[r2];
      int ans = 0; 
      for (int i = 0; i < (int) vec.size(); i++) {
        int u = vec[i]; 
        int minLeft = -1, maxRight = -1; 
        int lo = 0, hi = (int) vTime.size() - 1;
        while (lo <= hi) {
          int mid = (lo + hi) / 2;
          if (l[u] <= vTime[mid]) {
            minLeft = mid; 
            hi = mid - 1; 
          }
          else {
            lo = mid + 1; 
          }
        }
        lo = 0, hi = (int) vTime.size() - 1;
        while (lo <= hi) {
          int mid = (lo + hi) / 2;
          if (vTime[mid] <= r[u]) {
            maxRight = mid; 
            lo = mid + 1; 
          }
          else {
            hi = mid - 1; 
          }
        } 
        if (minLeft != -1 && maxRight != -1 && minLeft <= maxRight) {
          ans += maxRight - minLeft + 1; 
        }
      }
      std::cout << ans << std::endl; 
    }
    fflush(stdout); 
  }            
  return 0;
}

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