oj.uz

답안 #851034

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
851034 2023-09-18T08:55:33 Z wakandaaa Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 678 ms 96416 KB 
#include <bits/stdc++.h>

using namespace std;

#define file ""

#define mp make_pair
#define fi first
#define se second
#define all(x) x.begin(), x.end()

#define getbit(x, i) (((x) >> (i)) & 1)
#define bit(x) (1LL << (x))
#define popcount __builtin_popcountll

mt19937_64 rd(chrono::steady_clock::now().time_since_epoch().count());
int rand(int l, int r) {
    return l + rd() % (r - l + 1);
}

const int N = 1e6 + 5;
const int mod = (int)1e9 + 7; // 998244353;
const int lg = 25; // lg + 1
const int oo = 1e9;
const long long ooo = 1e18;

template<class X, class Y> bool mini(X &a, Y b) {
    return a > b ? (a = b, true) : false;
}
template<class X, class Y> bool maxi(X &a, Y b) {
    return a < b ? (a = b, true) : false;
}
void add(int &a, int b) {
    a += b;
    if (a >= mod) a -= mod;
    if (a < 0) a += mod;
}

int n, q;
int a[N];
vector<tuple<int, int, int> > query[N];
int lpos[N];
int res[N];

int bit[N];

void update(int u, int c) {
	for (; u > 0; u -= u &(-u)) maxi(bit[u], c);
}
int get(int u) {
	int res = 0;
	for (; u <= n; u += u & (-u)) maxi(res, bit[u]);
	return res;
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);

    // freopen(file".inp", "r", stdin);
    // freopen(file".out", "w", stdout);

    cin >> n >> q;
    for (int i = 1; i <= n; ++i)
    	cin >> a[i];
    for (int i = 1; i <= q; ++i) {
    	int l, r, c;
    	cin >> l >> r >> c;
    	query[r].emplace_back(l, c, i);
    }

    stack<int> st;
    for (int i = 1; i <= n; ++i) {
    	while (st.size() && a[i] >= a[st.top()]) st.pop();
    	lpos[i] = st.size() ? st.top() : 0;
    	st.push(i);
    }

    for (int i = 1; i <= n; ++i) {
    	if (lpos[i]) {
    		update(lpos[i], a[lpos[i]] + a[i]);
    	}
    	for (auto [l, c, id] : query[i]) {
    		res[id] = get(l) <= c;
    	}
    }

    for (int i = 1; i <= q; ++i) {
    	cout << res[i] << ' ';
    }

    return 0;
}

/*

*/

Subtask #1
8.0 / 8.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 31068 KB Output is correct
2 Correct 6 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 6 ms 31180 KB Output is correct
5 Correct 6 ms 31068 KB Output is correct
6 Correct 8 ms 31320 KB Output is correct
7 Correct 6 ms 31172 KB Output is correct
8 Correct 6 ms 31068 KB Output is correct
9 Correct 6 ms 31068 KB Output is correct
10 Correct 6 ms 31068 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 31068 KB Output is correct
2 Correct 6 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 6 ms 31180 KB Output is correct
5 Correct 6 ms 31068 KB Output is correct
6 Correct 8 ms 31320 KB Output is correct
7 Correct 6 ms 31172 KB Output is correct
8 Correct 6 ms 31068 KB Output is correct
9 Correct 6 ms 31068 KB Output is correct
10 Correct 6 ms 31068 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 8 ms 31324 KB Output is correct
13 Correct 8 ms 31320 KB Output is correct
14 Correct 8 ms 31524 KB Output is correct
15 Correct 8 ms 31320 KB Output is correct
16 Correct 8 ms 31480 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 9 ms 31324 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 672 ms 94968 KB Output is correct
2 Correct 673 ms 96084 KB Output is correct
3 Correct 670 ms 95876 KB Output is correct
4 Correct 674 ms 96240 KB Output is correct
5 Correct 643 ms 94028 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 58 ms 38092 KB Output is correct
2 Correct 45 ms 37716 KB Output is correct
3 Correct 42 ms 37712 KB Output is correct
4 Correct 45 ms 37460 KB Output is correct
5 Correct 43 ms 37464 KB Output is correct
6 Correct 36 ms 36956 KB Output is correct
7 Correct 36 ms 36944 KB Output is correct
8 Correct 41 ms 37020 KB Output is correct
9 Correct 30 ms 36116 KB Output is correct
10 Correct 40 ms 36884 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 31068 KB Output is correct
2 Correct 6 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 6 ms 31180 KB Output is correct
5 Correct 6 ms 31068 KB Output is correct
6 Correct 8 ms 31320 KB Output is correct
7 Correct 6 ms 31172 KB Output is correct
8 Correct 6 ms 31068 KB Output is correct
9 Correct 6 ms 31068 KB Output is correct
10 Correct 6 ms 31068 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 8 ms 31324 KB Output is correct
13 Correct 8 ms 31320 KB Output is correct
14 Correct 8 ms 31524 KB Output is correct
15 Correct 8 ms 31320 KB Output is correct
16 Correct 8 ms 31480 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 9 ms 31324 KB Output is correct
19 Correct 111 ms 47124 KB Output is correct
20 Correct 113 ms 47188 KB Output is correct
21 Correct 90 ms 46672 KB Output is correct
22 Correct 93 ms 46672 KB Output is correct
23 Correct 91 ms 46512 KB Output is correct
24 Correct 80 ms 45648 KB Output is correct
25 Correct 80 ms 45648 KB Output is correct
26 Correct 88 ms 46064 KB Output is correct
27 Correct 97 ms 46016 KB Output is correct
28 Correct 93 ms 46048 KB Output is correct
29 Correct 95 ms 46492 KB Output is correct
30 Correct 105 ms 46400 KB Output is correct
31 Correct 97 ms 46400 KB Output is correct
32 Correct 97 ms 46444 KB Output is correct
33 Correct 115 ms 46320 KB Output is correct
34 Correct 78 ms 45228 KB Output is correct
35 Correct 78 ms 45320 KB Output is correct
36 Correct 76 ms 45140 KB Output is correct
37 Correct 84 ms 44960 KB Output is correct
38 Correct 77 ms 45136 KB Output is correct
39 Correct 93 ms 44812 KB Output is correct
40 Correct 74 ms 41696 KB Output is correct
41 Correct 98 ms 44300 KB Output is correct

