oj.uz

답안 #483876

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
483876 2021-11-01T07:03:32 Z Sohsoh84 Index (COCI21_index) C++17
110 / 110
 1944 ms 139544 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef pair<ll, ll> pll;

#define all(x)                      (x).begin(),(x).end()
#define X                           first
#define Y                           second
#define sep                         ' '
#define endl                        '\n'
#define debug(x)                    cerr << #x << ": " <<  x << endl;

ll poww(ll a, ll b, ll md) {
	return (!b ? 1 : (b & 1 ? a * poww(a * a % md, b / 2, md) % md : poww(a * a % md, b / 2, md) % md));
}

const ll MAXN = 1e6 + 10;
const ll INF = 8e18;
const ll MOD = 1e9 + 7; // 998244353; // 1e9 + 9;

struct Node {
	Node *L, *R;
	int val = 0;
	Node(int t_val): L(nullptr), R(nullptr), val(t_val) {};
	Node(Node* L, Node* R): L(L), R(R), val(0) {
		if (L) val += L -> val;
		if (R) val += R -> val;
	}
};

Node* Build(int L, int R) {
	if (L == R) return new Node(0);
	int mid = (L + R) >> 1;
	return new Node(Build(L, mid), Build(mid + 1, R));
}

int Query(Node* v, int L, int R, int ql, int qr) {
	if (ql > qr) return 0;
	if (L == ql && R == qr) return v -> val;
	int mid = (L + R) >> 1;
	return Query(v -> L, L, mid, ql, min(mid, qr)) + Query(v -> R, mid + 1, R, max(ql, mid + 1), qr);
}

Node* Update(Node* v, int L, int R, int ind, int val) {
	if (L == R) return new Node(val);
	int mid = (L + R) >> 1;
	if (ind <= mid) return new Node(Update(v -> L, L, mid, ind, val), v -> R);
	else return new Node(v -> L, Update(v -> R, mid + 1, R, ind, val));
}

Node* PST[MAXN];
int n, q;
vector<pll> v;

int main() {
	ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
	cin >> n >> q;
	for (int i = 1; i <= n; i++) {
		int x;
		cin >> x;
		v.push_back({x, i});
	}

	sort(all(v));
	PST[n] = Build(1, n);
	for (int i = n - 1; i >= 0; i--) PST[i] = Update(PST[i + 1], 1, n, v[i].Y, 1);

	while (q--) {
		int tL, tR;
		cin >> tL >> tR;
		
		int L = 1, R = n;
		while (L < R) {
			int mid = (L + R + 1) >> 1;
			int ind = lower_bound(all(v), make_pair(1ll * mid, 0ll)) - v.begin();
			int cnt = Query(PST[ind], 1, n, tL, tR);
			if (cnt >= mid) L = mid;
			else R = mid - 1;
		}

		cout << L << endl;
	}
	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 4 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 3 ms 840 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 3 ms 716 KB Output is correct
10 Correct 4 ms 844 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 4 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 3 ms 840 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 3 ms 716 KB Output is correct
10 Correct 4 ms 844 KB Output is correct
11 Correct 290 ms 31800 KB Output is correct
12 Correct 253 ms 31848 KB Output is correct
13 Correct 268 ms 31808 KB Output is correct
14 Correct 265 ms 31792 KB Output is correct
15 Correct 311 ms 31816 KB Output is correct
16 Correct 278 ms 31852 KB Output is correct
17 Correct 302 ms 31756 KB Output is correct
18 Correct 283 ms 31808 KB Output is correct
19 Correct 277 ms 31812 KB Output is correct
20 Correct 249 ms 31804 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 3 ms 716 KB Output is correct
2 Correct 2 ms 716 KB Output is correct
3 Correct 4 ms 716 KB Output is correct
4 Correct 2 ms 716 KB Output is correct
5 Correct 3 ms 840 KB Output is correct
6 Correct 2 ms 716 KB Output is correct
7 Correct 3 ms 716 KB Output is correct
8 Correct 3 ms 716 KB Output is correct
9 Correct 3 ms 716 KB Output is correct
10 Correct 4 ms 844 KB Output is correct
11 Correct 290 ms 31800 KB Output is correct
12 Correct 253 ms 31848 KB Output is correct
13 Correct 268 ms 31808 KB Output is correct
14 Correct 265 ms 31792 KB Output is correct
15 Correct 311 ms 31816 KB Output is correct
16 Correct 278 ms 31852 KB Output is correct
17 Correct 302 ms 31756 KB Output is correct
18 Correct 283 ms 31808 KB Output is correct
19 Correct 277 ms 31812 KB Output is correct
20 Correct 249 ms 31804 KB Output is correct
21 Correct 1802 ms 139384 KB Output is correct
22 Correct 1759 ms 139388 KB Output is correct
23 Correct 1669 ms 139360 KB Output is correct
24 Correct 1944 ms 139372 KB Output is correct
25 Correct 1654 ms 139544 KB Output is correct
26 Correct 1670 ms 139516 KB Output is correct
27 Correct 1721 ms 139436 KB Output is correct
28 Correct 1651 ms 139404 KB Output is correct
29 Correct 1706 ms 139432 KB Output is correct
30 Correct 1564 ms 139544 KB Output is correct