Submission #501100

#	Time	Username	Problem	Language	Result	Execution time	Memory
501100		600Mihnea	Pairs (IOI07_pairs)	C++17	100 / 100	2514 ms	59724 KiB

pairs

#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

signed main() {
  ios::sync_with_stdio(0); cin.tie(0);

  ///freopen ("input", "r", stdin);

  int B;
  cin >> B;
  if (B == 1) {
    int n, d, _;
    cin >> n >> d >> _;
    vector<int> a(n);
    for (auto &x : a) {
      cin >> x;
    }
    sort(a.begin(), a.end());
    ll sol = 0;
    int C = 0, c = 0;
    for (int i = 0; i < n; i++) {
      int low = a[i] - d, high = a[i] + d;
      while (C < n && a[C] <= high) {
        C++;
      }
      while (c < n && a[c] < low) {
        c++;
      }
      sol += C - c;
    }
    sol -= n;
    sol /= 2;
    cout << sol << "\n";
    exit(0);
  }
  if (B == 2) {
    /// aib 2d
    int n, d, L;
    cin >> n >> d >> L;
    L *= 2;
    vector<map<int, int>> guys(L + 1);
    vector<vector<int>> aib(L + 1);

    function<void(int, int)> prep_add = [&] (int a, int b) {
      for (int i = a; i <= L; i += i & (-i)) {
        guys[i][b] = 0;
      }
    };

    function<int(int, int)> get = [&] (int a, int b) {
      if (a < 0) a = 0;
      if (b < 0) b = 0;
      if (a > L) a = L;
      if (b > L) b = L;
      if (!a || !b) return 0;
      int sol = 0;
      for (int i = a; i >= 1; i -= i & (-i)) {
        auto it = guys[i].lower_bound(b + 1);
        if (it == guys[i].begin()) continue;
        it--;
        int st = it->second;
        for (int j = st; j >= 1; j -= j & (-j)) {
          sol += aib[i][j];
        }
      }
      return sol;
    };

    function<void(int, int, int)> add = [&] (int a, int b, int x) {
      for (int i = a; i <= L; i += i & (-i)) {
        int st = guys[i][b];
        for (int j = st; j < (int) aib[i].size(); j += j & (-j)) {
          aib[i][j] += x;
        }
      }
    };

    vector<int> x(n), y(n);
    for (int i = 0; i < n; i++) {
      int xx, yy;
      cin >> xx >> yy;
      x[i] = xx + yy;
      y[i] = xx - yy + L / 2;
      prep_add(x[i], y[i]);
    }
    for (int i = 0; i <= L; i++) {
      int cur = 0;
      for (auto &it : guys[i]) {
        cur++;
        it.second = cur;
      }
      aib[i].resize(cur + 1);
    }

    for (int i = 0; i < n; i++) {
      add(x[i], y[i], 1);
    }


    ll sol = 0;
    for (int i = 0; i < n; i++) {
      sol += get(x[i] + d, y[i] + d) - get(x[i] - d - 1, y[i] + d) - get(x[i] + d, y[i] - d - 1) + get(x[i] - d - 1, y[i] - d - 1);
    }
    sol -= n;
    sol /= 2;
    cout << sol << "\n";
    exit(0);
  }

  if (B == 3) {
    int n, d, L;
    cin >> n >> d >> L;
    L *= 2;
    vector<int> x(n), y(n), z(n);
    for (int i = 0; i < n; i++) {
      int yy, zz;
      cin >> x[i] >> yy >> zz;
      y[i] = yy + zz;
      z[i] = yy - zz + L / 2;
    }
    vector<vector<vector<int>>> sum(L / 2 + 1, vector<vector<int>> (L + 1, vector<int> (L + 1, 0)));
    for (int i = 0; i < n; i++) {
      sum[x[i]][y[i]][z[i]]++;
    }
    for (int i = 0; i <= L / 2; i++) {
      for (int j = 0; j <= L; j++) {
        int pref = 0;
        for (int k = 0; k <= L; k++) {
          pref += sum[i][j][k];
          sum[i][j][k] = pref;
          if (j) {
            sum[i][j][k] += sum[i][j - 1][k];
          }
        }
      }
    }


    ll sol = 0;
    for (int i = 0; i < n; i++) {
      for (int oth = 0; oth <= L / 2; oth++) {
        int dist = abs(x[i] - oth);
        if (dist > d) continue;
        int d2 = d - dist;
        sol += sum[oth][min(L, y[i] + d2)][min(L, z[i] + d2)];
        if (z[i] - d2 - 1 >= 1) sol -= sum[oth][min(L, y[i] + d2)][z[i] - d2 - 1];
        if (y[i] - d2 - 1 >= 1) sol -= sum[oth][y[i] - d2 - 1][min(L, z[i] + d2)];
        if (z[i] - d2 - 1 >= 1 && y[i] - d2 - 1 >= 1) sol += sum[oth][y[i] - d2 - 1][z[i] - d2 - 1];
      }
    }
    sol -= n;
    sol /= 2;
    cout << sol << "\n";
    exit(0);
  }

  assert(0);

  return 0;
}

• Subtask 1: 6 / 6
• Subtask 2: 6 / 6
• Subtask 3: 6 / 6
• Subtask 4: 6 / 6
• Subtask 5: 6 / 6
• Subtask 6: 7 / 7
• Subtask 7: 7 / 7
• Subtask 8: 8 / 8
• Subtask 9: 8 / 8
• Subtask 10: 10 / 10
• Subtask 11: 10 / 10
• Subtask 12: 10 / 10
• Subtask 13: 10 / 10