oj.uz

Submission #1067755

# Submission time Handle Problem Language Result Execution time Memory
1067755 2024-08-21T02:52:02 Z Whisper Fire (BOI24_fire) C++17
100 / 100
 186 ms 79504 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, a) for (int i = 0; i < (a); ++i)
#define REPD(i, a) for (int i = (a) - 1; i >= 0; --i)

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


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

/*
    Phu Trong from Nguyen Tat Thanh High School for gifted student
*/

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;
    }
#define MAX             200005
#define LOG                 20
int nArr, maxTime;

struct Info{
    int l, r;
    Info(){}
    Info(int _l, int _r): l(_l), r(_r){}

    bool operator < (const Info &oth) const{
        if(l != oth.l)
            return l < oth.l;
        return r < oth.r;
    }
} A[MAX];

int up[MAX][LOG], sum[MAX][LOG];

void process(void){
    cin >> nArr >> maxTime;
    for (int i = 1; i <= nArr; ++i){
        cin >> A[i].l >> A[i].r;
        if(A[i].l > A[i].r) A[i].r += maxTime;
    }
    sort(A + 1, A + nArr + 1);

    set<pair<int, int>> mySet;
    int j = 1;
    for (int i = 1; i <= nArr; ++i){
        while (j <= nArr && A[j].l <= A[i].r){
            mySet.insert(make_pair(A[j].r, j));
            ++j;
        }

        pair<int, int> nxt = *mySet.rbegin();
        up[i][0] = nxt.second;
        sum[i][0] = (nxt.first - A[i].r);

        mySet.erase(make_pair(A[i].r, i));
    }

    for (int i = 1; i < LOG; ++i){
        for (int u = 1; u <= nArr; ++u){
            up[u][i] = up[up[u][i - 1]][i - 1];
            sum[u][i] = sum[u][i - 1] + sum[up[u][i - 1]][i - 1];
        }
    }

    int ans = INF;

    for (int i = 1; i <= nArr; ++i){
        int l = i, sm = A[i].r - A[i].l;
        int res = 1;
        for (int j = LOG - 1; j >= 0; --j){
            if(up[l][j] > 0 && sm + sum[l][j] < maxTime){
                sm += sum[l][j];
                res += MASK(j);
                l = up[l][j];
            }
        }
        ++res;
        sm += sum[l][0];
        if (sm >= maxTime){
            minimize(ans, res);
        }
    }
    cout << (ans >= INF ? -1 : ans);
}
signed main(){
    #define name "Whisper"
    cin.tie(nullptr) -> sync_with_stdio(false);
    //freopen(name".inp", "r", stdin);
    //freopen(name".out", "w", stdout);
    process();
    return (0 ^ 0);
}

Subtask #1
14.0 / 14.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 464 KB Output is correct
9 Correct 0 ms 344 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 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 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 0 ms 348 KB Output is correct
21 Correct 0 ms 376 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct

Subtask #2
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 464 KB Output is correct
9 Correct 0 ms 344 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 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 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 0 ms 348 KB Output is correct
21 Correct 0 ms 376 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 1 ms 468 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 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 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct

Subtask #3
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 464 KB Output is correct
9 Correct 0 ms 344 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 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 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 0 ms 348 KB Output is correct
21 Correct 0 ms 376 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 1 ms 468 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 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 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 3 ms 2140 KB Output is correct
40 Correct 2 ms 2140 KB Output is correct
41 Correct 3 ms 2140 KB Output is correct
42 Correct 2 ms 2188 KB Output is correct
43 Correct 3 ms 2396 KB Output is correct
44 Correct 3 ms 2140 KB Output is correct
45 Correct 3 ms 2140 KB Output is correct
46 Correct 3 ms 2140 KB Output is correct
47 Correct 3 ms 2140 KB Output is correct
48 Correct 3 ms 2140 KB Output is correct
49 Correct 2 ms 2140 KB Output is correct
50 Correct 2 ms 2164 KB Output is correct

Subtask #4
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 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 360 KB Output is correct
7 Correct 0 ms 356 KB Output is correct
8 Correct 0 ms 356 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 360 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 352 KB Output is correct
15 Correct 3 ms 2140 KB Output is correct
16 Correct 2 ms 2140 KB Output is correct
17 Correct 3 ms 2396 KB Output is correct
18 Correct 3 ms 2140 KB Output is correct
19 Correct 3 ms 2140 KB Output is correct
20 Correct 131 ms 79504 KB Output is correct
21 Correct 131 ms 69972 KB Output is correct
22 Correct 130 ms 69972 KB Output is correct
23 Correct 115 ms 68956 KB Output is correct
24 Correct 114 ms 69968 KB Output is correct
25 Correct 186 ms 78928 KB Output is correct
26 Correct 113 ms 69968 KB Output is correct
27 Correct 113 ms 70016 KB Output is correct
28 Correct 116 ms 69972 KB Output is correct

