oj.uz

Submission #539186

# Submission time Handle Problem Language Result Execution time Memory
539186 2022-03-18T14:39:25 Z akhan42 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 206928 KB 
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>

using namespace std;
using namespace __gnu_pbds;

#define F first
#define S second
#define forn(i, n) for(int i = 0; i < n; ++i)
#define forbn(i, b, n) for(int i = b; i < n; ++i)
#define sz(v) (int)v.size()
#define pb push_back
#define mp make_pair
#define eb emplace_back
#define all(v) v.begin(), v.end()
#define min3(a, b, c) min(a, min(b, c))
#define max3(a, b, c) max(a, max(b, c))

typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef long long ll;
typedef complex<double> cd; // !!! long double slow

template <class T> inline void mineq(T &a, T b) { a = min(a, b); }
template <class T> inline void maxeq(T &a, T b) { a = max(a, b); }


int n, q;
const int INF = 1000 * 1000 * 1000 + 10;
const int MX = 2 * 1000 * 1000;
int ol[MX];


bool cmp(int v1, int v2) {
	return ol[v1] < ol[v2];
}


struct Seg {
	int mx[MX], t[MX];
	vi sl[MX];

	Seg(vi& a) {
		for(int p = n; p < 2 * n; p++) {
			mx[p] = a[p - n];
			sl[p].reserve(1);
			sl[p].pb(a[p - n]);
			t[p] = -INF;
			ol[p] = p - n;
		}

		for(int p = n - 1; p > 0; p--) {
			ol[p] = min(ol[2 * p], ol[2 * p + 1]);
			mx[p] = max(mx[2 * p], mx[2 * p + 1]);
			t[p] = max(t[2 * p], t[2 * p + 1]);
			sl[p].reserve(sz(sl[2 * p]) + sz(sl[2 * p + 1]));
			merge(all(sl[2 * p]), all(sl[2 * p + 1]), back_inserter(sl[p]));

			int ind = lower_bound(all(sl[2 * p + 1]), mx[2 * p]) - sl[2 * p + 1].begin();
			if(ind != 0)
				maxeq(t[p], mx[2 * p] + sl[2 * p + 1][ind - 1]);
		}
	}

	bool query(int l, int r, int k, int left_max) {
		vi vert;
		for (l += n, r += n + 1; l < r; l >>= 1, r >>= 1) {
			if (l & 1) {
				int v = l++;
				if(t[v] > k)
					return false;
				vert.pb(v);
			}
			if (r & 1) {
				int v = --r;
				if(t[v] > k)
					return false;
				vert.pb(v);
			}
		}
		sort(all(vert), cmp);

		for(int v: vert) {
			int ind = lower_bound(all(sl[v]), left_max) - sl[v].begin();
			if(ind != 0 && left_max + sl[v][ind - 1] > k)
				return false;

			maxeq(left_max, mx[v]);
		}

		return true;
	}
};



void solve() {
	cin >> n >> q;
	vi a(n);
	forn(i, n)
		cin >> a[i];

	Seg seg(a);

	forn(_, q) {
		int l, r, k;
		cin >> l >> r >> k;
		l--; r--;

		auto ans = seg.query(l, r, k, -INF);
		cout << ans << '\n';
	}
}


int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);

//	freopen("boards.in", "r", stdin);
//	freopen("boards.out", "w", stdout);

    int t = 1;
//  cin >> t;
    while(t--) {
        solve();
    }
}

