oj.uz

Submission #933245

# Submission time Handle Problem Language Result Execution time Memory
933245 2024-02-25T10:04:40 Z Whisper Osumnjičeni (COCI21_osumnjiceni) C++17
110 / 110
 262 ms 50676 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 66 ms 37712 KB Output is correct
2 Correct 68 ms 37724 KB Output is correct
3 Correct 66 ms 37724 KB Output is correct
4 Correct 65 ms 37712 KB Output is correct
5 Correct 70 ms 37972 KB Output is correct
6 Correct 63 ms 37596 KB Output is correct
7 Correct 65 ms 37772 KB Output is correct
8 Correct 65 ms 37716 KB Output is correct
9 Correct 67 ms 37712 KB Output is correct
10 Correct 68 ms 37716 KB Output is correct
11 Correct 178 ms 50004 KB Output is correct
12 Correct 167 ms 49172 KB Output is correct
13 Correct 162 ms 48980 KB Output is correct
14 Correct 156 ms 44740 KB Output is correct
15 Correct 146 ms 42924 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 68 ms 37716 KB Output is correct

Subtask #2
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4700 KB Output is correct
2 Correct 3 ms 4700 KB Output is correct
3 Correct 4 ms 4696 KB Output is correct
4 Correct 4 ms 4700 KB Output is correct
5 Correct 3 ms 4700 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 4 ms 4700 KB Output is correct
10 Correct 3 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 4 ms 4700 KB Output is correct
15 Correct 4 ms 4700 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 3 ms 4700 KB Output is correct
2 Correct 3 ms 4700 KB Output is correct
3 Correct 4 ms 4696 KB Output is correct
4 Correct 4 ms 4700 KB Output is correct
5 Correct 3 ms 4700 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 4 ms 4700 KB Output is correct
10 Correct 3 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 4 ms 4700 KB Output is correct
15 Correct 4 ms 4700 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 4 ms 4700 KB Output is correct
18 Correct 57 ms 5840 KB Output is correct
19 Correct 51 ms 5456 KB Output is correct
20 Correct 58 ms 5616 KB Output is correct
21 Correct 54 ms 5300 KB Output is correct
22 Correct 64 ms 5460 KB Output is correct
23 Correct 57 ms 5536 KB Output is correct
24 Correct 55 ms 5456 KB Output is correct
25 Correct 58 ms 5460 KB Output is correct
26 Correct 51 ms 5364 KB Output is correct
27 Correct 48 ms 5200 KB Output is correct
28 Correct 37 ms 5212 KB Output is correct
29 Correct 40 ms 5208 KB Output is correct
30 Correct 39 ms 5204 KB Output is correct
31 Correct 39 ms 5068 KB Output is correct
32 Correct 39 ms 5212 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 40 ms 5724 KB Output is correct

Subtask #4
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 69 ms 37964 KB Output is correct
2 Correct 69 ms 37736 KB Output is correct
3 Correct 68 ms 37584 KB Output is correct
4 Correct 62 ms 37716 KB Output is correct
5 Correct 64 ms 37712 KB Output is correct
6 Correct 64 ms 37712 KB Output is correct
7 Correct 63 ms 37716 KB Output is correct
8 Correct 64 ms 37712 KB Output is correct
9 Correct 63 ms 37720 KB Output is correct
10 Correct 71 ms 37712 KB Output is correct
11 Correct 161 ms 48972 KB Output is correct
12 Correct 183 ms 50516 KB Output is correct
13 Correct 160 ms 48980 KB Output is correct
14 Correct 155 ms 43604 KB Output is correct
15 Correct 157 ms 44884 KB Output is correct
16 Correct 1 ms 2396 KB Output is correct
17 Correct 68 ms 37720 KB Output is correct

Subtask #5
50.0 / 50.0

