Submission #961298

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
961298	2024-04-11T19:48:50 Z	mannshah1211	Advertisement 2 (JOI23_ho_t2)	C++17	100 / 100	86 ms	20488 KB

Main

#pragma GCC target("avx2,bmi2")

#include <bits/stdc++.h>
using namespace std;

#ifndef ONLINE_JUDGE
#define getchar_unlocked() getchar()
#endif

inline int read() {
  int x = 0;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    ch = getchar_unlocked();
  }
  while (ch >= '0' && ch <= '9') {
	x = (x << 3) + (x << 1) + ch - '0';
	ch = getchar_unlocked();
  }
  return x;
}

int x[10000000], y[10000000];

const int inf = 1e9;

using T = pair<int, int>;

int main() {
  int n = read();
  for (int i = 0; i < n; i++) {
	x[i] = read();
	y[i] = read();
  }
  vector<pair<int, int>> ds(n);
  for (int i = 0; i < n; i++) {
    ds[i] = make_pair(x[i] - y[i], x[i] + y[i]);
  }
  sort(ds.begin(), ds.end(), [](const T& a, const T& b) {
    if (a.first == b.first) {
      return (a.second > b.second);
    }
    return (a.first < b.first);
  });
  int mx = -inf, ans = 0;
  for (int i = 0; i < n; i++) {
    if (mx < ds[i].second) {
      ans++;
    }
    mx = max(mx, ds[i].second);
  }
  cout << ans << '\n';
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	19 ms	10172 KB	Output is correct
3	Correct	27 ms	11612 KB	Output is correct
4	Correct	67 ms	19348 KB	Output is correct
5	Correct	31 ms	15688 KB	Output is correct
6	Correct	80 ms	19924 KB	Output is correct
7	Correct	86 ms	20388 KB	Output is correct
8	Correct	76 ms	20412 KB	Output is correct
9	Correct	49 ms	20488 KB	Output is correct

Subtask #2

23.0 / 23.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2644 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct

Subtask #3

36.0 / 36.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2392 KB	Output is correct
2	Correct	1 ms	2396 KB	Output is correct
3	Correct	1 ms	2396 KB	Output is correct
4	Correct	1 ms	2396 KB	Output is correct
5	Correct	1 ms	2396 KB	Output is correct
6	Correct	1 ms	2644 KB	Output is correct
7	Correct	1 ms	2396 KB	Output is correct
8	Correct	1 ms	2396 KB	Output is correct
9	Correct	1 ms	2396 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2396 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2396 KB	Output is correct
20	Correct	1 ms	2516 KB	Output is correct
21	Correct	1 ms	2496 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2516 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct

Subtask #4

31.0 / 31.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	2396 KB	Output is correct
2	Correct	19 ms	10172 KB	Output is correct
3	Correct	27 ms	11612 KB	Output is correct
4	Correct	67 ms	19348 KB	Output is correct
5	Correct	31 ms	15688 KB	Output is correct
6	Correct	80 ms	19924 KB	Output is correct
7	Correct	86 ms	20388 KB	Output is correct
8	Correct	76 ms	20412 KB	Output is correct
9	Correct	49 ms	20488 KB	Output is correct
10	Correct	1 ms	2392 KB	Output is correct
11	Correct	1 ms	2396 KB	Output is correct
12	Correct	1 ms	2396 KB	Output is correct
13	Correct	1 ms	2396 KB	Output is correct
14	Correct	1 ms	2396 KB	Output is correct
15	Correct	1 ms	2644 KB	Output is correct
16	Correct	1 ms	2396 KB	Output is correct
17	Correct	1 ms	2396 KB	Output is correct
18	Correct	1 ms	2396 KB	Output is correct
19	Correct	1 ms	2392 KB	Output is correct
20	Correct	1 ms	2396 KB	Output is correct
21	Correct	1 ms	2396 KB	Output is correct
22	Correct	1 ms	2396 KB	Output is correct
23	Correct	1 ms	2396 KB	Output is correct
24	Correct	1 ms	2396 KB	Output is correct
25	Correct	1 ms	2396 KB	Output is correct
26	Correct	1 ms	2396 KB	Output is correct
27	Correct	1 ms	2396 KB	Output is correct
28	Correct	1 ms	2396 KB	Output is correct
29	Correct	1 ms	2516 KB	Output is correct
30	Correct	1 ms	2496 KB	Output is correct
31	Correct	1 ms	2396 KB	Output is correct
32	Correct	1 ms	2516 KB	Output is correct
33	Correct	1 ms	2396 KB	Output is correct
34	Correct	1 ms	2396 KB	Output is correct
35	Correct	1 ms	2396 KB	Output is correct
36	Correct	49 ms	15784 KB	Output is correct
37	Correct	71 ms	18272 KB	Output is correct
38	Correct	78 ms	20364 KB	Output is correct
39	Correct	71 ms	17308 KB	Output is correct
40	Correct	75 ms	20312 KB	Output is correct
41	Correct	78 ms	20308 KB	Output is correct
42	Correct	77 ms	20308 KB	Output is correct
43	Correct	78 ms	19304 KB	Output is correct
44	Correct	76 ms	20408 KB	Output is correct
45	Correct	62 ms	16500 KB	Output is correct