oj.uz

Submission #1093443

# Submission time Handle Problem Language Result Execution time Memory
1093443 2024-09-26T19:59:33 Z Tymond Fire (BOI24_fire) C++17
100 / 100
 216 ms 50916 KB 
#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
#define fi first
#define se second
#define vi vector<int>
#define vll vector<long long>
#define pii pair<int, int>
#define pll pair<long long, long long>
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
mt19937_64 rng64(chrono::steady_clock::now().time_since_epoch().count());
inline int rand(int l,int r){return uniform_int_distribution<int>(l, r)(rng);}
inline ll rand(ll l,ll r){return uniform_int_distribution<ll>(l, r)(rng64);}
#ifdef DEBUG
auto&operator<<(auto&o,pair<auto,auto>p){return o<<"("<<p.first<<", "<<p.second<<")";}
auto operator<<(auto&o,auto x)->decltype(x.end(),o){o<<"{";int i=0;for(auto e:x)o<<","+!i++<<e;return o<<"}";}
#define debug(X...)cerr<<"["#X"]: ",[](auto...$){((cerr<<$<<"; "),...)<<endl;}(X)
#else
#define debug(...){}
#endif
 
struct custom_hash {
    static uint64_t splitmix64(uint64_t x) {
        x += 0x9e3779b97f4a7c15;
        x = (x ^ (x >> 30)) * 0xbf58476d1ce4e5b9;
        x = (x ^ (x >> 27)) * 0x94d049bb133111eb;
        return x ^ (x >> 31);
    }
 
    size_t operator()(uint64_t x) const {
        static const uint64_t FIXED_RANDOM = chrono::steady_clock::now().time_since_epoch().count();
        return splitmix64(x + FIXED_RANDOM);
    }
};

struct Info{
    ll ind, blokSz, blokMod, val;
    Info(ll nind, ll nb, ll nm, ll nv){
        ind = nind;
        blokSz = nb;
        blokMod = nm;
        val = nv;
    }
};

const int MAXN = 5e5 + 7;
const int MAXK = 20;
const int BASE = (1 << 19);
pii tree[2 * BASE + 7];
int p[MAXN];
int e[MAXN];
int nxt[MAXN];
int jump[MAXK][MAXN];
pii mx[MAXN];
int n, m;

void init(){
    for(int i = 1; i <= n; i++){
        tree[i + BASE] = {e[i], i};
    }

    for(int i = BASE - 1; i >= 1; i--){
        if(tree[2 * i].fi >= tree[2 * i + 1].fi){
            tree[i] = tree[2 * i];
        }else{
            tree[i] = tree[2 * i + 1];
        }
    }
}

