oj.uz

답안 #998334

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
998334 2024-06-13T15:51:20 Z steveonalex Fire (BOI24_fire) C++17
100 / 100
 77 ms 16892 KB 
#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1ULL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

const int N = 2e5 + 69;
const int LOG_N= 18;
const int INF = MASK(LOG_N);

int n, m;
int nxt[LOG_N][N];
int pref[N];

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m;
    vector<pair<int,int>> a(n);
    for(int i = 0; i<n; ++i) {
        int l, r; cin >> l >> r;
        if (l > r) r += m;
        a[i] = {l, r};
    }

    sort(ALL(a));
    pref[0] = 0;
    for(int i = 1; i<n; ++i){
        pref[i] = pref[i-1];
        if (a[pref[i]].second < a[i].second) pref[i] = i;
    }

    for(int i = 0; i<n; ++i){
        int idx = lower_bound(ALL(a), make_pair(a[i].second + 1, -1)) - a.begin() - 1;
        idx = pref[idx];
        nxt[0][i] = idx;
    }
    for(int j = 1; j < LOG_N; ++j) for(int i = 0; i<n; ++i) 
        nxt[j][i] = nxt[j-1][nxt[j-1][i]];
    int ans = INF;
    for(int i = 0; i<n; ++i){   
        int cu = 0;
        int u = i;
        for(int j = LOG_N - 1; j>=0; --j) {
            int v = nxt[j][u];
            if (a[v].second < a[i].first + m) {
                cu += MASK(j);
                u = v;
            }
        }
        minimize(ans, cu + 2);
    }

    if (ans > n) ans = -1;
    cout << ans << "\n";

    return 0;
}

Subtask #1
14.0 / 14.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14744 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 1 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 1 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 1 ms 14684 KB Output is correct
17 Correct 1 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 1 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 1 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14936 KB Output is correct

Subtask #2
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14744 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 1 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 1 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 1 ms 14684 KB Output is correct
17 Correct 1 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 1 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 1 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14936 KB Output is correct
24 Correct 2 ms 14684 KB Output is correct
25 Correct 1 ms 14684 KB Output is correct
26 Correct 3 ms 14684 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 1 ms 14684 KB Output is correct
29 Correct 1 ms 14684 KB Output is correct
30 Correct 1 ms 14684 KB Output is correct
31 Correct 2 ms 14684 KB Output is correct
32 Correct 2 ms 14680 KB Output is correct
33 Correct 1 ms 14684 KB Output is correct
34 Correct 2 ms 14808 KB Output is correct
35 Correct 2 ms 14680 KB Output is correct
36 Correct 1 ms 14680 KB Output is correct
37 Correct 1 ms 14684 KB Output is correct
38 Correct 1 ms 14684 KB Output is correct

Subtask #3
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14744 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 1 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 1 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 1 ms 14684 KB Output is correct
17 Correct 1 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 1 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 1 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14936 KB Output is correct
24 Correct 2 ms 14684 KB Output is correct
25 Correct 1 ms 14684 KB Output is correct
26 Correct 3 ms 14684 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 1 ms 14684 KB Output is correct
29 Correct 1 ms 14684 KB Output is correct
30 Correct 1 ms 14684 KB Output is correct
31 Correct 2 ms 14684 KB Output is correct
32 Correct 2 ms 14680 KB Output is correct
33 Correct 1 ms 14684 KB Output is correct
34 Correct 2 ms 14808 KB Output is correct
35 Correct 2 ms 14680 KB Output is correct
36 Correct 1 ms 14680 KB Output is correct
37 Correct 1 ms 14684 KB Output is correct
38 Correct 1 ms 14684 KB Output is correct
39 Correct 4 ms 14680 KB Output is correct
40 Correct 3 ms 14684 KB Output is correct
41 Correct 3 ms 14680 KB Output is correct
42 Correct 4 ms 14684 KB Output is correct
43 Correct 3 ms 14684 KB Output is correct
44 Correct 3 ms 14684 KB Output is correct
45 Correct 3 ms 14684 KB Output is correct
46 Correct 3 ms 14684 KB Output is correct
47 Correct 3 ms 14684 KB Output is correct
48 Correct 3 ms 14684 KB Output is correct
49 Correct 3 ms 14680 KB Output is correct
50 Correct 3 ms 14684 KB Output is correct

