oj.uz

Submission #168449

# Submission time Handle Problem Language Result Execution time Memory
168449 2019-12-13T06:28:49 Z koste4ka Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 192064 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;

vector < vector < int > > all;

vector < int > ans;

vector < int > need;

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());
    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.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
    int m;
    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;
        need.clear();
        go(1, l, r, 0, 1 << st);
        res = 0;
        best = 0;
        for (auto i : need) {
            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:80: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 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 380 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 380 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 6 ms 632 KB Output is correct
12 Correct 10 ms 1400 KB Output is correct
13 Correct 10 ms 1272 KB Output is correct
14 Correct 13 ms 1400 KB Output is correct
15 Correct 13 ms 1400 KB Output is correct
16 Correct 10 ms 1400 KB Output is correct
17 Correct 7 ms 1016 KB Output is correct
18 Correct 8 ms 1400 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 319 ms 19860 KB Output is correct
2 Correct 299 ms 19856 KB Output is correct
3 Correct 196 ms 19956 KB Output is correct
4 Correct 190 ms 19828 KB Output is correct
5 Correct 189 ms 19972 KB Output is correct
6 Correct 154 ms 19956 KB Output is correct
7 Correct 154 ms 19892 KB Output is correct
8 Correct 191 ms 19956 KB Output is correct
9 Correct 51 ms 632 KB Output is correct
10 Correct 180 ms 19940 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 380 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 6 ms 632 KB Output is correct
12 Correct 10 ms 1400 KB Output is correct
13 Correct 10 ms 1272 KB Output is correct
14 Correct 13 ms 1400 KB Output is correct
15 Correct 13 ms 1400 KB Output is correct
16 Correct 10 ms 1400 KB Output is correct
17 Correct 7 ms 1016 KB Output is correct
18 Correct 8 ms 1400 KB Output is correct
19 Correct 747 ms 40360 KB Output is correct
20 Correct 747 ms 40432 KB Output is correct
21 Correct 680 ms 40224 KB Output is correct
22 Correct 678 ms 40236 KB Output is correct
23 Correct 669 ms 40304 KB Output is correct
24 Correct 364 ms 40324 KB Output is correct
25 Correct 368 ms 40304 KB Output is correct
26 Correct 460 ms 40268 KB Output is correct
27 Correct 432 ms 40324 KB Output is correct
28 Correct 436 ms 40304 KB Output is correct
29 Correct 435 ms 40256 KB Output is correct
30 Correct 435 ms 40220 KB Output is correct
31 Correct 434 ms 40260 KB Output is correct
32 Correct 442 ms 40224 KB Output is correct
33 Correct 455 ms 40428 KB Output is correct
34 Correct 338 ms 40300 KB Output is correct
35 Correct 338 ms 40176 KB Output is correct
36 Correct 339 ms 40300 KB Output is correct
37 Correct 337 ms 40228 KB Output is correct
38 Correct 342 ms 40300 KB Output is correct
39 Correct 466 ms 40336 KB Output is correct
40 Correct 284 ms 23896 KB Output is correct
41 Correct 403 ms 40204 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 3 ms 376 KB Output is correct
7 Correct 3 ms 380 KB Output is correct
8 Correct 3 ms 504 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 504 KB Output is correct
11 Correct 6 ms 632 KB Output is correct
12 Correct 10 ms 1400 KB Output is correct
13 Correct 10 ms 1272 KB Output is correct
14 Correct 13 ms 1400 KB Output is correct
15 Correct 13 ms 1400 KB Output is correct
16 Correct 10 ms 1400 KB Output is correct
17 Correct 7 ms 1016 KB Output is correct
18 Correct 8 ms 1400 KB Output is correct
19 Execution timed out 3046 ms 192064 KB Time limit exceeded
20 Halted 0 ms 0 KB -