oj.uz

답안 #502695

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
502695 2022-01-06T13:01:01 Z tim Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 247092 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()
{
    srand(time(0));
    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

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 94156 KB Output is correct
2 Correct 50 ms 94128 KB Output is correct
3 Correct 53 ms 94272 KB Output is correct
4 Correct 46 ms 94260 KB Output is correct
5 Correct 46 ms 94240 KB Output is correct
6 Correct 46 ms 94348 KB Output is correct
7 Correct 54 ms 94236 KB Output is correct
8 Correct 55 ms 94252 KB Output is correct
9 Correct 52 ms 94280 KB Output is correct
10 Correct 48 ms 94276 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 94156 KB Output is correct
2 Correct 50 ms 94128 KB Output is correct
3 Correct 53 ms 94272 KB Output is correct
4 Correct 46 ms 94260 KB Output is correct
5 Correct 46 ms 94240 KB Output is correct
6 Correct 46 ms 94348 KB Output is correct
7 Correct 54 ms 94236 KB Output is correct
8 Correct 55 ms 94252 KB Output is correct
9 Correct 52 ms 94280 KB Output is correct
10 Correct 48 ms 94276 KB Output is correct
11 Correct 47 ms 94412 KB Output is correct
12 Correct 49 ms 94920 KB Output is correct
13 Correct 49 ms 94892 KB Output is correct
14 Correct 52 ms 94976 KB Output is correct
15 Correct 62 ms 95044 KB Output is correct
16 Correct 53 ms 94984 KB Output is correct
17 Correct 48 ms 94780 KB Output is correct
18 Correct 50 ms 95016 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Execution timed out 3110 ms 247092 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 244 ms 108504 KB Output is correct
2 Correct 233 ms 108536 KB Output is correct
3 Correct 220 ms 108572 KB Output is correct
4 Correct 194 ms 108600 KB Output is correct
5 Correct 235 ms 108576 KB Output is correct
6 Correct 188 ms 108516 KB Output is correct
7 Correct 170 ms 108596 KB Output is correct
8 Correct 180 ms 108492 KB Output is correct
9 Correct 83 ms 94500 KB Output is correct
10 Correct 169 ms 108556 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 94156 KB Output is correct
2 Correct 50 ms 94128 KB Output is correct
3 Correct 53 ms 94272 KB Output is correct
4 Correct 46 ms 94260 KB Output is correct
5 Correct 46 ms 94240 KB Output is correct
6 Correct 46 ms 94348 KB Output is correct
7 Correct 54 ms 94236 KB Output is correct
8 Correct 55 ms 94252 KB Output is correct
9 Correct 52 ms 94280 KB Output is correct
10 Correct 48 ms 94276 KB Output is correct
11 Correct 47 ms 94412 KB Output is correct
12 Correct 49 ms 94920 KB Output is correct
13 Correct 49 ms 94892 KB Output is correct
14 Correct 52 ms 94976 KB Output is correct
15 Correct 62 ms 95044 KB Output is correct
16 Correct 53 ms 94984 KB Output is correct
17 Correct 48 ms 94780 KB Output is correct
18 Correct 50 ms 95016 KB Output is correct
19 Correct 657 ms 123672 KB Output is correct
20 Correct 645 ms 123680 KB Output is correct
21 Correct 492 ms 123632 KB Output is correct
22 Correct 484 ms 123700 KB Output is correct
23 Correct 497 ms 123668 KB Output is correct
24 Correct 378 ms 123740 KB Output is correct
25 Correct 356 ms 123652 KB Output is correct
26 Correct 433 ms 123724 KB Output is correct
27 Correct 433 ms 123676 KB Output is correct
28 Correct 473 ms 123696 KB Output is correct
29 Correct 450 ms 123688 KB Output is correct
30 Correct 446 ms 123680 KB Output is correct
31 Correct 430 ms 123616 KB Output is correct
32 Correct 494 ms 123672 KB Output is correct
33 Correct 437 ms 123684 KB Output is correct
34 Correct 367 ms 123640 KB Output is correct
35 Correct 351 ms 123772 KB Output is correct
36 Correct 387 ms 123584 KB Output is correct
37 Correct 347 ms 123708 KB Output is correct
38 Correct 354 ms 123712 KB Output is correct
39 Correct 406 ms 123684 KB Output is correct
40 Correct 278 ms 112824 KB Output is correct
41 Correct 360 ms 123748 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 48 ms 94156 KB Output is correct
2 Correct 50 ms 94128 KB Output is correct
3 Correct 53 ms 94272 KB Output is correct
4 Correct 46 ms 94260 KB Output is correct
5 Correct 46 ms 94240 KB Output is correct
6 Correct 46 ms 94348 KB Output is correct
7 Correct 54 ms 94236 KB Output is correct
8 Correct 55 ms 94252 KB Output is correct
9 Correct 52 ms 94280 KB Output is correct
10 Correct 48 ms 94276 KB Output is correct
11 Correct 47 ms 94412 KB Output is correct
12 Correct 49 ms 94920 KB Output is correct
13 Correct 49 ms 94892 KB Output is correct
14 Correct 52 ms 94976 KB Output is correct
15 Correct 62 ms 95044 KB Output is correct
16 Correct 53 ms 94984 KB Output is correct
17 Correct 48 ms 94780 KB Output is correct
18 Correct 50 ms 95016 KB Output is correct
19 Execution timed out 3110 ms 247092 KB Time limit exceeded
20 Halted 0 ms 0 KB -