oj.uz

답안 #873892

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
873892 2023-11-16T02:33:08 Z noiaint Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
100 / 100
 708 ms 96572 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 6 ms 31068 KB Output is correct
4 Correct 6 ms 31064 KB Output is correct
5 Correct 6 ms 31068 KB Output is correct
6 Correct 7 ms 31068 KB Output is correct
7 Correct 6 ms 31244 KB Output is correct
8 Correct 6 ms 31168 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 6 ms 31068 KB Output is correct
4 Correct 6 ms 31064 KB Output is correct
5 Correct 6 ms 31068 KB Output is correct
6 Correct 7 ms 31068 KB Output is correct
7 Correct 6 ms 31244 KB Output is correct
8 Correct 6 ms 31168 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 31320 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 8 ms 31324 KB Output is correct
14 Correct 8 ms 31324 KB Output is correct
15 Correct 9 ms 31500 KB Output is correct
16 Correct 8 ms 31404 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct

Subtask #3
13.0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Correct 649 ms 84984 KB Output is correct
2 Correct 639 ms 95980 KB Output is correct
3 Correct 640 ms 96080 KB Output is correct
4 Correct 641 ms 96124 KB Output is correct
5 Correct 639 ms 93892 KB Output is correct

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 46 ms 37204 KB Output is correct
2 Correct 43 ms 37880 KB Output is correct
3 Correct 41 ms 37456 KB Output is correct
4 Correct 42 ms 37356 KB Output is correct
5 Correct 42 ms 37452 KB Output is correct
6 Correct 36 ms 36944 KB Output is correct
7 Correct 35 ms 36956 KB Output is correct
8 Correct 42 ms 37132 KB Output is correct
9 Correct 29 ms 36112 KB Output is correct
10 Correct 42 ms 37100 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 6 ms 31068 KB Output is correct
4 Correct 6 ms 31064 KB Output is correct
5 Correct 6 ms 31068 KB Output is correct
6 Correct 7 ms 31068 KB Output is correct
7 Correct 6 ms 31244 KB Output is correct
8 Correct 6 ms 31168 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 31320 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 8 ms 31324 KB Output is correct
14 Correct 8 ms 31324 KB Output is correct
15 Correct 9 ms 31500 KB Output is correct
16 Correct 8 ms 31404 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 116 ms 47328 KB Output is correct
20 Correct 135 ms 47212 KB Output is correct
21 Correct 107 ms 43344 KB Output is correct
22 Correct 95 ms 43344 KB Output is correct
23 Correct 111 ms 44744 KB Output is correct
24 Correct 87 ms 43860 KB Output is correct
25 Correct 83 ms 45540 KB Output is correct
26 Correct 96 ms 45908 KB Output is correct
27 Correct 102 ms 45912 KB Output is correct
28 Correct 108 ms 46056 KB Output is correct
29 Correct 124 ms 46384 KB Output is correct
30 Correct 111 ms 46560 KB Output is correct
31 Correct 121 ms 46404 KB Output is correct
32 Correct 123 ms 46448 KB Output is correct
33 Correct 115 ms 46448 KB Output is correct
34 Correct 84 ms 45208 KB Output is correct
35 Correct 84 ms 45180 KB Output is correct
36 Correct 82 ms 45060 KB Output is correct
37 Correct 83 ms 45120 KB Output is correct
38 Correct 85 ms 45088 KB Output is correct
39 Correct 106 ms 44968 KB Output is correct
40 Correct 84 ms 41624 KB Output is correct
41 Correct 104 ms 44296 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 6 ms 31068 KB Output is correct
4 Correct 6 ms 31064 KB Output is correct
5 Correct 6 ms 31068 KB Output is correct
6 Correct 7 ms 31068 KB Output is correct
7 Correct 6 ms 31244 KB Output is correct
8 Correct 6 ms 31168 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 31320 KB Output is correct
12 Correct 7 ms 31324 KB Output is correct
13 Correct 8 ms 31324 KB Output is correct
14 Correct 8 ms 31324 KB Output is correct
15 Correct 9 ms 31500 KB Output is correct
16 Correct 8 ms 31404 KB Output is correct
17 Correct 8 ms 31324 KB Output is correct
18 Correct 8 ms 31324 KB Output is correct
19 Correct 649 ms 84984 KB Output is correct
20 Correct 639 ms 95980 KB Output is correct
21 Correct 640 ms 96080 KB Output is correct
22 Correct 641 ms 96124 KB Output is correct
23 Correct 639 ms 93892 KB Output is correct
24 Correct 46 ms 37204 KB Output is correct
25 Correct 43 ms 37880 KB Output is correct
26 Correct 41 ms 37456 KB Output is correct
27 Correct 42 ms 37356 KB Output is correct
28 Correct 42 ms 37452 KB Output is correct
29 Correct 36 ms 36944 KB Output is correct
30 Correct 35 ms 36956 KB Output is correct
31 Correct 42 ms 37132 KB Output is correct
32 Correct 29 ms 36112 KB Output is correct
33 Correct 42 ms 37100 KB Output is correct
34 Correct 116 ms 47328 KB Output is correct
35 Correct 135 ms 47212 KB Output is correct
36 Correct 107 ms 43344 KB Output is correct
37 Correct 95 ms 43344 KB Output is correct
38 Correct 111 ms 44744 KB Output is correct
39 Correct 87 ms 43860 KB Output is correct
40 Correct 83 ms 45540 KB Output is correct
41 Correct 96 ms 45908 KB Output is correct
42 Correct 102 ms 45912 KB Output is correct
43 Correct 108 ms 46056 KB Output is correct
44 Correct 124 ms 46384 KB Output is correct
45 Correct 111 ms 46560 KB Output is correct
46 Correct 121 ms 46404 KB Output is correct
47 Correct 123 ms 46448 KB Output is correct
48 Correct 115 ms 46448 KB Output is correct
49 Correct 84 ms 45208 KB Output is correct
50 Correct 84 ms 45180 KB Output is correct
51 Correct 82 ms 45060 KB Output is correct
52 Correct 83 ms 45120 KB Output is correct
53 Correct 85 ms 45088 KB Output is correct
54 Correct 106 ms 44968 KB Output is correct
55 Correct 84 ms 41624 KB Output is correct
56 Correct 104 ms 44296 KB Output is correct
57 Correct 708 ms 96572 KB Output is correct
58 Correct 692 ms 96360 KB Output is correct
59 Correct 645 ms 94548 KB Output is correct
60 Correct 603 ms 94748 KB Output is correct
61 Correct 581 ms 94852 KB Output is correct
62 Correct 563 ms 94708 KB Output is correct
63 Correct 388 ms 89596 KB Output is correct
64 Correct 409 ms 89160 KB Output is correct
65 Correct 530 ms 92340 KB Output is correct
66 Correct 525 ms 90464 KB Output is correct
67 Correct 546 ms 92732 KB Output is correct
68 Correct 603 ms 94188 KB Output is correct
69 Correct 604 ms 94388 KB Output is correct
70 Correct 580 ms 93816 KB Output is correct
71 Correct 584 ms 93856 KB Output is correct
72 Correct 577 ms 91976 KB Output is correct
73 Correct 358 ms 85072 KB Output is correct
74 Correct 370 ms 86184 KB Output is correct
75 Correct 359 ms 85076 KB Output is correct
76 Correct 357 ms 85508 KB Output is correct
77 Correct 362 ms 85024 KB Output is correct
78 Correct 543 ms 87032 KB Output is correct
79 Correct 420 ms 77012 KB Output is correct
80 Correct 552 ms 84828 KB Output is correct