oj.uz

Submission #469594

# Submission time Handle Problem Language Result Execution time Memory
469594 2021-09-01T11:56:17 Z spike1236 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
100 / 100
 1829 ms 96616 KB 
#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define f first
#define s second
#define ll long long
#define ld long double
#define all(_v) _v.begin(), _v.end()
#define sz(_v) (int)_v.size()
#define pii pair <int, int>
#define pll pair <ll, ll>
#define veci vector <int>
#define vecll vector <ll>

const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, -1, 1};
const double PI = 3.1415926535897932384626433832795;
const double eps = 1e-9;
const int MOD1 = 1e9 + 7;
const int MOD2 = 998244353;

const int MAXN = 1e6 + 10;
int n, m;
int a[MAXN];
int t[MAXN << 2];
vector <pair <int, pii> > q[MAXN];
int ans[MAXN];

void upd(int pos, int val, int v = 1, int tl = 1, int tr = n) {
    if(tl == tr) {
        t[v] = max(t[v], val);
        return;
    }
    int tm = tl + tr >> 1;
    if(pos <= tm) upd(pos, val, v << 1, tl, tm);
    else upd(pos, val, v << 1 | 1, tm + 1, tr);
    t[v] = max(t[v << 1], t[v << 1 | 1]);
}

int get(int l, int r, int v = 1, int tl = 1, int tr = n) {
    if(l <= tl && tr <= r) return t[v];
    if(l > tr || r < tl) return 0;
    int tm = tl + tr >> 1;
    return max(get(l, r, v << 1, tl, tm), get(l, r, v << 1 | 1, tm + 1, tr));
}

void solve() {
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) {
        cin >> a[i];
    }
    for(int i = 1; i <= m; ++i) {
        int l, r, k;
        cin >> l >> r >> k;
        q[r].pb(mp(l, mp(k, i)));
    }
    stack <int> st;
    for(int i = 1; i <= n; ++i) {
        while(!st.empty() && a[st.top()] <= a[i]) st.pop();
        if(!st.empty()) upd(st.top(), a[i] + a[st.top()]);
        st.push(i);
        for(auto it : q[i]) ans[it.s.s] = (get(it.f, i) <= it.s.f);
    }
    for(int i = 1; i <= m; ++i) cout << ans[i] << '\n';
}

int main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int CNT_TESTS = 1;
    ///cin >> CNT_TESTS;
    for(int NUMCASE = 1; NUMCASE <= CNT_TESTS; ++NUMCASE) {
        solve();
        if(NUMCASE != CNT_TESTS) cout << '\n';
    }
    return 0;
}

Compilation message

sortbooks.cpp: In function 'void upd(int, int, int, int, int)':
sortbooks.cpp:35:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   35 |     int tm = tl + tr >> 1;
      |              ~~~^~~~
sortbooks.cpp: In function 'int get(int, int, int, int, int)':
sortbooks.cpp:44:17: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   44 |     int tm = tl + tr >> 1;
      |              ~~~^~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23812 KB Output is correct
4 Correct 14 ms 23824 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 14 ms 23776 KB Output is correct
7 Correct 13 ms 23824 KB Output is correct
8 Correct 14 ms 23760 KB Output is correct
9 Correct 13 ms 23824 KB Output is correct
10 Correct 13 ms 23756 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23812 KB Output is correct
4 Correct 14 ms 23824 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 14 ms 23776 KB Output is correct
7 Correct 13 ms 23824 KB Output is correct
8 Correct 14 ms 23760 KB Output is correct
9 Correct 13 ms 23824 KB Output is correct
10 Correct 13 ms 23756 KB Output is correct
11 Correct 16 ms 23948 KB Output is correct
12 Correct 19 ms 24012 KB Output is correct
13 Correct 16 ms 24084 KB Output is correct
14 Correct 19 ms 24156 KB Output is correct
15 Correct 19 ms 24180 KB Output is correct
16 Correct 17 ms 24008 KB Output is correct
17 Correct 18 ms 24072 KB Output is correct
18 Correct 17 ms 24088 KB Output is correct

Subtask #3
13.0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1802 ms 95536 KB Output is correct
2 Correct 1816 ms 96408 KB Output is correct
3 Correct 1741 ms 96292 KB Output is correct
4 Correct 1820 ms 96476 KB Output is correct
5 Correct 1489 ms 88304 KB Output is correct

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 141 ms 29896 KB Output is correct
2 Correct 128 ms 29608 KB Output is correct
3 Correct 114 ms 28740 KB Output is correct
4 Correct 114 ms 28932 KB Output is correct
5 Correct 110 ms 28816 KB Output is correct
6 Correct 96 ms 28356 KB Output is correct
7 Correct 98 ms 28284 KB Output is correct
8 Correct 108 ms 28364 KB Output is correct
9 Correct 62 ms 27132 KB Output is correct
10 Correct 103 ms 28364 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23812 KB Output is correct
4 Correct 14 ms 23824 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 14 ms 23776 KB Output is correct
7 Correct 13 ms 23824 KB Output is correct
8 Correct 14 ms 23760 KB Output is correct
9 Correct 13 ms 23824 KB Output is correct
10 Correct 13 ms 23756 KB Output is correct
11 Correct 16 ms 23948 KB Output is correct
12 Correct 19 ms 24012 KB Output is correct
13 Correct 16 ms 24084 KB Output is correct
14 Correct 19 ms 24156 KB Output is correct
15 Correct 19 ms 24180 KB Output is correct
16 Correct 17 ms 24008 KB Output is correct
17 Correct 18 ms 24072 KB Output is correct
18 Correct 17 ms 24088 KB Output is correct
19 Correct 314 ms 38616 KB Output is correct
20 Correct 330 ms 38596 KB Output is correct
21 Correct 261 ms 37980 KB Output is correct
22 Correct 265 ms 38152 KB Output is correct
23 Correct 263 ms 37984 KB Output is correct
24 Correct 220 ms 35756 KB Output is correct
25 Correct 228 ms 35704 KB Output is correct
26 Correct 240 ms 36164 KB Output is correct
27 Correct 242 ms 36132 KB Output is correct
28 Correct 254 ms 36252 KB Output is correct
29 Correct 252 ms 36620 KB Output is correct
30 Correct 244 ms 36676 KB Output is correct
31 Correct 255 ms 36560 KB Output is correct
32 Correct 249 ms 36528 KB Output is correct
33 Correct 252 ms 36584 KB Output is correct
34 Correct 211 ms 35396 KB Output is correct
35 Correct 212 ms 35316 KB Output is correct
36 Correct 211 ms 35120 KB Output is correct
37 Correct 205 ms 35192 KB Output is correct
38 Correct 208 ms 35384 KB Output is correct
39 Correct 232 ms 35536 KB Output is correct
40 Correct 183 ms 33524 KB Output is correct
41 Correct 218 ms 34412 KB Output is correct

