oj.uz

Submission #201053

# Submission time Handle Problem Language Result Execution time Memory
201053 2020-02-09T08:26:09 Z extraterrestrial Examination (JOI19_examination) C++14
43 / 100
 929 ms 109028 KB 
#include <bits/stdc++.h>
typedef long long ll;
typedef long double ld;
using namespace std;
#define F first
#define S second
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define SZ(x) (int)(x).size()
//#define int ll

struct query {
  int a, b, sum, id;
  query() {};
  query(int a, int b, int sum, int id) : a(a), b(b), sum(sum), id(id) {};
};

const int N = 1e5 + 10;
vector<int> vls[4 * N], fen[4 * N], xx[N];
int on[4 * N], ans[N];

void merge(int v) {
  int ptr1 = 0, ptr2 = 0;
  while (ptr1 < SZ(vls[2 * v]) && ptr2 < SZ(vls[2 * v + 1])) {
    if (vls[2 * v][ptr1] < vls[2 * v + 1][ptr2]) {
      if (vls[v].empty() || vls[v].back() != vls[2 * v][ptr1]) {
        vls[v].pb(vls[2 * v][ptr1]);
      }
      ptr1++;
    }
    else {
      if (vls[v].empty() || vls[v].back() != vls[2 * v + 1][ptr2]) {
        vls[v].pb(vls[2 * v + 1][ptr2]);
      }
      ptr2++; 
    }
  }
  while (ptr1 < SZ(vls[2 * v])) {
    if (vls[v].empty() || vls[v].back() != vls[2 * v][ptr1]) {
      vls[v].pb(vls[2 * v][ptr1]);
    }
    ptr1++;
  }
  while (ptr2 < SZ(vls[2 * v + 1])) {
    if (vls[v].empty() || vls[v].back() != vls[2 * v + 1][ptr2]) {
      vls[v].pb(vls[2 * v + 1][ptr2]);
    }
    ptr2++;
  }
}

void build(int v, int l, int r) {
  if (l == r) {
    vls[v] = xx[l];
    on[v] = 0;
    fen[v].resize(SZ(vls[v]) + 1);
    return;
  }
  int mid = (l + r) / 2;
  build(2 * v, l, mid);
  build(2 * v + 1, mid + 1, r);
  merge(v);
  on[v] = 0;
  fen[v].resize(SZ(vls[v]) + 1);
}

void update(int v, int l, int r, int x, int y) {
  on[v]++;
  int pos = upper_bound(all(vls[v]), y) - vls[v].begin();
  for (; pos <= SZ(vls[v]); pos += pos & (-pos)) {
    fen[v][pos]++;
  }
  if (l == r) {
    return;
  }
  int mid = (l + r) / 2;
  if (x <= mid) {
    update(2 * v, l, mid, x, y);
  }
  else {
    update(2 * v + 1, mid + 1, r, x, y);
  }
}

int get(int v, int l, int r, int a, int b, int y) {
  if (l > b || r < a) {
    return 0;
  }
  if (l >= a && r <= b) {
    int pos = lower_bound(all(vls[v]), y) - vls[v].begin(), res = on[v];
    for (; pos > 0; pos -= pos & (-pos)) {
      res -= fen[v][pos];
    }
    return res;
  }
  int mid = (l + r) / 2;
  return get(2 * v, l, mid, a, b, y) + get(2 * v + 1, mid + 1, r, a, b, y);
}