Subtask #1
8.0 / 8.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62796 KB Output is correct
2 Correct 39 ms 62916 KB Output is correct
3 Correct 37 ms 62948 KB Output is correct
4 Correct 38 ms 62864 KB Output is correct
5 Correct 42 ms 62948 KB Output is correct
6 Correct 46 ms 62952 KB Output is correct
7 Correct 51 ms 62952 KB Output is correct
8 Correct 51 ms 62988 KB Output is correct
9 Correct 43 ms 62936 KB Output is correct
10 Correct 49 ms 62924 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62796 KB Output is correct
2 Correct 39 ms 62916 KB Output is correct
3 Correct 37 ms 62948 KB Output is correct
4 Correct 38 ms 62864 KB Output is correct
5 Correct 42 ms 62948 KB Output is correct
6 Correct 46 ms 62952 KB Output is correct
7 Correct 51 ms 62952 KB Output is correct
8 Correct 51 ms 62988 KB Output is correct
9 Correct 43 ms 62936 KB Output is correct
10 Correct 49 ms 62924 KB Output is correct
11 Correct 45 ms 63152 KB Output is correct
12 Correct 51 ms 63444 KB Output is correct
13 Correct 50 ms 63524 KB Output is correct
14 Correct 48 ms 63632 KB Output is correct
15 Correct 53 ms 63544 KB Output is correct
16 Correct 54 ms 63568 KB Output is correct
17 Correct 43 ms 63436 KB Output is correct
18 Correct 42 ms 63512 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1267 ms 206928 KB Output is correct
2 Correct 937 ms 205924 KB Output is correct
3 Correct 937 ms 205812 KB Output is correct
4 Correct 1043 ms 205928 KB Output is correct
5 Execution timed out 3079 ms 206104 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 208 ms 77020 KB Output is correct
2 Correct 163 ms 77008 KB Output is correct
3 Correct 311 ms 77040 KB Output is correct
4 Correct 319 ms 77024 KB Output is correct
5 Correct 280 ms 77008 KB Output is correct
6 Correct 151 ms 77028 KB Output is correct
7 Correct 173 ms 76932 KB Output is correct
8 Correct 224 ms 76992 KB Output is correct
9 Correct 118 ms 64212 KB Output is correct
10 Correct 195 ms 77032 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62796 KB Output is correct
2 Correct 39 ms 62916 KB Output is correct
3 Correct 37 ms 62948 KB Output is correct
4 Correct 38 ms 62864 KB Output is correct
5 Correct 42 ms 62948 KB Output is correct
6 Correct 46 ms 62952 KB Output is correct
7 Correct 51 ms 62952 KB Output is correct
8 Correct 51 ms 62988 KB Output is correct
9 Correct 43 ms 62936 KB Output is correct
10 Correct 49 ms 62924 KB Output is correct
11 Correct 45 ms 63152 KB Output is correct
12 Correct 51 ms 63444 KB Output is correct
13 Correct 50 ms 63524 KB Output is correct
14 Correct 48 ms 63632 KB Output is correct
15 Correct 53 ms 63544 KB Output is correct
16 Correct 54 ms 63568 KB Output is correct
17 Correct 43 ms 63436 KB Output is correct
18 Correct 42 ms 63512 KB Output is correct
19 Correct 349 ms 90776 KB Output is correct
20 Correct 390 ms 90776 KB Output is correct
21 Correct 331 ms 90836 KB Output is correct
22 Correct 333 ms 90840 KB Output is correct
23 Correct 300 ms 90840 KB Output is correct
24 Correct 536 ms 90712 KB Output is correct
25 Correct 579 ms 90800 KB Output is correct
26 Correct 635 ms 90816 KB Output is correct
27 Correct 643 ms 90828 KB Output is correct
28 Correct 758 ms 90796 KB Output is correct
29 Correct 683 ms 90728 KB Output is correct
30 Correct 709 ms 90832 KB Output is correct
31 Correct 669 ms 90840 KB Output is correct
32 Correct 761 ms 90844 KB Output is correct
33 Correct 625 ms 90768 KB Output is correct
34 Correct 395 ms 90824 KB Output is correct
35 Correct 358 ms 90820 KB Output is correct
36 Correct 402 ms 90840 KB Output is correct
37 Correct 310 ms 90840 KB Output is correct
38 Correct 345 ms 90804 KB Output is correct
39 Correct 436 ms 90836 KB Output is correct
40 Correct 445 ms 81392 KB Output is correct
41 Correct 318 ms 90720 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 37 ms 62796 KB Output is correct
2 Correct 39 ms 62916 KB Output is correct
3 Correct 37 ms 62948 KB Output is correct
4 Correct 38 ms 62864 KB Output is correct
5 Correct 42 ms 62948 KB Output is correct
6 Correct 46 ms 62952 KB Output is correct
7 Correct 51 ms 62952 KB Output is correct
8 Correct 51 ms 62988 KB Output is correct
9 Correct 43 ms 62936 KB Output is correct
10 Correct 49 ms 62924 KB Output is correct
11 Correct 45 ms 63152 KB Output is correct
12 Correct 51 ms 63444 KB Output is correct
13 Correct 50 ms 63524 KB Output is correct
14 Correct 48 ms 63632 KB Output is correct
15 Correct 53 ms 63544 KB Output is correct
16 Correct 54 ms 63568 KB Output is correct
17 Correct 43 ms 63436 KB Output is correct
18 Correct 42 ms 63512 KB Output is correct
19 Correct 1267 ms 206928 KB Output is correct
20 Correct 937 ms 205924 KB Output is correct
21 Correct 937 ms 205812 KB Output is correct
22 Correct 1043 ms 205928 KB Output is correct
23 Execution timed out 3079 ms 206104 KB Time limit exceeded
24 Halted 0 ms 0 KB -