萌新初学cdq分治 0分求助
查看原帖
萌新初学cdq分治 0分求助
677234
FstAutoMaton楼主2023/12/5 19:21

RT,和暴力拍了十几分钟拍不出来,但一交上去就全 WA。

code:

#include <bits/stdc++.h>

using namespace std;

const int kMaxN = 2e5 + 5, kMaxV = 2e5 + 5;

struct A {
  int x, y, z, id;
  bool operator<(const A &a) const {
    return x == a.x ? (y == a.y ? z < a.z : y < a.y) : x < a.x;
  }
} a[kMaxN], b[kMaxN], c[kMaxN];

struct T {
  int x, y, z;
  bool operator<(const T &a) const {
    return x == a.x ? (y == a.y ? z < a.z : y < a.y) : x < a.x;
  }
};

int w[kMaxV], s[kMaxN], ans[kMaxN], n, k;
map<T, int> mp;

bool P(A x, A y) {
  return x.y < y.y;
}

void U(int x, int y) {
  for (int i = x; i <= k; w[i] += y, i += i & -i) {
  }
}

int Q(int x) {
  int ans = 0;
  for (int i = x; i >= 1; ans += w[i], i -= i & -i) {
  }
  return ans;
}

// cdq,启动!
void S(int l, int r) {
  if (l != r) {
    int mid = l + r >> 1;
    S(l, mid), S(mid + 1, r);
    for (int i = l; i <= r; i++) {
      b[i] = a[i];
    }
    sort(b + l, b + mid + 1, P);
    sort(b + mid + 1, b + r + 1, P);
    int p = l;
    for (int i = mid + 1, j = l; i <= r; i++) {
      for (; j <= mid && b[j].y <= b[i].y; U(b[j].z, 1), j++) {
      }
      p = j;
      s[b[i].id] += Q(b[i].z);
    }
    for (int i = l; i < p; i++) {
      U(b[i].z, -1);
    }
  }
}

int main() {
  // freopen("hack.in", "r", stdin);
  // freopen("op.out", "w", stdout);
  ios ::sync_with_stdio(0), cin.tie(0), cout.tie(0);
  cin >> n >> k;
  for (int i = 1; i <= n; i++) {
    cin >> a[i].x >> a[i].y >> a[i].z;
    a[i].id = i, c[i] = a[i];    
    mp[{c[i].x, c[i].y, c[i].z}]++;
  }
  sort(c + 1, c + n + 1);
  int _n;
  a[_n = 1] = c[1];
  for (int i = 2; i <= n; i++) {
    if (c[i].x != c[i - 1].x || c[i].y != c[i - 1].y || c[i].z != c[i - 1].z) {
      a[++_n] = c[i];
    }
  }
  S(1, _n);
  for (int i = 1; i <= _n; i++) {
    mp[{a[i].x, a[i].y, a[i].z}] += s[a[i].id];
  }
  for (int i = 1; i <= n; i++) {
    ans[s[i] = mp[{c[i].x, c[i].y, c[i].z}] - 1]++;
  }
  for (int i = 0; i < n; i++) {
    cout << ans[i] << "\n";
  }
  return 0;
}
2023/12/5 19:21
加载中...