oj.uz

Submission #65543

# Submission time Handle Problem Language Result Execution time Memory
65543 2018-08-07T23:06:05 Z KieranHorgan Pairs (IOI07_pairs) C++17
80 / 100
 4000 ms 33180 KB 
#pragma GCC optimize("Ofast")
#include <bits/stdc++.h>

using namespace std;
#define endl '\n'
#define ll long long
// #define int long long
#define ld double
#define pii pair<int,int>
#define rand() abs((rand()<<15)|rand())
#define randll() abs(((long long)rand()<<30)

int B, N, D, M;
int n;
ll ans;

vector<vector<int>> rows;
struct SegmentTree {
  vector<vector<int>> st;
  SegmentTree(int N_) {
    n = N_;
    st.assign(4*n, vector<int>(0));
    build();
  }
  void build(int id=1, int l=0, int r=n) {
    if(l+1 == r) {
      st[id] = rows[l];
      return;
    }

    int mid = (l+r)/2;
    build(id*2  , l, mid);
    build(id*2+1, mid, r);
    merge(st[id*2].begin(), st[id*2].end(), st[id*2+1].begin(), st[id*2+1].end(), back_inserter(st[id]));
  }

  int query(int r1, int c1, int r2, int c2, int id=1, int l=0, int r=n) {
    if(l >= r1 && r <= r2) {
      return upper_bound(st[id].begin(), st[id].end(), c2)-lower_bound(st[id].begin(), st[id].end(), c1);
    }
    if(l >= r2 || r <= r1) return 0;

    int mid = (l+r)/2;
    return query(r1, c1, r2, c2, id*2  , l, mid) + query(r1, c1, r2, c2, id*2+1, mid, r);
  }
};

signed main() {
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  cin >> B >> N >> D >> M;

  if(B == 1) {
    vector<int> a(N);
    for(auto &x: a)
      cin >> x;

    sort(a.begin(), a.end());

    for(auto x: a)
      ans += upper_bound(a.begin(), a.end(), x+D)-lower_bound(a.begin(), a.end(), x-D)-1;

    cout << ans/2 << endl;
  }

  if(B == 2) {
    vector<pair<int, int>> a(N);
    rows.assign(2*M-1, vector<int>(0));
    for(int i = 0; i < N; i++) {
      int x, y;
      cin >> x >> y;
      x--; y--;
      rows[x+y].push_back(M-1-(x-y));
      a[i] = {x+y, M-1-(x-y)};
    }

    for(auto &v: rows)
      sort(v.begin(), v.end());

    SegmentTree st(2*M-1);
    for(auto p: a) {
      ans += st.query(p.first-D, p.second-D, p.first+D+1, p.second+D)-1;
    }
    // if(ans%2) return -1;
    cout << (ans)/2 << endl;
  }

  if(B == 3) {
    vector<pair<pair<int, int>, int>> a(N);
    vector<vector<vector<int>>> bigRows(M, vector<vector<int>>(2*M-1, vector<int>(0)));
    for(int i = 0; i < N; i++) {
      int x, y, z;
      cin >> x >> y >> z;
      x--; y--; z--;
      bigRows[z][x+y].push_back(M-1-(x-y));
      a[i] = {{x+y, M-1-(x-y)}, z};
    }

    for(auto &r: bigRows)
      for(auto &v: r)
        sort(v.begin(), v.end());

    vector<SegmentTree> st;
    for(int i = 0; i < M; i++) {
      rows = bigRows[i];
      st.push_back(SegmentTree(2*M-1));
    }
    for(auto p: a) {
      int x = p.first.first;
      int y = p.first.second;
      int z = p.second;
      for(int Z = max(0, z-D); Z <= min(M-1, z+D); Z++) {
        ans += st[Z].query(x-(D-abs(Z-z)), y-(D-abs(Z-z)), x+(D-abs(Z-z))+1, y+(D-abs(Z-z)));
      }
      ans--;
    }
    // if(ans%2) return -1;
    cout << (ans)/2 << endl;
  }
}

Subtask #1
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 456 KB Output is correct

Subtask #2
6.0 / 6.0

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

Subtask #3
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 812 KB Output is correct
2 Correct 22 ms 812 KB Output is correct

Subtask #4
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 34 ms 856 KB Output is correct
2 Correct 60 ms 856 KB Output is correct

Subtask #5
6.0 / 6.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 1028 KB Output is correct
2 Correct 39 ms 1028 KB Output is correct
3 Correct 30 ms 1028 KB Output is correct

Subtask #6
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 26 ms 18472 KB Output is correct
2 Correct 32 ms 18472 KB Output is correct

Subtask #7
7.0 / 7.0

# Verdict Execution time Memory Grader output
1 Correct 144 ms 18472 KB Output is correct
2 Correct 40 ms 18472 KB Output is correct

Subtask #8
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 233 ms 18472 KB Output is correct
2 Correct 203 ms 18472 KB Output is correct
3 Correct 258 ms 18472 KB Output is correct
4 Correct 208 ms 18472 KB Output is correct

Subtask #9
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 493 ms 32992 KB Output is correct
2 Correct 418 ms 33180 KB Output is correct
3 Correct 179 ms 33180 KB Output is correct
4 Correct 228 ms 33180 KB Output is correct

Subtask #10
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 33180 KB Output is correct
2 Correct 9 ms 33180 KB Output is correct

Subtask #11
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 109 ms 33180 KB Output is correct
2 Correct 499 ms 33180 KB Output is correct
3 Correct 91 ms 33180 KB Output is correct

Subtask #12
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1012 ms 33180 KB Output is correct
2 Execution timed out 4033 ms 33180 KB Time limit exceeded
3 Halted 0 ms 0 KB -

Subtask #13
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3531 ms 33180 KB Output is correct
2 Execution timed out 4043 ms 33180 KB Time limit exceeded
3 Halted 0 ms 0 KB -