signed main() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
  int n, m;
  cin >> n >> m;
  vector<int> a(n), b(n), sa, sb, ss;
  for (int i = 0; i < n; i++) {
    cin >> a[i] >> b[i];
    sa.pb(a[i]);
    sb.pb(b[i]);
    ss.pb(a[i] + b[i]);
  }
  vector<query> que(m);
  for (int i = 0; i < m; i++) {
    cin >> que[i].a >> que[i].b >> que[i].sum;
    que[i].id = i;
    sa.pb(que[i].a);
    sb.pb(que[i].b);
    ss.pb(que[i].sum);
  }
  sort(all(sa));
  sort(all(sb));
  sort(all(ss));
  sa.resize(unique(all(sa)) - sa.begin());
  sb.resize(unique(all(sb)) - sb.begin());
  ss.resize(unique(all(ss)) - ss.begin());
  vector<vector<pair<int, int>>> add(SZ(ss));
  for (int i = 0; i < n; i++) {
    int cs = lower_bound(all(ss), a[i] + b[i]) - ss.begin();
    a[i] = upper_bound(all(sa), a[i]) - sa.begin();
    b[i] = upper_bound(all(sb), b[i]) - sb.begin();
    xx[a[i]].pb(b[i]);
    add[cs].pb({a[i], b[i]});
  }
  for (int i = 1; i <= SZ(sa); i++) {
    sort(all(xx[i]));
    xx[i].resize(unique(all(xx[i])) - xx[i].begin());
  }
  build(1, 1, SZ(sa));
  vector<vector<pair<pair<int, int>, int>>> check(SZ(ss));
  for (int i = 0; i < m; i++) {
    que[i].sum = lower_bound(all(ss), que[i].sum) - ss.begin();
    que[i].a = upper_bound(all(sa), que[i].a) - sa.begin();
    que[i].b = upper_bound(all(sb), que[i].b) - sb.begin();
    check[que[i].sum].pb(make_pair(make_pair(que[i].a, que[i].b), que[i].id));
  }
  for (int i = SZ(ss) - 1; i >= 0; i--) {
    for (auto it : add[i]) {
      update(1, 1, SZ(sa), it.F, it.S);
    }
    for (auto it : check[i]) {
      ans[it.S] = get(1, 1, SZ(sa), it.F.F, SZ(sa), it.F.S);
    }
  }
  for (int i = 0; i < m; i++) {
    cout << ans[i] << '\n';
  }
}

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 21496 KB Output is correct
2 Correct 19 ms 21496 KB Output is correct
3 Correct 18 ms 21496 KB Output is correct
4 Correct 21 ms 21496 KB Output is correct
5 Correct 20 ms 21496 KB Output is correct
6 Correct 19 ms 21500 KB Output is correct
7 Correct 33 ms 23160 KB Output is correct
8 Correct 34 ms 23160 KB Output is correct
9 Correct 36 ms 23160 KB Output is correct
10 Correct 29 ms 23032 KB Output is correct
11 Correct 25 ms 22264 KB Output is correct
12 Correct 22 ms 21804 KB Output is correct
13 Correct 34 ms 23032 KB Output is correct
14 Correct 31 ms 23036 KB Output is correct
15 Correct 32 ms 23032 KB Output is correct
16 Correct 24 ms 22008 KB Output is correct
17 Correct 27 ms 22904 KB Output is correct
18 Correct 21 ms 21752 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 807 ms 59916 KB Output is correct
2 Correct 820 ms 62508 KB Output is correct
3 Correct 820 ms 62536 KB Output is correct
4 Correct 370 ms 50332 KB Output is correct
5 Correct 273 ms 39636 KB Output is correct
6 Correct 115 ms 31700 KB Output is correct
7 Correct 709 ms 60244 KB Output is correct
8 Correct 737 ms 62420 KB Output is correct
9 Correct 673 ms 60116 KB Output is correct
10 Correct 202 ms 37180 KB Output is correct
11 Correct 314 ms 48856 KB Output is correct
12 Correct 85 ms 31188 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 807 ms 59916 KB Output is correct
2 Correct 820 ms 62508 KB Output is correct
3 Correct 820 ms 62536 KB Output is correct
4 Correct 370 ms 50332 KB Output is correct
5 Correct 273 ms 39636 KB Output is correct
6 Correct 115 ms 31700 KB Output is correct
7 Correct 709 ms 60244 KB Output is correct
8 Correct 737 ms 62420 KB Output is correct
9 Correct 673 ms 60116 KB Output is correct
10 Correct 202 ms 37180 KB Output is correct
11 Correct 314 ms 48856 KB Output is correct
12 Correct 85 ms 31188 KB Output is correct
13 Correct 929 ms 65696 KB Output is correct
14 Correct 893 ms 64984 KB Output is correct
15 Correct 800 ms 62424 KB Output is correct
16 Correct 431 ms 52068 KB Output is correct
17 Correct 338 ms 41300 KB Output is correct
18 Correct 116 ms 31832 KB Output is correct
19 Correct 920 ms 65760 KB Output is correct
20 Correct 920 ms 65280 KB Output is correct
21 Correct 889 ms 65196 KB Output is correct
22 Correct 200 ms 37204 KB Output is correct
23 Correct 300 ms 48764 KB Output is correct
24 Correct 87 ms 31188 KB Output is correct

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 19 ms 21496 KB Output is correct
2 Correct 19 ms 21496 KB Output is correct
3 Correct 18 ms 21496 KB Output is correct
4 Correct 21 ms 21496 KB Output is correct
5 Correct 20 ms 21496 KB Output is correct
6 Correct 19 ms 21500 KB Output is correct
7 Correct 33 ms 23160 KB Output is correct
8 Correct 34 ms 23160 KB Output is correct
9 Correct 36 ms 23160 KB Output is correct
10 Correct 29 ms 23032 KB Output is correct
11 Correct 25 ms 22264 KB Output is correct
12 Correct 22 ms 21804 KB Output is correct
13 Correct 34 ms 23032 KB Output is correct
14 Correct 31 ms 23036 KB Output is correct
15 Correct 32 ms 23032 KB Output is correct
16 Correct 24 ms 22008 KB Output is correct
17 Correct 27 ms 22904 KB Output is correct
18 Correct 21 ms 21752 KB Output is correct
19 Correct 807 ms 59916 KB Output is correct
20 Correct 820 ms 62508 KB Output is correct
21 Correct 820 ms 62536 KB Output is correct
22 Correct 370 ms 50332 KB Output is correct
23 Correct 273 ms 39636 KB Output is correct
24 Correct 115 ms 31700 KB Output is correct
25 Correct 709 ms 60244 KB Output is correct
26 Correct 737 ms 62420 KB Output is correct
27 Correct 673 ms 60116 KB Output is correct
28 Correct 202 ms 37180 KB Output is correct
29 Correct 314 ms 48856 KB Output is correct
30 Correct 85 ms 31188 KB Output is correct
31 Correct 929 ms 65696 KB Output is correct
32 Correct 893 ms 64984 KB Output is correct
33 Correct 800 ms 62424 KB Output is correct
34 Correct 431 ms 52068 KB Output is correct
35 Correct 338 ms 41300 KB Output is correct
36 Correct 116 ms 31832 KB Output is correct
37 Correct 920 ms 65760 KB Output is correct
38 Correct 920 ms 65280 KB Output is correct
39 Correct 889 ms 65196 KB Output is correct
40 Correct 200 ms 37204 KB Output is correct
41 Correct 300 ms 48764 KB Output is correct
42 Correct 87 ms 31188 KB Output is correct
43 Runtime error 361 ms 109028 KB Execution killed with signal 11 (could be triggered by violating memory limits)
44 Halted 0 ms 0 KB -