oj.uz

답안 #541355

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
541355 2022-03-23T08:13:02 Z akhan42 Hedgehog Daniyar and Algorithms (IZhO19_sortbooks) C++17
64 / 100
 792 ms 262144 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 MXd2 = 1000 * 1000;
const int MX = 2 * MXd2;
int ol[MX], oright[MX];
vector<bool> ans(MXd2, true);
vii mx2vq[MXd2];
vii v2mxq[MX];
int Ks[MX];
vi vals;
vi a;


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


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

	Seg() {
		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] = -1;
			oright[p] = ol[p] = p - n;
		}

		for(int p = n - 1; p > 0; p--) {
			ol[p] = min(ol[2 * p], ol[2 * p + 1]);
			oright[p] = max(oright[2 * p], oright[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], vals[mx[2 * p]] + vals[sl[2 * p + 1][ind - 1]]);
		}

		forbn(p, 1, n)
			vi().swap(sl[p]);
	}

	void query(int l, int r, int k, int left_max, int q) {
		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);

		for(int v: vert) {
			if(t[v] > k) {
				ans[q] = false;
				return;
			}

			if(left_max != -1) {
				mx2vq[left_max].eb(v, q);
			}

			maxeq(left_max, mx[v]);
		}
	}


	void process() {
		for(int lm = sz(vals) - 1; lm >= 0; --lm) {
			if(lm != sz(vals) - 1)
				vii().swap(mx2vq[lm + 1]);
			for(ii p: mx2vq[lm]) {
				if(ans[p.S])
					v2mxq[p.F].eb(lm, p.S);
			}
		}
		vii().swap(mx2vq[0]);

		for(int p = 2 * n - 1; p > 0; p--) {
			if(p < n) {
				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]));
				vi().swap(sl[2 * p]);
				vi().swap(sl[2 * p + 1]);
			}
			else {
				sl[p].reserve(1);
				sl[p].pb(a[p - n]);
			}

			int x = sz(sl[p]) - 1;
			forn(w, sz(v2mxq[p])) {
				int lm = v2mxq[p][w].F, q = v2mxq[p][w].S;
				int k = Ks[q];
				if(!ans[q])
					continue;

				while(x >= 0 && sl[p][x] >= lm)
					x--;

				if(x < 0)
					break;

				if(vals[sl[p][x]] >= k - vals[lm] + 1) {
					ans[q] = false;
				}
			}

			vii().swap(v2mxq[p]);
		}
	}
};


int v2c(int v) {
	return lower_bound(all(vals), v) - vals.begin();
}


