oj.uz

Submission #539086

# Submission time Handle Problem Language Result Execution time Memory
539086 2022-03-18T11:31:24 Z akhan42 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 206184 KB 
#pragma GCC optimize("O3,unroll-loops")
#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")

#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].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]);
			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) {
				vert.pb(l++);
			}
			if (r & 1) {
				vert.pb(--r);
			}
		}
		sort(all(vert), cmp);

		bool ans = true;
		for(int v: vert) {
			ans = ans && t[v] <= k;
			int rp = left_max - 1, lp = k - left_max + 1;

			if(lp <= rp) {
				int indl = lower_bound(all(sl[v]), lp) - sl[v].begin();
				int indr = lower_bound(all(sl[v]), rp + 1) - sl[v].begin();

				ans = ans && indl == indr;
			}

			if(!ans)
				return ans;

			maxeq(left_max, mx[v]);
		}

		return ans;
	}
};



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 33 ms 62932 KB Output is correct
2 Correct 35 ms 62932 KB Output is correct
3 Correct 37 ms 62844 KB Output is correct
4 Correct 34 ms 62928 KB Output is correct
5 Correct 38 ms 62964 KB Output is correct
6 Correct 34 ms 62916 KB Output is correct
7 Correct 35 ms 62916 KB Output is correct
8 Correct 33 ms 62892 KB Output is correct
9 Correct 33 ms 62912 KB Output is correct
10 Correct 34 ms 62948 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 62932 KB Output is correct
2 Correct 35 ms 62932 KB Output is correct
3 Correct 37 ms 62844 KB Output is correct
4 Correct 34 ms 62928 KB Output is correct
5 Correct 38 ms 62964 KB Output is correct
6 Correct 34 ms 62916 KB Output is correct
7 Correct 35 ms 62916 KB Output is correct
8 Correct 33 ms 62892 KB Output is correct
9 Correct 33 ms 62912 KB Output is correct
10 Correct 34 ms 62948 KB Output is correct
11 Correct 38 ms 63016 KB Output is correct
12 Correct 39 ms 63476 KB Output is correct
13 Correct 43 ms 63496 KB Output is correct
14 Correct 43 ms 63460 KB Output is correct
15 Correct 41 ms 63444 KB Output is correct
16 Correct 40 ms 63460 KB Output is correct
17 Correct 38 ms 63328 KB Output is correct
18 Correct 42 ms 63536 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Correct 1967 ms 206140 KB Output is correct
2 Correct 1964 ms 206184 KB Output is correct
3 Correct 1969 ms 206068 KB Output is correct
4 Correct 2005 ms 206048 KB Output is correct
5 Execution timed out 3068 ms 205208 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 184 ms 76128 KB Output is correct
2 Correct 184 ms 76164 KB Output is correct
3 Correct 229 ms 76128 KB Output is correct
4 Correct 228 ms 76224 KB Output is correct
5 Correct 228 ms 76176 KB Output is correct
6 Correct 151 ms 76316 KB Output is correct
7 Correct 157 ms 76228 KB Output is correct
8 Correct 179 ms 76112 KB Output is correct
9 Correct 79 ms 63292 KB Output is correct
10 Correct 151 ms 76168 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 62932 KB Output is correct
2 Correct 35 ms 62932 KB Output is correct
3 Correct 37 ms 62844 KB Output is correct
4 Correct 34 ms 62928 KB Output is correct
5 Correct 38 ms 62964 KB Output is correct
6 Correct 34 ms 62916 KB Output is correct
7 Correct 35 ms 62916 KB Output is correct
8 Correct 33 ms 62892 KB Output is correct
9 Correct 33 ms 62912 KB Output is correct
10 Correct 34 ms 62948 KB Output is correct
11 Correct 38 ms 63016 KB Output is correct
12 Correct 39 ms 63476 KB Output is correct
13 Correct 43 ms 63496 KB Output is correct
14 Correct 43 ms 63460 KB Output is correct
15 Correct 41 ms 63444 KB Output is correct
16 Correct 40 ms 63460 KB Output is correct
17 Correct 38 ms 63328 KB Output is correct
18 Correct 42 ms 63536 KB Output is correct
19 Correct 422 ms 90256 KB Output is correct
20 Correct 399 ms 90228 KB Output is correct
21 Correct 349 ms 90264 KB Output is correct
22 Correct 362 ms 90216 KB Output is correct
23 Correct 368 ms 90220 KB Output is correct
24 Correct 361 ms 90212 KB Output is correct
25 Correct 385 ms 90320 KB Output is correct
26 Correct 469 ms 90272 KB Output is correct
27 Correct 488 ms 90276 KB Output is correct
28 Correct 584 ms 90384 KB Output is correct
29 Correct 532 ms 90232 KB Output is correct
30 Correct 518 ms 90276 KB Output is correct
31 Correct 569 ms 90260 KB Output is correct
32 Correct 526 ms 90220 KB Output is correct
33 Correct 559 ms 90276 KB Output is correct
34 Correct 328 ms 90256 KB Output is correct
35 Correct 347 ms 90176 KB Output is correct
36 Correct 321 ms 90184 KB Output is correct
37 Correct 376 ms 90240 KB Output is correct
38 Correct 335 ms 90176 KB Output is correct
39 Correct 326 ms 90328 KB Output is correct
40 Correct 259 ms 80504 KB Output is correct
41 Correct 288 ms 90208 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 33 ms 62932 KB Output is correct
2 Correct 35 ms 62932 KB Output is correct
3 Correct 37 ms 62844 KB Output is correct
4 Correct 34 ms 62928 KB Output is correct
5 Correct 38 ms 62964 KB Output is correct
6 Correct 34 ms 62916 KB Output is correct
7 Correct 35 ms 62916 KB Output is correct
8 Correct 33 ms 62892 KB Output is correct
9 Correct 33 ms 62912 KB Output is correct
10 Correct 34 ms 62948 KB Output is correct
11 Correct 38 ms 63016 KB Output is correct
12 Correct 39 ms 63476 KB Output is correct
13 Correct 43 ms 63496 KB Output is correct
14 Correct 43 ms 63460 KB Output is correct
15 Correct 41 ms 63444 KB Output is correct
16 Correct 40 ms 63460 KB Output is correct
17 Correct 38 ms 63328 KB Output is correct
18 Correct 42 ms 63536 KB Output is correct
19 Correct 1967 ms 206140 KB Output is correct
20 Correct 1964 ms 206184 KB Output is correct
21 Correct 1969 ms 206068 KB Output is correct
22 Correct 2005 ms 206048 KB Output is correct
23 Execution timed out 3068 ms 205208 KB Time limit exceeded
24 Halted 0 ms 0 KB -