oj.uz

Submission #501093

# Submission time Handle Problem Language Result Execution time Memory
501093 2022-01-02T11:00:28 Z 600Mihnea Pairs (IOI07_pairs) C++17
60 / 100
 2482 ms 60876 KB 
#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);
  }

  assert(0);

  return 0;
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 204 KB Output is correct
2 Correct 0 ms 204 KB Output is correct

Subtask #2
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 716 KB Output is correct
2 Correct 13 ms 720 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 720 KB Output is correct
2 Correct 18 ms 588 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 22 ms 716 KB Output is correct
2 Correct 17 ms 716 KB Output is correct
3 Correct 17 ms 716 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 18 ms 15988 KB Output is correct
2 Correct 15 ms 15948 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 1896 KB Output is correct
2 Correct 99 ms 1896 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 971 ms 15796 KB Output is correct
2 Correct 652 ms 15788 KB Output is correct
3 Correct 519 ms 10808 KB Output is correct
4 Correct 621 ms 13412 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 2482 ms 59644 KB Output is correct
2 Correct 1824 ms 60876 KB Output is correct
3 Correct 571 ms 30676 KB Output is correct
4 Correct 605 ms 27836 KB Output is correct

Subtask #10
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #11
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Runtime error 1 ms 460 KB Execution killed with signal 6
2 Halted 0 ms 0 KB -