pii query(int v, int l, int r, int a, int b){
    if(r < a || b < l){
        return mp(0, 0);
    }

    if(a <= l && r <= b){
        return tree[v];
    }

    int mid = (l + r) / 2;
    pii r1 = query(2 * v, l, mid, a, b);
    pii r2 = query(2 * v + 1, mid + 1, r, a, b);
    if(r1.fi >= r2.fi){
        return r1;
    }
    return r2;
}
int main(){
    ios_base::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

    cin >> n >> m;
    vector<pii> vec;
    for(int i = 1; i <= n; i++){
        cin >> p[i] >> e[i];
        if(p[i] < e[i]){
            vec.pb({p[i], e[i]});
            vec.pb({p[i] + m, e[i] + m});
        }else{
            vec.pb({p[i], e[i] + m});
            vec.pb({p[i] + m, e[i] + 2 * m});
        }
    }

    n *= 2;
    sort(all(vec));
    //cerr << sz(vec) << ' ' << n << '\n';
    for(int i = 1; i <= n; i++){
        p[i] = vec[i - 1].fi;
        e[i] = vec[i - 1].se;
    }
    //cerr << "NIGGA\n";
    init();
    nxt[n] = n;
    /*cout << "-------\n";
    for(int i = 1; i <= n; i++){
        cout << p[i] << ' ' << e[i] << '\n';
    }*/
    for(int i = n - 1; i >= 1; i--){
        if(p[i + 1] > e[i]){
            nxt[i] = i;
            continue;
        }
        //cout << "----\n";
        int l = i + 1;
        int hi = n;
        int s;
        while(l < hi){
            //cout << l << ' ' << hi << '\n';
            s = (l + hi + 1) / 2;
            if(p[s] <= e[i]){
                l = s;
            }else{
                hi = s - 1;
            }
        }
        //cout<< i << ' ' << l << '\n';
        pii r = query(1, 0, BASE - 1, i + 1, l);
        nxt[i] = r.se;
    }

    for(int i = 1; i <= n; i++){
        jump[0][i] = nxt[i];
    }

    for(int j = 1; j < MAXK; j++){
        for(int i = 1; i <= n; i++){
            jump[j][i] = jump[j - 1][jump[j - 1][i]];
        }
    }

   // cout << "----\n";

    int ans = (int)1e9;
    for(int i = 1; i <= n; i++){
        if(e[jump[MAXK - 1][i]] - p[i] < m){
            continue;
        }

        //cout << "--\n";
        //cout << i << ' ' << nxt[i] << '\n';
        int r = 1;
        int v = i;
        for(int j = MAXK - 1; j >= 0; j--){
            if(e[jump[j][v]] - p[i] < m){
                r += (1 << j);
                v = jump[j][v];
            }
        }
        r++;
        //cout << v << ' ' << r<< '\n';
        ans = min(ans, r);
    }

    if(ans == (int)1e9){
        cout << -1 << '\n';
    }else{
        cout << ans << '\n';
    }

    return 0;
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 2 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct
16 Correct 3 ms 4712 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 3 ms 4696 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4620 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 2 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 2 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct
16 Correct 3 ms 4712 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 3 ms 4696 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4620 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 2 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 3 ms 4700 KB Output is correct
25 Correct 3 ms 4700 KB Output is correct
26 Correct 3 ms 4700 KB Output is correct
27 Correct 3 ms 4952 KB Output is correct
28 Correct 3 ms 4700 KB Output is correct
29 Correct 3 ms 4820 KB Output is correct
30 Correct 3 ms 4700 KB Output is correct
31 Correct 3 ms 4700 KB Output is correct
32 Correct 3 ms 4832 KB Output is correct
33 Correct 3 ms 4696 KB Output is correct
34 Correct 3 ms 4700 KB Output is correct
35 Correct 2 ms 4700 KB Output is correct
36 Correct 3 ms 4700 KB Output is correct
37 Correct 3 ms 4700 KB Output is correct
38 Correct 3 ms 4824 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 2 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct
16 Correct 3 ms 4712 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 3 ms 4696 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4620 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 2 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 3 ms 4700 KB Output is correct
25 Correct 3 ms 4700 KB Output is correct
26 Correct 3 ms 4700 KB Output is correct
27 Correct 3 ms 4952 KB Output is correct
28 Correct 3 ms 4700 KB Output is correct
29 Correct 3 ms 4820 KB Output is correct
30 Correct 3 ms 4700 KB Output is correct
31 Correct 3 ms 4700 KB Output is correct
32 Correct 3 ms 4832 KB Output is correct
33 Correct 3 ms 4696 KB Output is correct
34 Correct 3 ms 4700 KB Output is correct
35 Correct 2 ms 4700 KB Output is correct
36 Correct 3 ms 4700 KB Output is correct
37 Correct 3 ms 4700 KB Output is correct
38 Correct 3 ms 4824 KB Output is correct
39 Correct 6 ms 5980 KB Output is correct
40 Correct 5 ms 5980 KB Output is correct
41 Correct 6 ms 5980 KB Output is correct
42 Correct 5 ms 5980 KB Output is correct
43 Correct 7 ms 5856 KB Output is correct
44 Correct 6 ms 5980 KB Output is correct
45 Correct 6 ms 5980 KB Output is correct
46 Correct 6 ms 6000 KB Output is correct
47 Correct 5 ms 5980 KB Output is correct
48 Correct 5 ms 5980 KB Output is correct
49 Correct 4 ms 5980 KB Output is correct
50 Correct 5 ms 5980 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 4700 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 3 ms 4700 KB Output is correct
4 Correct 2 ms 4568 KB Output is correct
5 Correct 3 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 2 ms 4696 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 3 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 3 ms 4700 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 6 ms 5980 KB Output is correct
16 Correct 5 ms 5980 KB Output is correct
17 Correct 7 ms 5812 KB Output is correct
18 Correct 6 ms 5976 KB Output is correct
19 Correct 5 ms 5980 KB Output is correct
20 Correct 139 ms 47804 KB Output is correct
21 Correct 173 ms 50824 KB Output is correct
22 Correct 177 ms 50880 KB Output is correct
23 Correct 135 ms 49852 KB Output is correct
24 Correct 158 ms 50880 KB Output is correct
25 Correct 216 ms 50132 KB Output is correct
26 Correct 149 ms 50888 KB Output is correct
27 Correct 136 ms 50880 KB Output is correct
28 Correct 130 ms 50876 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 3 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 2 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 3 ms 4700 KB Output is correct
7 Correct 3 ms 4700 KB Output is correct
8 Correct 3 ms 4700 KB Output is correct
9 Correct 3 ms 4700 KB Output is correct
10 Correct 4 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 6 ms 5980 KB Output is correct
13 Correct 5 ms 5980 KB Output is correct
14 Correct 5 ms 5980 KB Output is correct
15 Correct 138 ms 47704 KB Output is correct
16 Correct 135 ms 49856 KB Output is correct
17 Correct 169 ms 50864 KB Output is correct
18 Correct 194 ms 50912 KB Output is correct
19 Correct 150 ms 50876 KB Output is correct
20 Correct 160 ms 49852 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 4696 KB Output is correct
2 Correct 2 ms 4700 KB Output is correct
3 Correct 2 ms 4700 KB Output is correct
4 Correct 3 ms 4700 KB Output is correct
5 Correct 2 ms 4700 KB Output is correct
6 Correct 2 ms 4700 KB Output is correct
7 Correct 2 ms 4700 KB Output is correct
8 Correct 2 ms 4700 KB Output is correct
9 Correct 2 ms 4700 KB Output is correct
10 Correct 2 ms 4700 KB Output is correct
11 Correct 3 ms 4700 KB Output is correct
12 Correct 2 ms 4700 KB Output is correct
13 Correct 2 ms 4700 KB Output is correct
14 Correct 2 ms 4700 KB Output is correct
15 Correct 2 ms 4700 KB Output is correct
16 Correct 3 ms 4712 KB Output is correct
17 Correct 2 ms 4700 KB Output is correct
18 Correct 3 ms 4696 KB Output is correct
19 Correct 2 ms 4700 KB Output is correct
20 Correct 2 ms 4620 KB Output is correct
21 Correct 2 ms 4700 KB Output is correct
22 Correct 2 ms 4700 KB Output is correct
23 Correct 2 ms 4700 KB Output is correct
24 Correct 3 ms 4700 KB Output is correct
25 Correct 3 ms 4700 KB Output is correct
26 Correct 3 ms 4700 KB Output is correct
27 Correct 3 ms 4952 KB Output is correct
28 Correct 3 ms 4700 KB Output is correct
29 Correct 3 ms 4820 KB Output is correct
30 Correct 3 ms 4700 KB Output is correct
31 Correct 3 ms 4700 KB Output is correct
32 Correct 3 ms 4832 KB Output is correct
33 Correct 3 ms 4696 KB Output is correct
34 Correct 3 ms 4700 KB Output is correct
35 Correct 2 ms 4700 KB Output is correct
36 Correct 3 ms 4700 KB Output is correct
37 Correct 3 ms 4700 KB Output is correct
38 Correct 3 ms 4824 KB Output is correct
39 Correct 6 ms 5980 KB Output is correct
40 Correct 5 ms 5980 KB Output is correct
41 Correct 6 ms 5980 KB Output is correct
42 Correct 5 ms 5980 KB Output is correct
43 Correct 7 ms 5856 KB Output is correct
44 Correct 6 ms 5980 KB Output is correct
45 Correct 6 ms 5980 KB Output is correct
46 Correct 6 ms 6000 KB Output is correct
47 Correct 5 ms 5980 KB Output is correct
48 Correct 5 ms 5980 KB Output is correct
49 Correct 4 ms 5980 KB Output is correct
50 Correct 5 ms 5980 KB Output is correct
51 Correct 2 ms 4700 KB Output is correct
52 Correct 2 ms 4700 KB Output is correct
53 Correct 3 ms 4700 KB Output is correct
54 Correct 2 ms 4568 KB Output is correct
55 Correct 3 ms 4700 KB Output is correct
56 Correct 2 ms 4700 KB Output is correct
57 Correct 2 ms 4696 KB Output is correct
58 Correct 3 ms 4700 KB Output is correct
59 Correct 3 ms 4700 KB Output is correct
60 Correct 3 ms 4700 KB Output is correct
61 Correct 3 ms 4700 KB Output is correct
62 Correct 2 ms 4700 KB Output is correct
63 Correct 3 ms 4700 KB Output is correct
64 Correct 2 ms 4700 KB Output is correct
65 Correct 6 ms 5980 KB Output is correct
66 Correct 5 ms 5980 KB Output is correct
67 Correct 7 ms 5812 KB Output is correct
68 Correct 6 ms 5976 KB Output is correct
69 Correct 5 ms 5980 KB Output is correct
70 Correct 139 ms 47804 KB Output is correct
71 Correct 173 ms 50824 KB Output is correct
72 Correct 177 ms 50880 KB Output is correct
73 Correct 135 ms 49852 KB Output is correct
74 Correct 158 ms 50880 KB Output is correct
75 Correct 216 ms 50132 KB Output is correct
76 Correct 149 ms 50888 KB Output is correct
77 Correct 136 ms 50880 KB Output is correct
78 Correct 130 ms 50876 KB Output is correct
79 Correct 3 ms 4696 KB Output is correct
80 Correct 3 ms 4700 KB Output is correct
81 Correct 2 ms 4700 KB Output is correct
82 Correct 2 ms 4700 KB Output is correct
83 Correct 2 ms 4700 KB Output is correct
84 Correct 3 ms 4700 KB Output is correct
85 Correct 3 ms 4700 KB Output is correct
86 Correct 3 ms 4700 KB Output is correct
87 Correct 3 ms 4700 KB Output is correct
88 Correct 4 ms 4700 KB Output is correct
89 Correct 3 ms 4700 KB Output is correct
90 Correct 6 ms 5980 KB Output is correct
91 Correct 5 ms 5980 KB Output is correct
92 Correct 5 ms 5980 KB Output is correct
93 Correct 138 ms 47704 KB Output is correct
94 Correct 135 ms 49856 KB Output is correct
95 Correct 169 ms 50864 KB Output is correct
96 Correct 194 ms 50912 KB Output is correct
97 Correct 150 ms 50876 KB Output is correct
98 Correct 160 ms 49852 KB Output is correct
99 Correct 155 ms 50752 KB Output is correct
100 Correct 193 ms 50912 KB Output is correct
101 Correct 139 ms 50880 KB Output is correct
102 Correct 138 ms 50916 KB Output is correct
103 Correct 137 ms 50900 KB Output is correct
104 Correct 108 ms 50888 KB Output is correct
105 Correct 90 ms 49660 KB Output is correct