oj.uz

Submission #1034823

# Submission time Handle Problem Language Result Execution time Memory
1034823 2024-07-25T19:13:33 Z RecursiveCo Fire (BOI24_fire) C++17
100 / 100
 353 ms 73148 KB 
// CF template, version 3.0

#include <bits/stdc++.h>

using namespace std;

#define improvePerformance ios_base::sync_with_stdio(false); cin.tie(0)
#define getTest int t; cin >> t
#define eachTest for (int _var=0;_var<t;_var++)
#define get(name) int (name); cin >> (name)
#define out(o) cout << (o)
#define getList(cnt, name) vector<int> (name); for (int _=0;_<(cnt);_++) { get(a); (name).push_back(a); }
#define sortl(name) sort((name).begin(), (name).end())
#define rev(name) reverse((name).begin(), (name).end())
#define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
#define decision(b) if (b){out("YES");}else{out("NO");}

//#define int long long int

template <typename T, typename I>
struct segtree {
    int n;
    vector<T> tree;
    vector<I> initial;
    T id;

    segtree(int i_n, vector<I> i_initial, T i_id): n(i_n), initial(i_initial), id(i_id) {
        tree.resize(4 * n);
    }

    T conquer(T left, T right) {
        // write your conquer function
    }

    T value(I inp) {
        // write your value function
    }