# Verdict Execution time Memory Grader output
1 Correct 66 ms 37712 KB Output is correct
2 Correct 68 ms 37724 KB Output is correct
3 Correct 66 ms 37724 KB Output is correct
4 Correct 65 ms 37712 KB Output is correct
5 Correct 70 ms 37972 KB Output is correct
6 Correct 63 ms 37596 KB Output is correct
7 Correct 65 ms 37772 KB Output is correct
8 Correct 65 ms 37716 KB Output is correct
9 Correct 67 ms 37712 KB Output is correct
10 Correct 68 ms 37716 KB Output is correct
11 Correct 178 ms 50004 KB Output is correct
12 Correct 167 ms 49172 KB Output is correct
13 Correct 162 ms 48980 KB Output is correct
14 Correct 156 ms 44740 KB Output is correct
15 Correct 146 ms 42924 KB Output is correct
16 Correct 1 ms 2392 KB Output is correct
17 Correct 68 ms 37716 KB Output is correct
18 Correct 3 ms 4700 KB Output is correct
19 Correct 3 ms 4700 KB Output is correct
20 Correct 4 ms 4696 KB Output is correct
21 Correct 4 ms 4700 KB Output is correct
22 Correct 3 ms 4700 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 4 ms 4700 KB Output is correct
27 Correct 3 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 4 ms 4700 KB Output is correct
32 Correct 4 ms 4700 KB Output is correct
33 Correct 1 ms 2396 KB Output is correct
34 Correct 4 ms 4700 KB Output is correct
35 Correct 57 ms 5840 KB Output is correct
36 Correct 51 ms 5456 KB Output is correct
37 Correct 58 ms 5616 KB Output is correct
38 Correct 54 ms 5300 KB Output is correct
39 Correct 64 ms 5460 KB Output is correct
40 Correct 57 ms 5536 KB Output is correct
41 Correct 55 ms 5456 KB Output is correct
42 Correct 58 ms 5460 KB Output is correct
43 Correct 51 ms 5364 KB Output is correct
44 Correct 48 ms 5200 KB Output is correct
45 Correct 37 ms 5212 KB Output is correct
46 Correct 40 ms 5208 KB Output is correct
47 Correct 39 ms 5204 KB Output is correct
48 Correct 39 ms 5068 KB Output is correct
49 Correct 39 ms 5212 KB Output is correct
50 Correct 1 ms 2396 KB Output is correct
51 Correct 40 ms 5724 KB Output is correct
52 Correct 69 ms 37964 KB Output is correct
53 Correct 69 ms 37736 KB Output is correct
54 Correct 68 ms 37584 KB Output is correct
55 Correct 62 ms 37716 KB Output is correct
56 Correct 64 ms 37712 KB Output is correct
57 Correct 64 ms 37712 KB Output is correct
58 Correct 63 ms 37716 KB Output is correct
59 Correct 64 ms 37712 KB Output is correct
60 Correct 63 ms 37720 KB Output is correct
61 Correct 71 ms 37712 KB Output is correct
62 Correct 161 ms 48972 KB Output is correct
63 Correct 183 ms 50516 KB Output is correct
64 Correct 160 ms 48980 KB Output is correct
65 Correct 155 ms 43604 KB Output is correct
66 Correct 157 ms 44884 KB Output is correct
67 Correct 1 ms 2396 KB Output is correct
68 Correct 68 ms 37720 KB Output is correct
69 Correct 232 ms 38812 KB Output is correct
70 Correct 261 ms 39036 KB Output is correct
71 Correct 212 ms 38740 KB Output is correct
72 Correct 212 ms 38900 KB Output is correct
73 Correct 233 ms 38736 KB Output is correct
74 Correct 262 ms 39060 KB Output is correct
75 Correct 228 ms 38736 KB Output is correct
76 Correct 217 ms 39504 KB Output is correct
77 Correct 173 ms 38736 KB Output is correct
78 Correct 165 ms 38744 KB Output is correct
79 Correct 245 ms 50676 KB Output is correct
80 Correct 212 ms 49492 KB Output is correct
81 Correct 215 ms 49488 KB Output is correct
82 Correct 199 ms 43644 KB Output is correct
83 Correct 195 ms 43608 KB Output is correct
84 Correct 1 ms 2396 KB Output is correct
85 Correct 132 ms 39036 KB Output is correct