oj.uz

Submission #502684

# Submission time Handle Problem Language Result Execution time Memory
502684 2022-01-06T12:44:33 Z tim Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++14
64 / 100
 3000 ms 247216 KB 
#include <bits/stdc++.h>

#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define y1 tim
#define endl "\n"

#define sz(x) (long long)(x).size()
#define all(x) (x).begin(), (x).end()

using namespace std;

mt19937_64 rng(chrono::system_clock::now().time_since_epoch().count());

int w[1000010], mx[4000010], ans[4000010], Max, y, l, r, k, n, m;
vector <int> v[4000010];

void build (int l, int r, int x)
{
    if (r < l) return;
    if (l == r)
    {
        mx[x] = w[l];
        v[x].push_back(w[l]);
        ans[x] = 0;
        return;
    }
    build (l, (l + r) / 2, x * 2);
    build ((l + r) / 2 + 1, r, x * 2 + 1);
    mx[x] = max (mx[x * 2], mx[x * 2 + 1]);
    v[x] = v[x * 2];
    ans[x] = max (ans[x * 2], ans[x * 2 + 1]);
    int mx1 = -1;
    for (int i = 0; i < v[x * 2 + 1].size(); i++)
    {

        if (v[x * 2 + 1][i] < mx[x * 2]) mx1 = v[x * 2 + 1][i];
        v[x].push_back(v[x * 2 + 1][i]);
    }
    sort (v[x].begin(), v[x].end());
    if (mx1 != -1) ans[x] = max (ans[x], mx[x * 2] + mx1);
}

void get (int l, int r, int tl, int tr, int x)
{
    if (r < l) return;
    if (tl > r) return;
    if (tr < l) return;
    tl = max (l, tl);
    tr = min (r, tr);
    if (l == tl and r == tr)
    {
        if (Max == 0 and y == 0)
        {
            y = ans[x];
            Max = mx[x];
        }
        else
        {
            y = max (y, ans[x]);
            int pos = lower_bound(v[x].begin(), v[x].end(), Max) - v[x].begin();
            if (pos != 0)
            {
                pos--;
                y = max (y, Max + v[x][pos]);
            }
            Max = max (Max, mx[x]);
        }
        return;
    }
    get (l, (l + r) / 2, tl, tr, x * 2);
    get ((l + r) / 2 + 1, r, tl, tr, x * 2 + 1);
}

int main()
{
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) cin >> w[i];
    build (1, n, 1);
    for (int i = 1; i <= m; i++)
    {
        cin >> l >> r >> k;
        y = 0;
        Max = 0;
        get (1, n, l, r, 1);
        if (y <= k) cout << 1 << endl;
        else cout << 0 << endl;
    }
    return 0;
}

Compilation message

sortbooks.cpp: In function 'void build(int, int, int)':
sortbooks.cpp:36:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   36 |     for (int i = 0; i < v[x * 2 + 1].size(); i++)
      |                     ~~^~~~~~~~~~~~~~~~~~~~~

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 94156 KB Output is correct
2 Correct 57 ms 94172 KB Output is correct
3 Correct 45 ms 94212 KB Output is correct
4 Correct 55 ms 94200 KB Output is correct
5 Correct 51 ms 94172 KB Output is correct
6 Correct 47 ms 94240 KB Output is correct
7 Correct 52 ms 94356 KB Output is correct
8 Correct 52 ms 94248 KB Output is correct
9 Correct 47 ms 94200 KB Output is correct
10 Correct 46 ms 94236 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 94156 KB Output is correct
2 Correct 57 ms 94172 KB Output is correct
3 Correct 45 ms 94212 KB Output is correct
4 Correct 55 ms 94200 KB Output is correct
5 Correct 51 ms 94172 KB Output is correct
6 Correct 47 ms 94240 KB Output is correct
7 Correct 52 ms 94356 KB Output is correct
8 Correct 52 ms 94248 KB Output is correct
9 Correct 47 ms 94200 KB Output is correct
10 Correct 46 ms 94236 KB Output is correct
11 Correct 49 ms 94412 KB Output is correct
12 Correct 50 ms 94992 KB Output is correct
13 Correct 56 ms 94892 KB Output is correct
14 Correct 55 ms 95004 KB Output is correct
15 Correct 55 ms 95052 KB Output is correct
16 Correct 52 ms 95028 KB Output is correct
17 Correct 58 ms 94816 KB Output is correct
18 Correct 51 ms 94948 KB Output is correct