Subtask #6
23.0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 6 ms 31068 KB Output is correct
2 Correct 6 ms 31068 KB Output is correct
3 Correct 7 ms 31068 KB Output is correct
4 Correct 6 ms 31180 KB Output is correct
5 Correct 6 ms 31068 KB Output is correct
6 Correct 8 ms 31320 KB Output is correct
7 Correct 6 ms 31172 KB Output is correct
8 Correct 6 ms 31068 KB Output is correct
9 Correct 6 ms 31068 KB Output is correct
10 Correct 6 ms 31068 KB Output is correct
11 Correct 7 ms 31324 KB Output is correct
12 Correct 8 ms 31324 KB Output is correct
13 Correct 8 ms 31320 KB Output is correct
14 Correct 8 ms 31524 KB Output is correct
15 Correct 8 ms 31320 KB Output is correct
16 Correct 8 ms 31480 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 9 ms 31324 KB Output is correct
19 Correct 672 ms 94968 KB Output is correct
20 Correct 673 ms 96084 KB Output is correct
21 Correct 670 ms 95876 KB Output is correct
22 Correct 674 ms 96240 KB Output is correct
23 Correct 643 ms 94028 KB Output is correct
24 Correct 58 ms 38092 KB Output is correct
25 Correct 45 ms 37716 KB Output is correct
26 Correct 42 ms 37712 KB Output is correct
27 Correct 45 ms 37460 KB Output is correct
28 Correct 43 ms 37464 KB Output is correct
29 Correct 36 ms 36956 KB Output is correct
30 Correct 36 ms 36944 KB Output is correct
31 Correct 41 ms 37020 KB Output is correct
32 Correct 30 ms 36116 KB Output is correct
33 Correct 40 ms 36884 KB Output is correct
34 Correct 111 ms 47124 KB Output is correct
35 Correct 113 ms 47188 KB Output is correct
36 Correct 90 ms 46672 KB Output is correct
37 Correct 93 ms 46672 KB Output is correct
38 Correct 91 ms 46512 KB Output is correct
39 Correct 80 ms 45648 KB Output is correct
40 Correct 80 ms 45648 KB Output is correct
41 Correct 88 ms 46064 KB Output is correct
42 Correct 97 ms 46016 KB Output is correct
43 Correct 93 ms 46048 KB Output is correct
44 Correct 95 ms 46492 KB Output is correct
45 Correct 105 ms 46400 KB Output is correct
46 Correct 97 ms 46400 KB Output is correct
47 Correct 97 ms 46444 KB Output is correct
48 Correct 115 ms 46320 KB Output is correct
49 Correct 78 ms 45228 KB Output is correct
50 Correct 78 ms 45320 KB Output is correct
51 Correct 76 ms 45140 KB Output is correct
52 Correct 84 ms 44960 KB Output is correct
53 Correct 77 ms 45136 KB Output is correct
54 Correct 93 ms 44812 KB Output is correct
55 Correct 74 ms 41696 KB Output is correct
56 Correct 98 ms 44300 KB Output is correct
57 Correct 663 ms 96416 KB Output is correct
58 Correct 637 ms 96232 KB Output is correct
59 Correct 618 ms 94800 KB Output is correct
60 Correct 604 ms 94676 KB Output is correct
61 Correct 638 ms 94568 KB Output is correct
62 Correct 640 ms 94836 KB Output is correct
63 Correct 436 ms 89188 KB Output is correct
64 Correct 398 ms 89380 KB Output is correct
65 Correct 591 ms 92252 KB Output is correct
66 Correct 509 ms 92400 KB Output is correct
67 Correct 530 ms 92500 KB Output is correct
68 Correct 592 ms 94176 KB Output is correct
69 Correct 655 ms 94288 KB Output is correct
70 Correct 678 ms 91772 KB Output is correct
71 Correct 606 ms 93816 KB Output is correct
72 Correct 632 ms 93760 KB Output is correct
73 Correct 361 ms 85032 KB Output is correct
74 Correct 361 ms 86096 KB Output is correct
75 Correct 416 ms 85080 KB Output is correct
76 Correct 368 ms 85380 KB Output is correct
77 Correct 362 ms 84912 KB Output is correct
78 Correct 596 ms 87060 KB Output is correct
79 Correct 436 ms 77116 KB Output is correct
80 Correct 519 ms 84560 KB Output is correct