oj.uz

답안 #931518

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
931518 2024-02-22T01:24:18 Z Pring Advertisement 2 (JOI23_ho_t2) C++14
100 / 100
 122 ms 18064 KB 
#include <bits/stdc++.h>
using namespace std;

#ifdef MIKU
#define debug(x...) cout << "[" << #x << "] : ", dout(x)
void dout() { cout << endl; }
template <typename T, typename ...U>
void dout(T t, U ...u) { cout << t << (sizeof...(u) ? ", " : ""); dout(u...); }
#else
#define debug(...) 39
#endif

#define int long long
#define fs first
#define sc second
#define mp make_pair
#define FOR(i, j, k) for (int i = j, Z = k; i < Z; i++)
typedef pair<int, int> pii;

const int MXN = 500005;
int n;
pii p[MXN];
bitset<MXN> l, r;

void PRE_L() {
    l[0] = true;
    int now = LLONG_MIN;
    FOR(i, 1, n + 1) {
        now = max(now, p[i - 1].fs + p[i - 1].sc);
        l[i] = (p[i].fs + p[i].sc > now);
    }
}

void PRE_R() {
    r[n - 1] = true;
    int now = LLONG_MAX;
    for (int i = n - 2; i >= 0; i--) {
        now = min(now, p[i + 1].fs - p[i + 1].sc);
        r[i] = (p[i].fs - p[i].sc < now);
    }
}

void miku() {
    cin >> n;
    FOR(i, 0, n) cin >> p[i].fs >> p[i].sc;
    sort(p, p + n);
    debug();
    n = unique(p, p + n) - p;
    PRE_L();
    PRE_R();
    int ans = 0;
    FOR(i, 0, n) if (l[i] && r[i]) ans++;
    cout << ans << '\n';
}

int32_t main() {
    cin.tie(0) -> sync_with_stdio(false);
    cin.exceptions(iostream::failbit);
    miku();
    return 0;
}

Compilation message

Main.cpp: In function 'void miku()':
Main.cpp:10:20: warning: statement has no effect [-Wunused-value]
   10 | #define debug(...) 39
      |                    ^~
Main.cpp:47:5: note: in expansion of macro 'debug'
   47 |     debug();
      |     ^~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 28 ms 4864 KB Output is correct
3 Correct 40 ms 8060 KB Output is correct
4 Correct 98 ms 16496 KB Output is correct
5 Correct 53 ms 12880 KB Output is correct
6 Correct 112 ms 17396 KB Output is correct
7 Correct 115 ms 18000 KB Output is correct
8 Correct 110 ms 17980 KB Output is correct
9 Correct 81 ms 17900 KB Output is correct

Subtask #2
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 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 0 ms 348 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 344 KB Output is correct
11 Correct 1 ms 348 KB Output is correct
12 Correct 0 ms 348 KB Output is correct
13 Correct 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct

Subtask #3
36.0 / 36.0

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

Subtask #4
31.0 / 31.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 28 ms 4864 KB Output is correct
3 Correct 40 ms 8060 KB Output is correct
4 Correct 98 ms 16496 KB Output is correct
5 Correct 53 ms 12880 KB Output is correct
6 Correct 112 ms 17396 KB Output is correct
7 Correct 115 ms 18000 KB Output is correct
8 Correct 110 ms 17980 KB Output is correct
9 Correct 81 ms 17900 KB Output is correct
10 Correct 0 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 0 ms 348 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 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 0 ms 344 KB Output is correct
20 Correct 1 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 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 1 ms 348 KB Output is correct
30 Correct 1 ms 348 KB Output is correct
31 Correct 1 ms 348 KB Output is correct
32 Correct 0 ms 348 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 82 ms 13052 KB Output is correct
37 Correct 98 ms 15232 KB Output is correct
38 Correct 113 ms 18064 KB Output is correct
39 Correct 108 ms 14932 KB Output is correct
40 Correct 117 ms 18052 KB Output is correct
41 Correct 118 ms 18004 KB Output is correct
42 Correct 122 ms 18000 KB Output is correct
43 Correct 113 ms 17032 KB Output is correct
44 Correct 113 ms 18004 KB Output is correct
45 Correct 98 ms 14164 KB Output is correct