    void build(int v, int l, int r) {
        if (l == r) tree[v] = value(initial[l]);
        else {
            int middle = (l + r) / 2;
            build(2 * v, l, middle);
            build(2 * v + 1, middle + 1, r);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    void upd(int v, int l, int r, int i, I x) {
        if (l == r) tree[v] = value(x);
        else {
            int middle = (l + r) / 2;
            if (middle >= i) upd(2 * v, l, middle, i, x);
            else upd(2 * v + 1, middle + 1, r, i, x);
            tree[v] = conquer(tree[2 * v], tree[2 * v + 1]);
        }
    }

    T query(int v, int l, int r, int ql, int qr) {
        if (ql <= l && r <= qr) return tree[v];
        else if (r < ql || qr < l) return id;
        int middle = (l + r) / 2;
        T left = query(2 * v, l, middle, ql, qr);
        T right = query(2 * v + 1, middle + 1, r, ql, qr);
        return conquer(left, right);
    }
};

// vector<int>

vector<vector<int>> lift;
vector<int> go;

int calc(int l, int r) {
    int d = l;
    bool extra = go[r] == r;
    int ret = 0;

    int i = 19;
    int p = 524288;
    while (i >= 0) {
        int dest = lift[d][i];
        if (dest <= r - extra) {
            d = dest;
            ret += p;
        }
        i--;
        p /= 2;
    }
    if (d < r) d = go[d], ret++;
    /*out(l);
    out(" ");
    out(r);
    out(" ");
    out(d);
    out(endl);*/
    if (d >= r) return ret;
    return 1e9;
}

signed main() {
    improvePerformance;
    //getTest;
    
    //eachTest {
        get(n);
        get(m);
        vector<pair<int, int>> ranges;
        vector<pair<int, int>> wraps;
        vector<int> vals;
        int r = 0;
        int w = 0;
        forto(n, i) {
            get(s);
            get(e);
            vals.push_back(s);
            vals.push_back(e);
            if (s < e) ranges.push_back({s, e}), r++;
            else wraps.push_back({e, s}), w++;
        }
        vals.push_back(0);
        vals.push_back(m - 1);
        map<int, int> coords;
        sortl(vals);
        int ind = 0;
        int s = vals.size();
        forto(s, i) {
            if (i == 0 || vals[i] != vals[i - 1]) coords[vals[i]] = ind++;
        }
        int N = ind;
        forto(r, i) {
            ranges[i].first = coords[ranges[i].first];
            ranges[i].second = coords[ranges[i].second];
        }
        forto(w, i) {
            wraps[i].first = coords[wraps[i].first];
            wraps[i].second = coords[wraps[i].second];
        }
        int maxwrap = 0;
        forto(w, i) maxwrap = max(maxwrap, wraps[i].first);
        int minwrap = N;
        forto(w, i) minwrap = min(minwrap, wraps[i].second);
        sortl(ranges);
        go.resize(N);
        int maxi = 0;
        int ptr = 0;
        forto(N, i) {
            while (ptr < r && ranges[ptr].first <= i) maxi = max(maxi, ranges[ptr++].second);
            maxi = max(maxi, i);
            go[i] = maxi;
        }
        lift.resize(N, vector<int>(20));
        for (int i = N - 1; i >= 0; i--) {
            lift[i][0] = go[i];
            forto(20, j) {
                if (j == 0) continue;
                lift[i][j] = lift[lift[i][j - 1]][j - 1];
            }
        }
        int ans = 1e9;
        int onlyrng = 0;
        ind = 0;
        while (ind < N && go[ind] != ind) onlyrng++, ind = go[ind];
        if (go[ind] != ind) ans = min(ans, onlyrng);
        sortl(wraps);
        rev(wraps);
        int indone = N;
        ptr = 0;
        for (int i = maxwrap; i >= 0; i--) {
            int two = calc(i, minwrap) + 2;
            while (ptr < w && wraps[ptr].first >= i) indone = min(indone, wraps[ptr++].second);
            int one = calc(i, indone) + 1;
            ans = min({ans, one, two});
        }
        if (ans == 1e9) out(-1);
        else out(ans);
    //}
}

Compilation message

Main.cpp: In function 'int main()':
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'n' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:106:9: note: in expansion of macro 'get'
  106 |         get(n);
      |         ^~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'm' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:107:9: note: in expansion of macro 'get'
  107 |         get(m);
      |         ^~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:113:9: note: in expansion of macro 'forto'
  113 |         forto(n, i) {
      |         ^~~~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 's' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:114:13: note: in expansion of macro 'get'
  114 |             get(s);
      |             ^~~
Main.cpp:10:23: warning: unnecessary parentheses in declaration of 'e' [-Wparentheses]
   10 | #define get(name) int (name); cin >> (name)
      |                       ^
Main.cpp:115:13: note: in expansion of macro 'get'
  115 |             get(e);
      |             ^~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:127:9: note: in expansion of macro 'forto'
  127 |         forto(s, i) {
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:131:9: note: in expansion of macro 'forto'
  131 |         forto(r, i) {
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:135:9: note: in expansion of macro 'forto'
  135 |         forto(w, i) {
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:140:9: note: in expansion of macro 'forto'
  140 |         forto(w, i) maxwrap = max(maxwrap, wraps[i].first);
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:142:9: note: in expansion of macro 'forto'
  142 |         forto(w, i) minwrap = min(minwrap, wraps[i].second);
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:147:9: note: in expansion of macro 'forto'
  147 |         forto(N, i) {
      |         ^~~~~
Main.cpp:15:35: warning: unnecessary parentheses in declaration of 'j' [-Wparentheses]
   15 | #define forto(name, var) for (int (var) = 0; (var) < (name); (var)++)
      |                                   ^
Main.cpp:155:13: note: in expansion of macro 'forto'
  155 |             forto(20, j) {
      |             ^~~~~

Subtask #1
14.0 / 14.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 0 ms 348 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 452 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 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 348 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 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 348 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 452 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 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 348 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 348 KB Output is correct
27 Correct 0 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 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 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 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 348 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 452 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 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 348 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 348 KB Output is correct
27 Correct 0 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 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 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 6 ms 2424 KB Output is correct
40 Correct 5 ms 2140 KB Output is correct
41 Correct 5 ms 2140 KB Output is correct
42 Correct 3 ms 1372 KB Output is correct
43 Correct 3 ms 1176 KB Output is correct
44 Correct 3 ms 1372 KB Output is correct
45 Correct 4 ms 1368 KB Output is correct
46 Correct 4 ms 1372 KB Output is correct
47 Correct 7 ms 2164 KB Output is correct
48 Correct 5 ms 2196 KB Output is correct
49 Correct 4 ms 2140 KB Output is correct
50 Correct 3 ms 1372 KB Output is correct

Subtask #4
13.0 / 13.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 0 ms 348 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 0 ms 348 KB Output is correct
13 Correct 1 ms 344 KB Output is correct
14 Correct 0 ms 348 KB Output is correct
15 Correct 5 ms 2140 KB Output is correct
16 Correct 3 ms 1372 KB Output is correct
17 Correct 3 ms 1116 KB Output is correct
18 Correct 3 ms 1156 KB Output is correct
19 Correct 5 ms 2140 KB Output is correct
20 Correct 26 ms 4516 KB Output is correct
21 Correct 308 ms 70836 KB Output is correct
22 Correct 292 ms 70868 KB Output is correct
23 Correct 199 ms 37076 KB Output is correct
24 Correct 289 ms 70832 KB Output is correct
25 Correct 172 ms 30348 KB Output is correct
26 Correct 201 ms 37044 KB Output is correct
27 Correct 199 ms 37036 KB Output is correct
28 Correct 258 ms 69044 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 1 ms 344 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 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 5 ms 2152 KB Output is correct
13 Correct 3 ms 1372 KB Output is correct
14 Correct 3 ms 1372 KB Output is correct
15 Correct 26 ms 4488 KB Output is correct
16 Correct 206 ms 37092 KB Output is correct
17 Correct 312 ms 70752 KB Output is correct
18 Correct 324 ms 70828 KB Output is correct
19 Correct 307 ms 72932 KB Output is correct
20 Correct 202 ms 38828 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 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 348 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 452 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 348 KB Output is correct
15 Correct 0 ms 344 KB Output is correct
16 Correct 0 ms 604 KB Output is correct
17 Correct 0 ms 348 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 0 ms 604 KB Output is correct
20 Correct 0 ms 460 KB Output is correct
21 Correct 0 ms 348 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 348 KB Output is correct
27 Correct 0 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 1 ms 348 KB Output is correct
31 Correct 0 ms 348 KB Output is correct
32 Correct 0 ms 348 KB Output is correct
33 Correct 1 ms 344 KB Output is correct
34 Correct 1 ms 344 KB Output is correct
35 Correct 0 ms 348 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 6 ms 2424 KB Output is correct
40 Correct 5 ms 2140 KB Output is correct
41 Correct 5 ms 2140 KB Output is correct
42 Correct 3 ms 1372 KB Output is correct
43 Correct 3 ms 1176 KB Output is correct
44 Correct 3 ms 1372 KB Output is correct
45 Correct 4 ms 1368 KB Output is correct
46 Correct 4 ms 1372 KB Output is correct
47 Correct 7 ms 2164 KB Output is correct
48 Correct 5 ms 2196 KB Output is correct
49 Correct 4 ms 2140 KB Output is correct
50 Correct 3 ms 1372 KB Output is correct
51 Correct 0 ms 348 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 348 KB Output is correct
57 Correct 0 ms 348 KB Output is correct
58 Correct 0 ms 348 KB Output is correct
59 Correct 0 ms 348 KB Output is correct
60 Correct 0 ms 348 KB Output is correct
61 Correct 0 ms 348 KB Output is correct
62 Correct 0 ms 348 KB Output is correct
63 Correct 1 ms 344 KB Output is correct
64 Correct 0 ms 348 KB Output is correct
65 Correct 5 ms 2140 KB Output is correct
66 Correct 3 ms 1372 KB Output is correct
67 Correct 3 ms 1116 KB Output is correct
68 Correct 3 ms 1156 KB Output is correct
69 Correct 5 ms 2140 KB Output is correct
70 Correct 26 ms 4516 KB Output is correct
71 Correct 308 ms 70836 KB Output is correct
72 Correct 292 ms 70868 KB Output is correct
73 Correct 199 ms 37076 KB Output is correct
74 Correct 289 ms 70832 KB Output is correct
75 Correct 172 ms 30348 KB Output is correct
76 Correct 201 ms 37044 KB Output is correct
77 Correct 199 ms 37036 KB Output is correct
78 Correct 258 ms 69044 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 1 ms 344 KB Output is correct
84 Correct 0 ms 348 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 5 ms 2152 KB Output is correct
91 Correct 3 ms 1372 KB Output is correct
92 Correct 3 ms 1372 KB Output is correct
93 Correct 26 ms 4488 KB Output is correct
94 Correct 206 ms 37092 KB Output is correct
95 Correct 312 ms 70752 KB Output is correct
96 Correct 324 ms 70828 KB Output is correct
97 Correct 307 ms 72932 KB Output is correct
98 Correct 202 ms 38828 KB Output is correct
99 Correct 284 ms 73128 KB Output is correct
100 Correct 288 ms 73068 KB Output is correct
101 Correct 265 ms 73148 KB Output is correct
102 Correct 353 ms 73140 KB Output is correct
103 Correct 206 ms 39380 KB Output is correct
104 Correct 261 ms 69792 KB Output is correct
105 Correct 179 ms 72436 KB Output is correct