oj.uz

답안 #729011

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
729011 2023-04-23T11:51:20 Z MilosMilutinovic Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 717 ms 25028 KB 
/**
 *    author:  wxhtzdy
 *    created: 12.02.2023 12:07:23
**/
#include <bits/stdc++.h>

using namespace std;

const int N = 500500;
const int M = 8 * N;

int st[2][M];

void build(int x, int p, int l, int r, int v) {
  st[x][p] = v;
  if (l == r) {
    return;
  }
  int mid = l + r >> 1;
  build(x, p * 2, l, mid, v);
  build(x, p * 2 + 1, mid + 1, r, v);
}

int query(int x, int p, int l, int r, int ll, int rr) {
  if (l > r || l > rr || r < ll) {
    return -2e9;
  }
  if (ll <= l && r <= rr) {
    return st[x][p];
  }
  int mid = l + r >> 1;
  return max(query(x, p * 2, l, mid, ll, rr), query(x, p * 2 + 1, mid + 1, r, ll, rr));
}

void modify(int x, int p, int l, int r, int i, int v) {
  st[x][p] = max(st[x][p], v);
  if (l == r) {
    return;
  }
  int mid = l + r >> 1;
  if (i <= mid) {
    modify(x, p * 2, l, mid, i, v);
  } else {
    modify(x, p * 2 + 1, mid + 1, r, i, v);
  }
}
 
int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);  
  int n;
  cin >> n;
  vector<int> x(n);
  vector<int> e(n);
  for (int i = 0; i < n; i++) {
    cin >> x[i] >> e[i];
  }
  vector<int> order(n);
  iota(order.begin(), order.end(), 0);
  sort(order.begin(), order.end(), [&](int i, int j) {
    return e[i] > e[j];
  });
  vector<int> xs;
  for (int i = 0; i < n; i++) {
    xs.push_back(x[i]);
  }  
  sort(xs.begin(), xs.end());
  xs.erase(unique(xs.begin(), xs.end()), xs.end());
  int k = (int) xs.size();
  auto GetVal = [&](int t) {
    return (int) (lower_bound(xs.begin(), xs.end(), t) - xs.begin());
  };
  build(0, 1, 0, k - 1, -2e9);
  build(1, 1, 0, k - 1, -2e9);
  int ans = 0;
  for (int i : order) {
    // e[j] - x[j] >= e[i] - x[i], x[i] <= x[j]
    // e[j] + x[j] >= x[i] + e[i], x[i] >= x[j]
    int p = GetVal(x[i]);
    if (query(0, 1, 0, k - 1, p, k - 1) >= e[i] - x[i]) {
      continue;      
    }
    if (query(1, 1, 0, k - 1, 0, p) >= e[i] + x[i]) {
      continue;
    }
    ans += 1;
    modify(0, 1, 0, k - 1, p, e[i] - x[i]);
    modify(1, 1, 0, k - 1, p, e[i] + x[i]);
  }
  cout << ans << '\n';          
  return 0;
}

Compilation message

Main.cpp: In function 'void build(int, int, int, int, int)':
Main.cpp:19:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   19 |   int mid = l + r >> 1;
      |             ~~^~~
Main.cpp: In function 'int query(int, int, int, int, int, int)':
Main.cpp:31:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   31 |   int mid = l + r >> 1;
      |             ~~^~~
Main.cpp: In function 'void modify(int, int, int, int, int, int)':
Main.cpp:40:15: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   40 |   int mid = l + r >> 1;
      |             ~~^~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 118 ms 6608 KB Output is correct
3 Correct 133 ms 7756 KB Output is correct
4 Correct 216 ms 13232 KB Output is correct
5 Correct 112 ms 10212 KB Output is correct
6 Correct 717 ms 23784 KB Output is correct
7 Correct 429 ms 20160 KB Output is correct
8 Correct 233 ms 16800 KB Output is correct
9 Correct 140 ms 17184 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct

Subtask #3
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 0 ms 340 KB Output is correct
5 Correct 0 ms 212 KB Output is correct
6 Correct 1 ms 212 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 1 ms 340 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 1 ms 340 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 1 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 352 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 1 ms 468 KB Output is correct
23 Correct 1 ms 352 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 1 ms 260 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 118 ms 6608 KB Output is correct
3 Correct 133 ms 7756 KB Output is correct
4 Correct 216 ms 13232 KB Output is correct
5 Correct 112 ms 10212 KB Output is correct
6 Correct 717 ms 23784 KB Output is correct
7 Correct 429 ms 20160 KB Output is correct
8 Correct 233 ms 16800 KB Output is correct
9 Correct 140 ms 17184 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 1 ms 212 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 340 KB Output is correct
14 Correct 0 ms 212 KB Output is correct
15 Correct 1 ms 212 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 1 ms 340 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 212 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 0 ms 212 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 352 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Correct 1 ms 468 KB Output is correct
32 Correct 1 ms 352 KB Output is correct
33 Correct 1 ms 340 KB Output is correct
34 Correct 1 ms 340 KB Output is correct
35 Correct 1 ms 260 KB Output is correct
36 Correct 301 ms 17908 KB Output is correct
37 Correct 466 ms 21976 KB Output is correct
38 Correct 564 ms 22464 KB Output is correct
39 Correct 457 ms 21024 KB Output is correct
40 Correct 451 ms 24596 KB Output is correct
41 Correct 482 ms 24228 KB Output is correct
42 Correct 366 ms 22964 KB Output is correct
43 Correct 478 ms 25028 KB Output is correct
44 Correct 426 ms 22496 KB Output is correct
45 Correct 716 ms 22196 KB Output is correct