oj.uz

Submission #933235

# Submission time Handle Problem Language Result Execution time Memory
933235 2024-02-25T10:00:39 Z Whisper Osumnjičeni (COCI21_osumnjiceni) C++17
110 / 110
 310 ms 56524 KB 
#include <bits/stdc++.h>

using namespace std;
using ll = long long;

#define int long long
#define FOR(i, a, b) for ( int i = a ; i <= b ; i++ )
#define FORD(i, a, b) for (int i = b; i >= a; i --)
#define REP(i, n) for (int i = 0; i < n; ++i)
#define REPD(i, n) for (int i = n - 1; i >= 0; --i)
#define pii pair<int , int>
#define Lg(x) 31 - __builtin_clz(x)

#define MASK(i) (1LL << (i))
#define BIT(x, i) (((x) >> (i)) & 1)

constexpr ll LINF = (1ll << 60);
constexpr int INF = (1ll << 30);
constexpr int MAX = 2e5 + 5;
constexpr int Mod = 1e9 + 7;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

void setupIO(){
    #define name "Whisper"
    //Phu Trong from Nguyen Tat Thanh High School for gifted student
    srand(time(NULL));
    cin.tie(nullptr)->sync_with_stdio(false); cout.tie(nullptr);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    cout << fixed << setprecision(10);
}

template <class X, class Y>
    bool minimize(X &x, const Y &y){
        X eps = 1e-9;
        if (x > y + eps) {x = y; return 1;}
        return 0;
    }

template <class X, class Y>
    bool maximize(X &x, const Y &y){
        X eps = 1e-9;
        if (x + eps < y) {x = y; return 1;}
        return 0;
    }
int nArr, numQuery;
pair<int, int> a[MAX];
int nxt[MAX][22];
void Whisper(){
    cin >> nArr;
    for (int i = 1; i <= nArr; ++i) cin >> a[i].first >> a[i].second;
    set<pair<int, int>> s;

    auto Add = [&](pair<int, int> x){
        auto iter = s.lower_bound(x);
        if (iter != s.end()){
            pair<int, int> left = *(iter);
            if (left.first <= x.second) return false;
        }
        if (iter != s.begin()){
            pair<int, int> right = *prev(iter);
            if (right.second >= x.first) return false;
        }
        s.insert(x);
        return true;
    };
    FOR(i, 0, nArr + 2) FOR(k, 0, 21) nxt[i][k] = nArr + 1;
    int l = 1;
    for (int i = 1; i <= nArr; ++i){
        while (l <= nArr && Add(a[l])) l++;
        nxt[i][0] = l;
        s.erase(a[i]);
    }
    for (int i = nArr; i >= 0; --i){
        for (int k = 1; k <= 21; ++k){
            nxt[i][k] = nxt[nxt[i][k - 1]][k - 1];
        }
    }
    cin >> numQuery;
    for (int i = 1; i <= numQuery; ++i){
        int l, r; cin >> l >> r;
        int ans = 0;
        for (int i = 21; i >= 0; --i){
            if (nxt[l][i] <= r) ans += MASK(i), l = nxt[l][i];
        }
        cout << ans + 1 << '\n';
    }
}