Subtask #5
21.0 / 21.0

# Verdict Execution time Memory 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 1 ms 604 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 348 KB Output is correct
11 Correct 0 ms 348 KB Output is correct
12 Correct 3 ms 2112 KB Output is correct
13 Correct 3 ms 2140 KB Output is correct
14 Correct 2 ms 2140 KB Output is correct
15 Correct 126 ms 79444 KB Output is correct
16 Correct 108 ms 69104 KB Output is correct
17 Correct 120 ms 70020 KB Output is correct
18 Correct 132 ms 71252 KB Output is correct
19 Correct 121 ms 69940 KB Output is correct
20 Correct 113 ms 68944 KB Output is correct

Subtask #6
26.0 / 26.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 1 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 464 KB Output is correct
9 Correct 0 ms 344 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 344 KB Output is correct
15 Correct 0 ms 348 KB Output is correct
16 Correct 0 ms 348 KB Output is correct
17 Correct 1 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 0 ms 348 KB Output is correct
21 Correct 0 ms 376 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 1 ms 468 KB Output is correct
27 Correct 1 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 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 0 ms 348 KB Output is correct
34 Correct 0 ms 348 KB Output is correct
35 Correct 0 ms 604 KB Output is correct
36 Correct 0 ms 348 KB Output is correct
37 Correct 0 ms 348 KB Output is correct
38 Correct 0 ms 348 KB Output is correct
39 Correct 3 ms 2140 KB Output is correct
40 Correct 2 ms 2140 KB Output is correct
41 Correct 3 ms 2140 KB Output is correct
42 Correct 2 ms 2188 KB Output is correct
43 Correct 3 ms 2396 KB Output is correct
44 Correct 3 ms 2140 KB Output is correct
45 Correct 3 ms 2140 KB Output is correct
46 Correct 3 ms 2140 KB Output is correct
47 Correct 3 ms 2140 KB Output is correct
48 Correct 3 ms 2140 KB Output is correct
49 Correct 2 ms 2140 KB Output is correct
50 Correct 2 ms 2164 KB Output is correct
51 Correct 0 ms 344 KB Output is correct
52 Correct 0 ms 348 KB Output is correct
53 Correct 0 ms 348 KB Output is correct
54 Correct 0 ms 348 KB Output is correct
55 Correct 0 ms 348 KB Output is correct
56 Correct 0 ms 360 KB Output is correct
57 Correct 0 ms 356 KB Output is correct
58 Correct 0 ms 356 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 360 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 0 ms 348 KB Output is correct
64 Correct 0 ms 352 KB Output is correct
65 Correct 3 ms 2140 KB Output is correct
66 Correct 2 ms 2140 KB Output is correct
67 Correct 3 ms 2396 KB Output is correct
68 Correct 3 ms 2140 KB Output is correct
69 Correct 3 ms 2140 KB Output is correct
70 Correct 131 ms 79504 KB Output is correct
71 Correct 131 ms 69972 KB Output is correct
72 Correct 130 ms 69972 KB Output is correct
73 Correct 115 ms 68956 KB Output is correct
74 Correct 114 ms 69968 KB Output is correct
75 Correct 186 ms 78928 KB Output is correct
76 Correct 113 ms 69968 KB Output is correct
77 Correct 113 ms 70016 KB Output is correct
78 Correct 116 ms 69972 KB Output is correct
79 Correct 0 ms 348 KB Output is correct
80 Correct 0 ms 348 KB Output is correct
81 Correct 0 ms 348 KB Output is correct
82 Correct 0 ms 348 KB Output is correct
83 Correct 0 ms 348 KB Output is correct
84 Correct 1 ms 604 KB Output is correct
85 Correct 0 ms 348 KB Output is correct
86 Correct 0 ms 348 KB Output is correct
87 Correct 0 ms 348 KB Output is correct
88 Correct 0 ms 348 KB Output is correct
89 Correct 0 ms 348 KB Output is correct
90 Correct 3 ms 2112 KB Output is correct
91 Correct 3 ms 2140 KB Output is correct
92 Correct 2 ms 2140 KB Output is correct
93 Correct 126 ms 79444 KB Output is correct
94 Correct 108 ms 69104 KB Output is correct
95 Correct 120 ms 70020 KB Output is correct
96 Correct 132 ms 71252 KB Output is correct
97 Correct 121 ms 69940 KB Output is correct
98 Correct 113 ms 68944 KB Output is correct
99 Correct 122 ms 69900 KB Output is correct
100 Correct 130 ms 69908 KB Output is correct
101 Correct 111 ms 69792 KB Output is correct
102 Correct 112 ms 69980 KB Output is correct
103 Correct 116 ms 70052 KB Output is correct
104 Correct 114 ms 70060 KB Output is correct
105 Correct 94 ms 68688 KB Output is correct