Subtask #4
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 14684 KB Output is correct
2 Correct 2 ms 14684 KB Output is correct
3 Correct 1 ms 14684 KB Output is correct
4 Correct 2 ms 14824 KB Output is correct
5 Correct 1 ms 14684 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 1 ms 14684 KB Output is correct
10 Correct 2 ms 14680 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 2 ms 14680 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 1 ms 14684 KB Output is correct
15 Correct 3 ms 14884 KB Output is correct
16 Correct 3 ms 14684 KB Output is correct
17 Correct 2 ms 14684 KB Output is correct
18 Correct 3 ms 14684 KB Output is correct
19 Correct 4 ms 14868 KB Output is correct
20 Correct 38 ms 16884 KB Output is correct
21 Correct 59 ms 16720 KB Output is correct
22 Correct 59 ms 16724 KB Output is correct
23 Correct 57 ms 16724 KB Output is correct
24 Correct 58 ms 16724 KB Output is correct
25 Correct 61 ms 16812 KB Output is correct
26 Correct 60 ms 16720 KB Output is correct
27 Correct 57 ms 16724 KB Output is correct
28 Correct 57 ms 16884 KB Output is correct

Subtask #5
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 1 ms 14684 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14684 KB Output is correct
6 Correct 2 ms 14680 KB Output is correct
7 Correct 1 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 2 ms 14684 KB Output is correct
12 Correct 3 ms 14880 KB Output is correct
13 Correct 2 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 34 ms 16820 KB Output is correct
16 Correct 53 ms 16724 KB Output is correct
17 Correct 56 ms 16720 KB Output is correct
18 Correct 62 ms 16884 KB Output is correct
19 Correct 57 ms 16720 KB Output is correct
20 Correct 58 ms 16792 KB Output is correct

Subtask #6
26.0 / 26.0

# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 14680 KB Output is correct
2 Correct 1 ms 14684 KB Output is correct
3 Correct 2 ms 14684 KB Output is correct
4 Correct 1 ms 14684 KB Output is correct
5 Correct 1 ms 14744 KB Output is correct
6 Correct 2 ms 14684 KB Output is correct
7 Correct 2 ms 14684 KB Output is correct
8 Correct 1 ms 14684 KB Output is correct
9 Correct 2 ms 14684 KB Output is correct
10 Correct 2 ms 14684 KB Output is correct
11 Correct 1 ms 14684 KB Output is correct
12 Correct 2 ms 14684 KB Output is correct
13 Correct 1 ms 14684 KB Output is correct
14 Correct 2 ms 14684 KB Output is correct
15 Correct 2 ms 14684 KB Output is correct
16 Correct 1 ms 14684 KB Output is correct
17 Correct 1 ms 14684 KB Output is correct
18 Correct 2 ms 14684 KB Output is correct
19 Correct 1 ms 14684 KB Output is correct
20 Correct 2 ms 14684 KB Output is correct
21 Correct 1 ms 14684 KB Output is correct
22 Correct 2 ms 14684 KB Output is correct
23 Correct 2 ms 14936 KB Output is correct
24 Correct 2 ms 14684 KB Output is correct
25 Correct 1 ms 14684 KB Output is correct
26 Correct 3 ms 14684 KB Output is correct
27 Correct 2 ms 14684 KB Output is correct
28 Correct 1 ms 14684 KB Output is correct
29 Correct 1 ms 14684 KB Output is correct
30 Correct 1 ms 14684 KB Output is correct
31 Correct 2 ms 14684 KB Output is correct
32 Correct 2 ms 14680 KB Output is correct
33 Correct 1 ms 14684 KB Output is correct
34 Correct 2 ms 14808 KB Output is correct
35 Correct 2 ms 14680 KB Output is correct
36 Correct 1 ms 14680 KB Output is correct
37 Correct 1 ms 14684 KB Output is correct
38 Correct 1 ms 14684 KB Output is correct
39 Correct 4 ms 14680 KB Output is correct
40 Correct 3 ms 14684 KB Output is correct
41 Correct 3 ms 14680 KB Output is correct
42 Correct 4 ms 14684 KB Output is correct
43 Correct 3 ms 14684 KB Output is correct
44 Correct 3 ms 14684 KB Output is correct
45 Correct 3 ms 14684 KB Output is correct
46 Correct 3 ms 14684 KB Output is correct
47 Correct 3 ms 14684 KB Output is correct
48 Correct 3 ms 14684 KB Output is correct
49 Correct 3 ms 14680 KB Output is correct
50 Correct 3 ms 14684 KB Output is correct
51 Correct 1 ms 14684 KB Output is correct
52 Correct 2 ms 14684 KB Output is correct
53 Correct 1 ms 14684 KB Output is correct
54 Correct 2 ms 14824 KB Output is correct
55 Correct 1 ms 14684 KB Output is correct
56 Correct 2 ms 14684 KB Output is correct
57 Correct 1 ms 14684 KB Output is correct
58 Correct 1 ms 14684 KB Output is correct
59 Correct 1 ms 14684 KB Output is correct
60 Correct 2 ms 14680 KB Output is correct
61 Correct 2 ms 14684 KB Output is correct
62 Correct 2 ms 14680 KB Output is correct
63 Correct 2 ms 14684 KB Output is correct
64 Correct 1 ms 14684 KB Output is correct
65 Correct 3 ms 14884 KB Output is correct
66 Correct 3 ms 14684 KB Output is correct
67 Correct 2 ms 14684 KB Output is correct
68 Correct 3 ms 14684 KB Output is correct
69 Correct 4 ms 14868 KB Output is correct
70 Correct 38 ms 16884 KB Output is correct
71 Correct 59 ms 16720 KB Output is correct
72 Correct 59 ms 16724 KB Output is correct
73 Correct 57 ms 16724 KB Output is correct
74 Correct 58 ms 16724 KB Output is correct
75 Correct 61 ms 16812 KB Output is correct
76 Correct 60 ms 16720 KB Output is correct
77 Correct 57 ms 16724 KB Output is correct
78 Correct 57 ms 16884 KB Output is correct
79 Correct 2 ms 14680 KB Output is correct
80 Correct 1 ms 14684 KB Output is correct
81 Correct 1 ms 14684 KB Output is correct
82 Correct 1 ms 14684 KB Output is correct
83 Correct 1 ms 14684 KB Output is correct
84 Correct 2 ms 14680 KB Output is correct
85 Correct 1 ms 14684 KB Output is correct
86 Correct 1 ms 14684 KB Output is correct
87 Correct 2 ms 14684 KB Output is correct
88 Correct 2 ms 14684 KB Output is correct
89 Correct 2 ms 14684 KB Output is correct
90 Correct 3 ms 14880 KB Output is correct
91 Correct 2 ms 14684 KB Output is correct
92 Correct 2 ms 14684 KB Output is correct
93 Correct 34 ms 16820 KB Output is correct
94 Correct 53 ms 16724 KB Output is correct
95 Correct 56 ms 16720 KB Output is correct
96 Correct 62 ms 16884 KB Output is correct
97 Correct 57 ms 16720 KB Output is correct
98 Correct 58 ms 16792 KB Output is correct
99 Correct 57 ms 16892 KB Output is correct
100 Correct 59 ms 16724 KB Output is correct
101 Correct 56 ms 16724 KB Output is correct
102 Correct 64 ms 16724 KB Output is correct
103 Correct 77 ms 16724 KB Output is correct
104 Correct 58 ms 16724 KB Output is correct
105 Correct 41 ms 16720 KB Output is correct