signed main(){
    setupIO();
    int Test = 1;
//    cin >> Test;
    for ( int i = 1 ; i <= Test ; i++ ){
        Whisper();
        if (i < Test) cout << '\n';
    }
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 37716 KB Output is correct
2 Correct 68 ms 41296 KB Output is correct
3 Correct 70 ms 41292 KB Output is correct
4 Correct 67 ms 41556 KB Output is correct
5 Correct 74 ms 41808 KB Output is correct
6 Correct 65 ms 41040 KB Output is correct
7 Correct 68 ms 41280 KB Output is correct
8 Correct 70 ms 41300 KB Output is correct
9 Correct 69 ms 41296 KB Output is correct
10 Correct 75 ms 41312 KB Output is correct
11 Correct 176 ms 53484 KB Output is correct
12 Correct 161 ms 52152 KB Output is correct
13 Correct 160 ms 52052 KB Output is correct
14 Correct 152 ms 47952 KB Output is correct
15 Correct 147 ms 46268 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 77 ms 41556 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4696 KB Output is correct
2 Correct 4 ms 4688 KB Output is correct
3 Correct 3 ms 4700 KB Output is correct
4 Correct 4 ms 4892 KB Output is correct
5 Correct 4 ms 4696 KB Output is correct
6 Correct 4 ms 4700 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 4 ms 4700 KB Output is correct
9 Correct 3 ms 4696 KB Output is correct
10 Correct 4 ms 4700 KB Output is correct
11 Correct 4 ms 4956 KB Output is correct
12 Correct 4 ms 4956 KB Output is correct
13 Correct 4 ms 4956 KB Output is correct
14 Correct 6 ms 4956 KB Output is correct
15 Correct 4 ms 4956 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 4 ms 4700 KB Output is correct

Subtask #3
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 4 ms 4696 KB Output is correct
2 Correct 4 ms 4688 KB Output is correct
3 Correct 3 ms 4700 KB Output is correct
4 Correct 4 ms 4892 KB Output is correct
5 Correct 4 ms 4696 KB Output is correct
6 Correct 4 ms 4700 KB Output is correct
7 Correct 4 ms 4700 KB Output is correct
8 Correct 4 ms 4700 KB Output is correct
9 Correct 3 ms 4696 KB Output is correct
10 Correct 4 ms 4700 KB Output is correct
11 Correct 4 ms 4956 KB Output is correct
12 Correct 4 ms 4956 KB Output is correct
13 Correct 4 ms 4956 KB Output is correct
14 Correct 6 ms 4956 KB Output is correct
15 Correct 4 ms 4956 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 4 ms 4700 KB Output is correct
18 Correct 58 ms 7508 KB Output is correct
19 Correct 56 ms 7248 KB Output is correct
20 Correct 57 ms 7560 KB Output is correct
21 Correct 54 ms 7248 KB Output is correct
22 Correct 58 ms 7368 KB Output is correct
23 Correct 55 ms 7236 KB Output is correct
24 Correct 57 ms 7428 KB Output is correct
25 Correct 55 ms 7504 KB Output is correct
26 Correct 53 ms 7276 KB Output is correct
27 Correct 50 ms 7248 KB Output is correct
28 Correct 38 ms 6992 KB Output is correct
29 Correct 40 ms 7252 KB Output is correct
30 Correct 43 ms 7116 KB Output is correct
31 Correct 40 ms 6980 KB Output is correct
32 Correct 39 ms 7004 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 41 ms 7004 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 77 ms 37992 KB Output is correct
2 Correct 71 ms 41548 KB Output is correct
3 Correct 64 ms 41032 KB Output is correct
4 Correct 65 ms 41208 KB Output is correct
5 Correct 71 ms 41300 KB Output is correct
6 Correct 67 ms 41296 KB Output is correct
7 Correct 71 ms 41404 KB Output is correct
8 Correct 66 ms 41216 KB Output is correct
9 Correct 63 ms 41040 KB Output is correct
10 Correct 71 ms 41552 KB Output is correct
11 Correct 154 ms 52004 KB Output is correct
12 Correct 167 ms 53820 KB Output is correct
13 Correct 156 ms 52052 KB Output is correct
14 Correct 145 ms 46420 KB Output is correct
15 Correct 163 ms 48216 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 69 ms 41292 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 86 ms 37716 KB Output is correct
2 Correct 68 ms 41296 KB Output is correct
3 Correct 70 ms 41292 KB Output is correct
4 Correct 67 ms 41556 KB Output is correct
5 Correct 74 ms 41808 KB Output is correct
6 Correct 65 ms 41040 KB Output is correct
7 Correct 68 ms 41280 KB Output is correct
8 Correct 70 ms 41300 KB Output is correct
9 Correct 69 ms 41296 KB Output is correct
10 Correct 75 ms 41312 KB Output is correct
11 Correct 176 ms 53484 KB Output is correct
12 Correct 161 ms 52152 KB Output is correct
13 Correct 160 ms 52052 KB Output is correct
14 Correct 152 ms 47952 KB Output is correct
15 Correct 147 ms 46268 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 77 ms 41556 KB Output is correct
18 Correct 4 ms 4696 KB Output is correct
19 Correct 4 ms 4688 KB Output is correct
20 Correct 3 ms 4700 KB Output is correct
21 Correct 4 ms 4892 KB Output is correct
22 Correct 4 ms 4696 KB Output is correct
23 Correct 4 ms 4700 KB Output is correct
24 Correct 4 ms 4700 KB Output is correct
25 Correct 4 ms 4700 KB Output is correct
26 Correct 3 ms 4696 KB Output is correct
27 Correct 4 ms 4700 KB Output is correct
28 Correct 4 ms 4956 KB Output is correct
29 Correct 4 ms 4956 KB Output is correct
30 Correct 4 ms 4956 KB Output is correct
31 Correct 6 ms 4956 KB Output is correct
32 Correct 4 ms 4956 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 4 ms 4700 KB Output is correct
35 Correct 58 ms 7508 KB Output is correct
36 Correct 56 ms 7248 KB Output is correct
37 Correct 57 ms 7560 KB Output is correct
38 Correct 54 ms 7248 KB Output is correct
39 Correct 58 ms 7368 KB Output is correct
40 Correct 55 ms 7236 KB Output is correct
41 Correct 57 ms 7428 KB Output is correct
42 Correct 55 ms 7504 KB Output is correct
43 Correct 53 ms 7276 KB Output is correct
44 Correct 50 ms 7248 KB Output is correct
45 Correct 38 ms 6992 KB Output is correct
46 Correct 40 ms 7252 KB Output is correct
47 Correct 43 ms 7116 KB Output is correct
48 Correct 40 ms 6980 KB Output is correct
49 Correct 39 ms 7004 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 41 ms 7004 KB Output is correct
52 Correct 77 ms 37992 KB Output is correct
53 Correct 71 ms 41548 KB Output is correct
54 Correct 64 ms 41032 KB Output is correct
55 Correct 65 ms 41208 KB Output is correct
56 Correct 71 ms 41300 KB Output is correct
57 Correct 67 ms 41296 KB Output is correct
58 Correct 71 ms 41404 KB Output is correct
59 Correct 66 ms 41216 KB Output is correct
60 Correct 63 ms 41040 KB Output is correct
61 Correct 71 ms 41552 KB Output is correct
62 Correct 154 ms 52004 KB Output is correct
63 Correct 167 ms 53820 KB Output is correct
64 Correct 156 ms 52052 KB Output is correct
65 Correct 145 ms 46420 KB Output is correct
66 Correct 163 ms 48216 KB Output is correct
67 Correct 1 ms 2392 KB Output is correct
68 Correct 69 ms 41292 KB Output is correct
69 Correct 231 ms 44884 KB Output is correct
70 Correct 256 ms 45256 KB Output is correct
71 Correct 236 ms 44880 KB Output is correct
72 Correct 236 ms 45112 KB Output is correct
73 Correct 247 ms 44736 KB Output is correct
74 Correct 258 ms 45392 KB Output is correct
75 Correct 310 ms 44888 KB Output is correct
76 Correct 207 ms 45392 KB Output is correct
77 Correct 220 ms 44716 KB Output is correct
78 Correct 169 ms 44972 KB Output is correct
79 Correct 260 ms 56524 KB Output is correct
80 Correct 217 ms 54988 KB Output is correct
81 Correct 216 ms 54916 KB Output is correct
82 Correct 219 ms 49432 KB Output is correct
83 Correct 204 ms 48844 KB Output is correct
84 Correct 1 ms 2396 KB Output is correct
85 Correct 121 ms 44628 KB Output is correct