oj.uz

Submission #168453

# Submission time Handle Problem Language Result Execution time Memory
168453 2019-12-13T06:35:15 Z koste4ka Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 258384 KB 
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")

#include <bits/stdc++.h>

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/detail/standard_policies.hpp>

#define pb push_back
#define F first
#define S second
#define lll unsigned long long
#define lld long double

#define data sdadsd

//#define int lll

using namespace std;
using namespace __gnu_pbds;

template <typename T>
using ordered_set = tree <T,null_type,less<T>,rb_tree_tag,tree_order_statistics_node_update>;

mt19937 gen(chrono::system_clock::now().time_since_epoch().count());

const int N = 1e6 + 229;
const lll M = 1e9 + 7;
const lll M2 = 1e9 + 9;
const lll mod = 998244353;
const int rx[4] = {0, 0, -1, 1};
const int ry[4] = {-1, 1, 0, 0};
const lld eps = 1e-11;
const double pi = acos(-1.0);

int a[N];

int n, m;

vector < vector < int > > all;

vector < int > ans;

vector < int > need[N];

void prec(int v, int l, int r) {
    int best = 0;
    for (int i = l; i < min(r, n); ++i) {
        if (i > l && a[i] < best) {
            ans[v] = max(ans[v], a[i] + best);
        }
        all[v].pb(a[i]);
        best = max(best, a[i]);
    }
    sort(all[v].begin(), all[v].end());
    all[v].resize(unique(all[v].begin(), all[v].end()) - all[v].begin());
    if (l + 1 == r) {
        return;
    }
    int mid = (l + r) / 2;
    prec(v * 2, l, mid);
    prec(v * 2 + 1, mid, r);
}

void go(int v, int l, int r, int cl, int cr) {
    if (cl >= r || cr <= l) {
        return;
    }
    if (cl >= l && cr <= r) {
        need[m].pb(v);
        return;
    }
    int mid = (cl + cr) / 2;
    go(v * 2, l, r, cl, mid);
    go(v * 2 + 1, l, r, mid, cr);
}

main() {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    srand(time(0));
#ifdef LOCAL
    freopen("input.txt", "r", stdin);
    freopen("output.txt", "w", stdout);
#else
//    freopen("maxxor.in", "r", stdin);
//    freopen("maxxor.out", "w", stdout);
#endif
    cin >> n >> m;
    for (int i = 0; i < n; ++i) {
        cin >> a[i];
    }
    int st = 0;
    while ((1 << st) < n) {
        ++st;
    }
    ans.resize(1 << (st + 1));
    all.resize(1 << (st + 1));
    prec(1, 0, 1 << st);
    int l, r, k;
    int res;
    int best;
    int it;
    while (m--) {
        cin >> l >> r >> k;
        --l;
        go(1, l, r, 0, 1 << st);
        res = 0;
        best = 0;
        for (auto i : need[m]) {
            if (best > all[i].front()) {
                it = lower_bound(all[i].begin(), all[i].end(), best) - all[i].begin();
                --it;
                res = max(res, best + all[i][it]);
            }
            best = max(best, all[i].back());
            res = max(res, ans[i]);
        }
        cout << (res <= k) << '\n';
    }
    return 0;
}

Compilation message

sortbooks.cpp:81:6: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
 main() {
      ^

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 23 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 24 ms 23932 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23932 KB Output is correct
9 Correct 23 ms 23820 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 23 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 24 ms 23932 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23932 KB Output is correct
9 Correct 23 ms 23820 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 28 ms 24312 KB Output is correct
12 Correct 32 ms 25084 KB Output is correct
13 Correct 33 ms 25208 KB Output is correct
14 Correct 37 ms 25336 KB Output is correct
15 Correct 37 ms 25336 KB Output is correct
16 Correct 33 ms 25308 KB Output is correct
17 Correct 31 ms 24824 KB Output is correct
18 Correct 32 ms 25208 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3054 ms 258384 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 394 ms 52992 KB Output is correct
2 Correct 373 ms 55376 KB Output is correct
3 Correct 270 ms 54216 KB Output is correct
4 Correct 268 ms 53476 KB Output is correct
5 Correct 262 ms 52980 KB Output is correct
6 Correct 232 ms 56336 KB Output is correct
7 Correct 232 ms 56556 KB Output is correct
8 Correct 241 ms 52084 KB Output is correct
9 Correct 92 ms 28920 KB Output is correct
10 Correct 242 ms 52348 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 23 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 24 ms 23932 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23932 KB Output is correct
9 Correct 23 ms 23820 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 28 ms 24312 KB Output is correct
12 Correct 32 ms 25084 KB Output is correct
13 Correct 33 ms 25208 KB Output is correct
14 Correct 37 ms 25336 KB Output is correct
15 Correct 37 ms 25336 KB Output is correct
16 Correct 33 ms 25308 KB Output is correct
17 Correct 31 ms 24824 KB Output is correct
18 Correct 32 ms 25208 KB Output is correct
19 Correct 922 ms 84864 KB Output is correct
20 Correct 879 ms 84672 KB Output is correct
21 Correct 861 ms 90368 KB Output is correct
22 Correct 820 ms 90324 KB Output is correct
23 Correct 819 ms 90532 KB Output is correct
24 Correct 515 ms 90352 KB Output is correct
25 Correct 507 ms 90224 KB Output is correct
26 Correct 561 ms 88944 KB Output is correct
27 Correct 565 ms 89108 KB Output is correct
28 Correct 575 ms 88560 KB Output is correct
29 Correct 577 ms 84464 KB Output is correct
30 Correct 569 ms 84632 KB Output is correct
31 Correct 578 ms 85360 KB Output is correct
32 Correct 569 ms 85276 KB Output is correct
33 Correct 568 ms 85184 KB Output is correct
34 Correct 476 ms 92312 KB Output is correct
35 Correct 478 ms 92124 KB Output is correct
36 Correct 478 ms 92144 KB Output is correct
37 Correct 476 ms 92016 KB Output is correct
38 Correct 483 ms 91988 KB Output is correct
39 Correct 596 ms 83460 KB Output is correct
40 Correct 362 ms 60788 KB Output is correct
41 Correct 491 ms 82044 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 23800 KB Output is correct
2 Correct 24 ms 23928 KB Output is correct
3 Correct 24 ms 23928 KB Output is correct
4 Correct 23 ms 23928 KB Output is correct
5 Correct 23 ms 23928 KB Output is correct
6 Correct 24 ms 23932 KB Output is correct
7 Correct 24 ms 23928 KB Output is correct
8 Correct 24 ms 23932 KB Output is correct
9 Correct 23 ms 23820 KB Output is correct
10 Correct 24 ms 23928 KB Output is correct
11 Correct 28 ms 24312 KB Output is correct
12 Correct 32 ms 25084 KB Output is correct
13 Correct 33 ms 25208 KB Output is correct
14 Correct 37 ms 25336 KB Output is correct
15 Correct 37 ms 25336 KB Output is correct
16 Correct 33 ms 25308 KB Output is correct
17 Correct 31 ms 24824 KB Output is correct
18 Correct 32 ms 25208 KB Output is correct
19 Execution timed out 3054 ms 258384 KB Time limit exceeded
20 Halted 0 ms 0 KB -