void solve() {
	cin >> n >> Q;
	a.resize(n);
	forn(i, n) {
		cin >> a[i];
		vals.pb(a[i]);
	}
	sort(all(vals));
	vals.erase(unique(all(vals)), vals.end());

	forn(i, n)
		a[i] = v2c(a[i]);

	Seg seg;

	int QQ = Q / 4;
	forn(q, Q) {
		int l, r, k;
		cin >> l >> r >> k;
		l--; r--;
		Ks[q] = k;

		seg.query(l, r, k, -1, q);

		if(q == QQ || q == 2 * QQ || q == 3 * QQ)
			seg.process();
	}

	seg.process();
	forn(i, Q) {
		cout << ans[i] << '\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

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 133460 KB Output is correct
2 Correct 63 ms 133420 KB Output is correct
3 Correct 67 ms 133476 KB Output is correct
4 Correct 66 ms 133436 KB Output is correct
5 Correct 65 ms 133516 KB Output is correct
6 Correct 72 ms 133568 KB Output is correct
7 Correct 68 ms 133540 KB Output is correct
8 Correct 64 ms 133476 KB Output is correct
9 Correct 72 ms 133572 KB Output is correct
10 Correct 65 ms 133516 KB Output is correct

Subtask #2
9.0 / 9.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 133460 KB Output is correct
2 Correct 63 ms 133420 KB Output is correct
3 Correct 67 ms 133476 KB Output is correct
4 Correct 66 ms 133436 KB Output is correct
5 Correct 65 ms 133516 KB Output is correct
6 Correct 72 ms 133568 KB Output is correct
7 Correct 68 ms 133540 KB Output is correct
8 Correct 64 ms 133476 KB Output is correct
9 Correct 72 ms 133572 KB Output is correct
10 Correct 65 ms 133516 KB Output is correct
11 Correct 68 ms 133708 KB Output is correct
12 Correct 82 ms 134080 KB Output is correct
13 Correct 72 ms 134156 KB Output is correct
14 Correct 76 ms 134228 KB Output is correct
15 Correct 75 ms 134348 KB Output is correct
16 Correct 75 ms 134240 KB Output is correct
17 Correct 72 ms 134092 KB Output is correct
18 Correct 74 ms 134180 KB Output is correct

Subtask #3
0 / 13.0

# 결과 실행 시간 메모리 Grader output
1 Runtime error 624 ms 262144 KB Execution killed with signal 9
2 Halted 0 ms 0 KB -

Subtask #4
17.0 / 17.0

# 결과 실행 시간 메모리 Grader output
1 Correct 307 ms 147584 KB Output is correct
2 Correct 302 ms 147584 KB Output is correct
3 Correct 335 ms 147524 KB Output is correct
4 Correct 324 ms 147872 KB Output is correct
5 Correct 326 ms 147540 KB Output is correct
6 Correct 259 ms 147396 KB Output is correct
7 Correct 249 ms 147468 KB Output is correct
8 Correct 289 ms 149484 KB Output is correct
9 Correct 121 ms 134936 KB Output is correct
10 Correct 281 ms 148128 KB Output is correct

Subtask #5
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 133460 KB Output is correct
2 Correct 63 ms 133420 KB Output is correct
3 Correct 67 ms 133476 KB Output is correct
4 Correct 66 ms 133436 KB Output is correct
5 Correct 65 ms 133516 KB Output is correct
6 Correct 72 ms 133568 KB Output is correct
7 Correct 68 ms 133540 KB Output is correct
8 Correct 64 ms 133476 KB Output is correct
9 Correct 72 ms 133572 KB Output is correct
10 Correct 65 ms 133516 KB Output is correct
11 Correct 68 ms 133708 KB Output is correct
12 Correct 82 ms 134080 KB Output is correct
13 Correct 72 ms 134156 KB Output is correct
14 Correct 76 ms 134228 KB Output is correct
15 Correct 75 ms 134348 KB Output is correct
16 Correct 75 ms 134240 KB Output is correct
17 Correct 72 ms 134092 KB Output is correct
18 Correct 74 ms 134180 KB Output is correct
19 Correct 654 ms 162428 KB Output is correct
20 Correct 655 ms 162492 KB Output is correct
21 Correct 627 ms 162492 KB Output is correct
22 Correct 643 ms 162472 KB Output is correct
23 Correct 616 ms 162424 KB Output is correct
24 Correct 585 ms 162496 KB Output is correct
25 Correct 612 ms 162396 KB Output is correct
26 Correct 724 ms 162820 KB Output is correct
27 Correct 721 ms 162728 KB Output is correct
28 Correct 775 ms 162544 KB Output is correct
29 Correct 770 ms 162496 KB Output is correct
30 Correct 784 ms 162424 KB Output is correct
31 Correct 792 ms 162572 KB Output is correct
32 Correct 786 ms 162432 KB Output is correct
33 Correct 786 ms 162428 KB Output is correct
34 Correct 528 ms 162576 KB Output is correct
35 Correct 533 ms 162400 KB Output is correct
36 Correct 525 ms 162312 KB Output is correct
37 Correct 518 ms 162488 KB Output is correct
38 Correct 522 ms 162548 KB Output is correct
39 Correct 632 ms 162488 KB Output is correct
40 Correct 470 ms 152292 KB Output is correct
41 Correct 503 ms 162768 KB Output is correct

Subtask #6
0 / 23.0

# 결과 실행 시간 메모리 Grader output
1 Correct 65 ms 133460 KB Output is correct
2 Correct 63 ms 133420 KB Output is correct
3 Correct 67 ms 133476 KB Output is correct
4 Correct 66 ms 133436 KB Output is correct
5 Correct 65 ms 133516 KB Output is correct
6 Correct 72 ms 133568 KB Output is correct
7 Correct 68 ms 133540 KB Output is correct
8 Correct 64 ms 133476 KB Output is correct
9 Correct 72 ms 133572 KB Output is correct
10 Correct 65 ms 133516 KB Output is correct
11 Correct 68 ms 133708 KB Output is correct
12 Correct 82 ms 134080 KB Output is correct
13 Correct 72 ms 134156 KB Output is correct
14 Correct 76 ms 134228 KB Output is correct
15 Correct 75 ms 134348 KB Output is correct
16 Correct 75 ms 134240 KB Output is correct
17 Correct 72 ms 134092 KB Output is correct
18 Correct 74 ms 134180 KB Output is correct
19 Runtime error 624 ms 262144 KB Execution killed with signal 9
20 Halted 0 ms 0 KB -