Subtask #3
0 / 13.0

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

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 314 ms 108524 KB Output is correct
2 Correct 248 ms 108780 KB Output is correct
3 Correct 216 ms 108856 KB Output is correct
4 Correct 245 ms 108868 KB Output is correct
5 Correct 214 ms 108896 KB Output is correct
6 Correct 191 ms 109120 KB Output is correct
7 Correct 212 ms 109060 KB Output is correct
8 Correct 194 ms 109092 KB Output is correct
9 Correct 84 ms 94916 KB Output is correct
10 Correct 208 ms 108984 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 94156 KB Output is correct
2 Correct 57 ms 94172 KB Output is correct
3 Correct 45 ms 94212 KB Output is correct
4 Correct 55 ms 94200 KB Output is correct
5 Correct 51 ms 94172 KB Output is correct
6 Correct 47 ms 94240 KB Output is correct
7 Correct 52 ms 94356 KB Output is correct
8 Correct 52 ms 94248 KB Output is correct
9 Correct 47 ms 94200 KB Output is correct
10 Correct 46 ms 94236 KB Output is correct
11 Correct 49 ms 94412 KB Output is correct
12 Correct 50 ms 94992 KB Output is correct
13 Correct 56 ms 94892 KB Output is correct
14 Correct 55 ms 95004 KB Output is correct
15 Correct 55 ms 95052 KB Output is correct
16 Correct 52 ms 95028 KB Output is correct
17 Correct 58 ms 94816 KB Output is correct
18 Correct 51 ms 94948 KB Output is correct
19 Correct 634 ms 124284 KB Output is correct
20 Correct 637 ms 124212 KB Output is correct
21 Correct 529 ms 124180 KB Output is correct
22 Correct 512 ms 124152 KB Output is correct
23 Correct 584 ms 124188 KB Output is correct
24 Correct 375 ms 124312 KB Output is correct
25 Correct 409 ms 124212 KB Output is correct
26 Correct 462 ms 124196 KB Output is correct
27 Correct 430 ms 124184 KB Output is correct
28 Correct 486 ms 124196 KB Output is correct
29 Correct 437 ms 124272 KB Output is correct
30 Correct 479 ms 124184 KB Output is correct
31 Correct 459 ms 124328 KB Output is correct
32 Correct 429 ms 124152 KB Output is correct
33 Correct 451 ms 124208 KB Output is correct
34 Correct 372 ms 124140 KB Output is correct
35 Correct 357 ms 124332 KB Output is correct
36 Correct 366 ms 124136 KB Output is correct
37 Correct 350 ms 124236 KB Output is correct
38 Correct 372 ms 124224 KB Output is correct
39 Correct 419 ms 124200 KB Output is correct
40 Correct 275 ms 113304 KB Output is correct
41 Correct 404 ms 124184 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 45 ms 94156 KB Output is correct
2 Correct 57 ms 94172 KB Output is correct
3 Correct 45 ms 94212 KB Output is correct
4 Correct 55 ms 94200 KB Output is correct
5 Correct 51 ms 94172 KB Output is correct
6 Correct 47 ms 94240 KB Output is correct
7 Correct 52 ms 94356 KB Output is correct
8 Correct 52 ms 94248 KB Output is correct
9 Correct 47 ms 94200 KB Output is correct
10 Correct 46 ms 94236 KB Output is correct
11 Correct 49 ms 94412 KB Output is correct
12 Correct 50 ms 94992 KB Output is correct
13 Correct 56 ms 94892 KB Output is correct
14 Correct 55 ms 95004 KB Output is correct
15 Correct 55 ms 95052 KB Output is correct
16 Correct 52 ms 95028 KB Output is correct
17 Correct 58 ms 94816 KB Output is correct
18 Correct 51 ms 94948 KB Output is correct
19 Execution timed out 3070 ms 247216 KB Time limit exceeded
20 Halted 0 ms 0 KB -