#ifdef LOCAL
#define _GLIBCXX_DEBUG
#endif
#include <bits/stdc++.h>
#ifndef LOCAL
// #pragma GCC optimize("O3")
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("avx,avx2,bmi,bmi2,popcnt,lzcnt")
#endif
using namespace std;
using ll = long long;
using ld = long double;
#define x first
#define y second
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
mt19937_64 mt(time(0));
void solve();
void init();
int32_t main() {
#ifndef LOCAL
cin.tie(nullptr)->sync_with_stdio(false);
#endif
cout << fixed << setprecision(30);
init();
int t = 1;
// cin >> t;
while (t--) {
solve();
}
}
namespace fastio {
static constexpr uint32_t SZ = 1 << 17;
char ibuf[SZ];
char obuf[SZ];
uint32_t pil = 0, pir = 0, por = 0;
struct Pre {
char num[40000];
constexpr Pre() : num() {
for (int i = 0; i < 10000; i++) {
int n = i;
for (int j = 3; j >= 0; j--) {
num[i * 4 + j] = n % 10 + '0';
n /= 10;
}
}
}
} constexpr pre;
__attribute__((target("avx2"), optimize("O3"))) inline void load() {
memcpy(ibuf, ibuf + pil, pir - pil);
pir = pir - pil + fread(ibuf + pir - pil, 1, SZ - pir + pil, stdin);
pil = 0;
}
__attribute__((target("avx2"), optimize("O3"))) inline void flush() {
fwrite(obuf, 1, por, stdout);
por = 0;
}
inline void read(char &c) { c = ibuf[pil++]; }
template<typename T>
__attribute__((target("avx2"), optimize("O3"))) inline void read(T &x) {
if (pil + 32 > pir) load();
char c;
do
read(c);
while (c < '-');
bool minus = 0;
if (std::is_signed<T>::value) {
if (c == '-') {
minus = 1;
read(c);
}
}
x = 0;
while (c >= '0') {
x = x * 10 + (c & 15);
read(c);
}
if (std::is_signed<T>::value) {
if (minus) x = -x;
}
}
inline void write(char c) { obuf[por++] = c; }
template<typename T>
__attribute__((target("avx2"), optimize("O3"))) inline void write(T x) {
if (por + 32 > SZ) flush();
if (!x) {
write('0');
return;
}
if (std::is_signed<T>::value) {
if (x < 0) {
write('-');
x = -x;
}
}
if (x >= 10000000000000000) {
uint32_t r1 = x % 100000000;
uint64_t q1 = x / 100000000;
uint32_t r2 = q1 % 100000000;
uint32_t q2 = q1 / 100000000;
uint32_t n1 = r1 % 10000;
uint32_t n2 = r1 / 10000;
uint32_t n3 = r2 % 10000;
uint32_t n4 = r2 / 10000;
if (x >= 1000000000000000000) {
uint32_t q3 = (q2 * 20972) >> 21;
uint32_t r3 = q2 - q3 * 100;
uint32_t q4 = (r3 * 205) >> 11;
uint32_t r4 = r3 - q4 * 10;
obuf[por + 0] = '0' + q3;
obuf[por + 1] = '0' + q4;
obuf[por + 2] = '0' + r4;
memcpy(obuf + por + 3, pre.num + (n4 << 2), 4);
memcpy(obuf + por + 7, pre.num + (n3 << 2), 4);
memcpy(obuf + por + 11, pre.num + (n2 << 2), 4);
memcpy(obuf + por + 15, pre.num + (n1 << 2), 4);
por += 19;
} else if (x >= 100000000000000000) {
uint32_t q3 = (q2 * 205) >> 11;
uint32_t r3 = q2 - q3 * 10;
obuf[por + 0] = '0' + q3;
obuf[por + 1] = '0' + r3;
memcpy(obuf + por + 2, pre.num + (n4 << 2), 4);
memcpy(obuf + por + 6, pre.num + (n3 << 2), 4);
memcpy(obuf + por + 10, pre.num + (n2 << 2), 4);
memcpy(obuf + por + 14, pre.num + (n1 << 2), 4);
por += 18;
} else {
obuf[por + 0] = '0' + q2;
memcpy(obuf + por + 1, pre.num + (n4 << 2), 4);
memcpy(obuf + por + 5, pre.num + (n3 << 2), 4);
memcpy(obuf + por + 9, pre.num + (n2 << 2), 4);
memcpy(obuf + por + 13, pre.num + (n1 << 2), 4);
por += 17;
}
} else {
int i = 8;
char buf[12];
while (x >= 10000) {
memcpy(buf + i, pre.num + (x % 10000) * 4, 4);
x /= 10000;
i -= 4;
}
if (x < 100) {
if (x < 10) {
write(char('0' + x));
} else {
obuf[por + 0] = '0' + x / 10;
obuf[por + 1] = '0' + x % 10;
por += 2;
}
} else {
if (x < 1000) {
memcpy(obuf + por, pre.num + (x << 2) + 1, 3);
por += 3;
} else {
memcpy(obuf + por, pre.num + (x << 2), 4);
por += 4;
}
}
memcpy(obuf + por, buf + i + 4, 8 - i);
por += 8 - i;
}
}
inline int getChar() {
if (pil + 32 > pir) load();
return ibuf[pil++]; }
inline int readChar() {
if (pil + 32 > pir) load();
int c = getChar();
while (c != -1 && c <= 32) c = getChar();
return c;
}
inline void read(char *s) {
int c = readChar();
while (c > 32)
*s++ = c, c = getChar();
*s = 0;
}
inline void read(std::string &s) {
s.clear();
int c = readChar();
while (c > 32) s.push_back(c), c = getChar();
}
inline void write(const char *s) {
while (*s) {
if (por + 32 > SZ) flush();
write(*s++);
}
}
inline void write(std::string &s) {
for (auto &i: s) {
if (por + 32 > SZ) flush();
write(i);
}
}
inline void write(double x) {
if (por + 32 > SZ) flush();
if (x < 0)
write('-'), x = -x;
int t = (int) x;
write(t), x -= t;
write('.');
for (int i = 18 - 1; i > 0; i--) {
x *= 10;
t = std::min(9, (int) x);
write('0' + t), x -= t;
}
x *= 10;
t = std::min(9, (int) (x + 0.5));
write('0' + t);
}
template<typename T, typename ...Args>
inline void read(T &x, Args &...args) {
read(x);
read(args...);
}
template<typename T, typename ...Args>
inline void write(T x, Args ...args) {
write(x);
write(args...);
}
struct AutoFlush {
~AutoFlush() { flush(); }
} AutoFlush;
} // namespace fastio
using fastio::read;
using fastio::write;
void init() {}
const int N = 500500;
pair<int, int> a[N];
bool check(int i, int j) {
return a[i].y - a[j].y >= abs(a[i].x - a[j].x);
}
void solve() {
int n;
// cin >> n;
read(n);
for (int i = 0; i < n; i++) {
// cin >> a[i].x >> a[i].y;
read(a[i].x, a[i].y);
}
sort(a, a + n);
vector<int> st;
for (int i = 0; i < n; i++) {
while (!st.empty() && check(i, st.back())) {
st.pop_back();
}
if (st.empty() || !check(st.back(), i)) {
st.push_back(i);
}
}
// cout << st.size() << '\n';
write(st.size(), '\n');
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
18 ms |
4944 KB |
Output is correct |
3 |
Correct |
28 ms |
5332 KB |
Output is correct |
4 |
Correct |
60 ms |
8896 KB |
Output is correct |
5 |
Correct |
26 ms |
6228 KB |
Output is correct |
6 |
Correct |
71 ms |
11328 KB |
Output is correct |
7 |
Correct |
73 ms |
10700 KB |
Output is correct |
8 |
Correct |
65 ms |
9552 KB |
Output is correct |
9 |
Correct |
39 ms |
9388 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
468 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
1 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
348 KB |
Output is correct |
2 |
Correct |
0 ms |
348 KB |
Output is correct |
3 |
Correct |
0 ms |
348 KB |
Output is correct |
4 |
Correct |
1 ms |
348 KB |
Output is correct |
5 |
Correct |
1 ms |
344 KB |
Output is correct |
6 |
Correct |
0 ms |
348 KB |
Output is correct |
7 |
Correct |
1 ms |
344 KB |
Output is correct |
8 |
Correct |
1 ms |
344 KB |
Output is correct |
9 |
Correct |
1 ms |
348 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
1 ms |
344 KB |
Output is correct |
12 |
Correct |
1 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
0 ms |
468 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
1 ms |
348 KB |
Output is correct |
17 |
Correct |
0 ms |
348 KB |
Output is correct |
18 |
Correct |
0 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
0 ms |
348 KB |
Output is correct |
21 |
Correct |
1 ms |
344 KB |
Output is correct |
22 |
Correct |
1 ms |
348 KB |
Output is correct |
23 |
Correct |
0 ms |
344 KB |
Output is correct |
24 |
Correct |
1 ms |
348 KB |
Output is correct |
25 |
Correct |
1 ms |
348 KB |
Output is correct |
26 |
Correct |
1 ms |
348 KB |
Output is correct |
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
0 ms |
344 KB |
Output is correct |
2 |
Correct |
18 ms |
4944 KB |
Output is correct |
3 |
Correct |
28 ms |
5332 KB |
Output is correct |
4 |
Correct |
60 ms |
8896 KB |
Output is correct |
5 |
Correct |
26 ms |
6228 KB |
Output is correct |
6 |
Correct |
71 ms |
11328 KB |
Output is correct |
7 |
Correct |
73 ms |
10700 KB |
Output is correct |
8 |
Correct |
65 ms |
9552 KB |
Output is correct |
9 |
Correct |
39 ms |
9388 KB |
Output is correct |
10 |
Correct |
1 ms |
348 KB |
Output is correct |
11 |
Correct |
0 ms |
348 KB |
Output is correct |
12 |
Correct |
0 ms |
348 KB |
Output is correct |
13 |
Correct |
1 ms |
348 KB |
Output is correct |
14 |
Correct |
1 ms |
344 KB |
Output is correct |
15 |
Correct |
0 ms |
348 KB |
Output is correct |
16 |
Correct |
1 ms |
344 KB |
Output is correct |
17 |
Correct |
1 ms |
344 KB |
Output is correct |
18 |
Correct |
1 ms |
348 KB |
Output is correct |
19 |
Correct |
1 ms |
348 KB |
Output is correct |
20 |
Correct |
1 ms |
344 KB |
Output is correct |
21 |
Correct |
1 ms |
348 KB |
Output is correct |
22 |
Correct |
1 ms |
348 KB |
Output is correct |
23 |
Correct |
0 ms |
468 KB |
Output is correct |
24 |
Correct |
0 ms |
348 KB |
Output is correct |
25 |
Correct |
1 ms |
348 KB |
Output is correct |
26 |
Correct |
0 ms |
348 KB |
Output is correct |
27 |
Correct |
0 ms |
348 KB |
Output is correct |
28 |
Correct |
1 ms |
348 KB |
Output is correct |
29 |
Correct |
0 ms |
348 KB |
Output is correct |
30 |
Correct |
1 ms |
344 KB |
Output is correct |
31 |
Correct |
1 ms |
348 KB |
Output is correct |
32 |
Correct |
0 ms |
344 KB |
Output is correct |
33 |
Correct |
1 ms |
348 KB |
Output is correct |
34 |
Correct |
1 ms |
348 KB |
Output is correct |
35 |
Correct |
1 ms |
348 KB |
Output is correct |
36 |
Correct |
48 ms |
6756 KB |
Output is correct |
37 |
Correct |
60 ms |
8020 KB |
Output is correct |
38 |
Correct |
70 ms |
9392 KB |
Output is correct |
39 |
Correct |
66 ms |
8072 KB |
Output is correct |
40 |
Correct |
70 ms |
9604 KB |
Output is correct |
41 |
Correct |
73 ms |
9524 KB |
Output is correct |
42 |
Correct |
72 ms |
9608 KB |
Output is correct |
43 |
Correct |
72 ms |
9736 KB |
Output is correct |
44 |
Correct |
69 ms |
9600 KB |
Output is correct |
45 |
Correct |
59 ms |
9504 KB |
Output is correct |