oj.uz

Submission #539082

# Submission time Handle Problem Language Result Execution time Memory
539082 2022-03-18T11:26:38 Z akhan42 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 3000 ms 227792 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;
			}

			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 35 ms 62932 KB Output is correct
2 Correct 35 ms 62936 KB Output is correct
3 Correct 34 ms 62892 KB Output is correct
4 Correct 36 ms 62856 KB Output is correct
5 Correct 35 ms 62868 KB Output is correct
6 Correct 37 ms 62932 KB Output is correct
7 Correct 37 ms 63052 KB Output is correct
8 Correct 36 ms 62948 KB Output is correct
9 Correct 34 ms 62888 KB Output is correct
10 Correct 35 ms 62932 KB Output is correct

Subtask #2
9.0 / 9.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 62932 KB Output is correct
2 Correct 35 ms 62936 KB Output is correct
3 Correct 34 ms 62892 KB Output is correct
4 Correct 36 ms 62856 KB Output is correct
5 Correct 35 ms 62868 KB Output is correct
6 Correct 37 ms 62932 KB Output is correct
7 Correct 37 ms 63052 KB Output is correct
8 Correct 36 ms 62948 KB Output is correct
9 Correct 34 ms 62888 KB Output is correct
10 Correct 35 ms 62932 KB Output is correct
11 Correct 38 ms 63052 KB Output is correct
12 Correct 41 ms 63588 KB Output is correct
13 Correct 43 ms 63572 KB Output is correct
14 Correct 43 ms 63596 KB Output is correct
15 Correct 45 ms 63668 KB Output is correct
16 Correct 39 ms 63536 KB Output is correct
17 Correct 40 ms 63440 KB Output is correct
18 Correct 42 ms 63676 KB Output is correct

Subtask #3
0 / 13.0

# Verdict Execution time Memory Grader output
1 Execution timed out 3112 ms 227792 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# Verdict Execution time Memory Grader output
1 Correct 318 ms 78220 KB Output is correct
2 Correct 296 ms 78176 KB Output is correct
3 Correct 232 ms 78220 KB Output is correct
4 Correct 233 ms 78200 KB Output is correct
5 Correct 225 ms 78236 KB Output is correct
6 Correct 191 ms 78060 KB Output is correct
7 Correct 180 ms 78160 KB Output is correct
8 Correct 223 ms 77896 KB Output is correct
9 Correct 81 ms 64460 KB Output is correct
10 Correct 185 ms 77804 KB Output is correct

Subtask #5
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 62932 KB Output is correct
2 Correct 35 ms 62936 KB Output is correct
3 Correct 34 ms 62892 KB Output is correct
4 Correct 36 ms 62856 KB Output is correct
5 Correct 35 ms 62868 KB Output is correct
6 Correct 37 ms 62932 KB Output is correct
7 Correct 37 ms 63052 KB Output is correct
8 Correct 36 ms 62948 KB Output is correct
9 Correct 34 ms 62888 KB Output is correct
10 Correct 35 ms 62932 KB Output is correct
11 Correct 38 ms 63052 KB Output is correct
12 Correct 41 ms 63588 KB Output is correct
13 Correct 43 ms 63572 KB Output is correct
14 Correct 43 ms 63596 KB Output is correct
15 Correct 45 ms 63668 KB Output is correct
16 Correct 39 ms 63536 KB Output is correct
17 Correct 40 ms 63440 KB Output is correct
18 Correct 42 ms 63676 KB Output is correct
19 Correct 831 ms 96864 KB Output is correct
20 Correct 773 ms 96916 KB Output is correct
21 Correct 612 ms 96716 KB Output is correct
22 Correct 633 ms 96704 KB Output is correct
23 Correct 597 ms 96740 KB Output is correct
24 Correct 385 ms 96592 KB Output is correct
25 Correct 375 ms 96716 KB Output is correct
26 Correct 476 ms 96660 KB Output is correct
27 Correct 497 ms 96696 KB Output is correct
28 Correct 506 ms 96732 KB Output is correct
29 Correct 494 ms 96832 KB Output is correct
30 Correct 486 ms 97040 KB Output is correct
31 Correct 538 ms 96784 KB Output is correct
32 Correct 514 ms 96976 KB Output is correct
33 Correct 500 ms 96844 KB Output is correct
34 Correct 362 ms 96464 KB Output is correct
35 Correct 371 ms 96436 KB Output is correct
36 Correct 355 ms 96284 KB Output is correct
37 Correct 359 ms 96216 KB Output is correct
38 Correct 375 ms 96360 KB Output is correct
39 Correct 434 ms 95336 KB Output is correct
40 Correct 219 ms 85060 KB Output is correct
41 Correct 395 ms 95000 KB Output is correct

Subtask #6
0 / 23.0

# Verdict Execution time Memory Grader output
1 Correct 35 ms 62932 KB Output is correct
2 Correct 35 ms 62936 KB Output is correct
3 Correct 34 ms 62892 KB Output is correct
4 Correct 36 ms 62856 KB Output is correct
5 Correct 35 ms 62868 KB Output is correct
6 Correct 37 ms 62932 KB Output is correct
7 Correct 37 ms 63052 KB Output is correct
8 Correct 36 ms 62948 KB Output is correct
9 Correct 34 ms 62888 KB Output is correct
10 Correct 35 ms 62932 KB Output is correct
11 Correct 38 ms 63052 KB Output is correct
12 Correct 41 ms 63588 KB Output is correct
13 Correct 43 ms 63572 KB Output is correct
14 Correct 43 ms 63596 KB Output is correct
15 Correct 45 ms 63668 KB Output is correct
16 Correct 39 ms 63536 KB Output is correct
17 Correct 40 ms 63440 KB Output is correct
18 Correct 42 ms 63676 KB Output is correct
19 Execution timed out 3112 ms 227792 KB Time limit exceeded
20 Halted 0 ms 0 KB -