Subtask #6
23.0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 23756 KB Output is correct
2 Correct 13 ms 23756 KB Output is correct
3 Correct 13 ms 23812 KB Output is correct
4 Correct 14 ms 23824 KB Output is correct
5 Correct 14 ms 23756 KB Output is correct
6 Correct 14 ms 23776 KB Output is correct
7 Correct 13 ms 23824 KB Output is correct
8 Correct 14 ms 23760 KB Output is correct
9 Correct 13 ms 23824 KB Output is correct
10 Correct 13 ms 23756 KB Output is correct
11 Correct 16 ms 23948 KB Output is correct
12 Correct 19 ms 24012 KB Output is correct
13 Correct 16 ms 24084 KB Output is correct
14 Correct 19 ms 24156 KB Output is correct
15 Correct 19 ms 24180 KB Output is correct
16 Correct 17 ms 24008 KB Output is correct
17 Correct 18 ms 24072 KB Output is correct
18 Correct 17 ms 24088 KB Output is correct
19 Correct 1802 ms 95536 KB Output is correct
20 Correct 1816 ms 96408 KB Output is correct
21 Correct 1741 ms 96292 KB Output is correct
22 Correct 1820 ms 96476 KB Output is correct
23 Correct 1489 ms 88304 KB Output is correct
24 Correct 141 ms 29896 KB Output is correct
25 Correct 128 ms 29608 KB Output is correct
26 Correct 114 ms 28740 KB Output is correct
27 Correct 114 ms 28932 KB Output is correct
28 Correct 110 ms 28816 KB Output is correct
29 Correct 96 ms 28356 KB Output is correct
30 Correct 98 ms 28284 KB Output is correct
31 Correct 108 ms 28364 KB Output is correct
32 Correct 62 ms 27132 KB Output is correct
33 Correct 103 ms 28364 KB Output is correct
34 Correct 314 ms 38616 KB Output is correct
35 Correct 330 ms 38596 KB Output is correct
36 Correct 261 ms 37980 KB Output is correct
37 Correct 265 ms 38152 KB Output is correct
38 Correct 263 ms 37984 KB Output is correct
39 Correct 220 ms 35756 KB Output is correct
40 Correct 228 ms 35704 KB Output is correct
41 Correct 240 ms 36164 KB Output is correct
42 Correct 242 ms 36132 KB Output is correct
43 Correct 254 ms 36252 KB Output is correct
44 Correct 252 ms 36620 KB Output is correct
45 Correct 244 ms 36676 KB Output is correct
46 Correct 255 ms 36560 KB Output is correct
47 Correct 249 ms 36528 KB Output is correct
48 Correct 252 ms 36584 KB Output is correct
49 Correct 211 ms 35396 KB Output is correct
50 Correct 212 ms 35316 KB Output is correct
51 Correct 211 ms 35120 KB Output is correct
52 Correct 205 ms 35192 KB Output is correct
53 Correct 208 ms 35384 KB Output is correct
54 Correct 232 ms 35536 KB Output is correct
55 Correct 183 ms 33524 KB Output is correct
56 Correct 218 ms 34412 KB Output is correct
57 Correct 1829 ms 70360 KB Output is correct
58 Correct 1767 ms 96616 KB Output is correct
59 Correct 1677 ms 95060 KB Output is correct
60 Correct 1662 ms 95056 KB Output is correct
61 Correct 1678 ms 95180 KB Output is correct
62 Correct 1666 ms 95024 KB Output is correct
63 Correct 1119 ms 83620 KB Output is correct
64 Correct 1132 ms 83772 KB Output is correct
65 Correct 1388 ms 86752 KB Output is correct
66 Correct 1408 ms 86772 KB Output is correct
67 Correct 1435 ms 86780 KB Output is correct
68 Correct 1459 ms 88568 KB Output is correct
69 Correct 1450 ms 62120 KB Output is correct
70 Correct 1447 ms 61876 KB Output is correct
71 Correct 1469 ms 61876 KB Output is correct
72 Correct 1450 ms 61940 KB Output is correct
73 Correct 1105 ms 56132 KB Output is correct
74 Correct 1048 ms 56132 KB Output is correct
75 Correct 1016 ms 56176 KB Output is correct
76 Correct 1040 ms 56408 KB Output is correct
77 Correct 1016 ms 79448 KB Output is correct
78 Correct 1305 ms 62324 KB Output is correct
79 Correct 940 ms 54988 KB Output is correct
80 Correct 1305 ms 59372 KB Output is correct