oj.uz

답안 #785672

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
785672 2023-07-17T12:01:18 Z shart23 Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 167 ms 5344 KB 
#include <cstdio>
#include <vector>
#include <utility>
#include <algorithm>

int ri() {
  int n;
  scanf("%d", &n);
  return n;
}

int main() {
  int N = ri();
  std::vector<std::pair<int, int> > points(N);
  for (int i = 0; i < N; i++) {
    int X = ri();
    int E = ri();
    points[i] = {X - E, X + E}; // {a[i], b[i]}
  }
  
  // aåŒã˜ãªã‚‰bé™é †ã«ã™ã‚‹ã¨ã€aãŒåŒã˜ã‚„ã¤ã§è¤‡æ•°å›žbã®æœ€å¤§å€¤ã‚’æ›´æ–°ã—ã¦ã—ã¾ã£ãŸã‚Šã—ãªããªã‚‹
  std::sort(points.begin(), points.end(), [] (auto &i, auto &j) {
    if (i.first != j.first) return i.first < j.first;
    return i.second > j.second;
  });
  int max = -1;
  int cnt = 0;
  for (auto i : points) if (max < i.second) max = i.second, cnt++;
  
  printf("%d\n", cnt);
  return 0;
}

Compilation message

Main.cpp: In function 'int ri()':
Main.cpp:8:8: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    8 |   scanf("%d", &n);
      |   ~~~~~^~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 32 ms 2408 KB Output is correct
3 Correct 54 ms 2920 KB Output is correct
4 Correct 107 ms 4980 KB Output is correct
5 Correct 59 ms 3884 KB Output is correct
6 Correct 122 ms 5248 KB Output is correct
7 Correct 123 ms 5252 KB Output is correct
8 Correct 117 ms 5336 KB Output is correct
9 Correct 93 ms 5344 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 288 KB Output is correct
11 Correct 0 ms 288 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 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 212 KB Output is correct

Subtask #3
36.0 / 36.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Correct 1 ms 288 KB Output is correct
4 Correct 0 ms 212 KB Output is correct
5 Correct 1 ms 288 KB Output is correct
6 Correct 1 ms 288 KB Output is correct
7 Correct 0 ms 212 KB Output is correct
8 Correct 0 ms 212 KB Output is correct
9 Correct 0 ms 212 KB Output is correct
10 Correct 0 ms 288 KB Output is correct
11 Correct 0 ms 288 KB Output is correct
12 Correct 0 ms 212 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 212 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 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 1 ms 212 KB Output is correct
22 Correct 1 ms 212 KB Output is correct
23 Correct 1 ms 212 KB Output is correct
24 Correct 1 ms 304 KB Output is correct
25 Correct 1 ms 212 KB Output is correct
26 Correct 1 ms 212 KB Output is correct

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 32 ms 2408 KB Output is correct
3 Correct 54 ms 2920 KB Output is correct
4 Correct 107 ms 4980 KB Output is correct
5 Correct 59 ms 3884 KB Output is correct
6 Correct 122 ms 5248 KB Output is correct
7 Correct 123 ms 5252 KB Output is correct
8 Correct 117 ms 5336 KB Output is correct
9 Correct 93 ms 5344 KB Output is correct
10 Correct 0 ms 212 KB Output is correct
11 Correct 0 ms 212 KB Output is correct
12 Correct 1 ms 288 KB Output is correct
13 Correct 0 ms 212 KB Output is correct
14 Correct 1 ms 288 KB Output is correct
15 Correct 1 ms 288 KB Output is correct
16 Correct 0 ms 212 KB Output is correct
17 Correct 0 ms 212 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 288 KB Output is correct
20 Correct 0 ms 288 KB Output is correct
21 Correct 0 ms 212 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 1 ms 212 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 212 KB Output is correct
28 Correct 1 ms 212 KB Output is correct
29 Correct 1 ms 212 KB Output is correct
30 Correct 1 ms 212 KB Output is correct
31 Correct 1 ms 212 KB Output is correct
32 Correct 1 ms 212 KB Output is correct
33 Correct 1 ms 304 KB Output is correct
34 Correct 1 ms 212 KB Output is correct
35 Correct 1 ms 212 KB Output is correct
36 Correct 81 ms 4020 KB Output is correct
37 Correct 103 ms 4628 KB Output is correct
38 Correct 132 ms 5284 KB Output is correct
39 Correct 110 ms 5340 KB Output is correct
40 Correct 134 ms 5344 KB Output is correct
41 Correct 123 ms 5340 KB Output is correct
42 Correct 149 ms 5340 KB Output is correct
43 Correct 122 ms 5344 KB Output is correct
44 Correct 147 ms 5344 KB Output is correct
45 Correct 167 ms 5344 KB Output is correct