oj.uz

답안 #403925

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
403925 2021-05-13T15:12:32 Z silverfish Index (COCI21_index) C++14
110 / 110
 2378 ms 137436 KB 
#include <bits/stdc++.h>
using namespace std;

/*<DEBUG>*/
#define tem template <typename 
#define can_shift(_X_, ...) enable_if_t<sizeof test<_X_>(0) __VA_ARGS__ 8, debug&> operator<<(T i)
#define _op debug& operator<<
tem C > auto test(C *x) -> decltype(cerr << *x, 0LL);
tem C > char test(...);
tem C > struct itr{C begin, end; };
tem C > itr<C> get_range(C b, C e) { return itr<C>{b, e}; }
struct debug{
#ifdef _LOCAL
	~debug(){ cerr << endl; }
	tem T > can_shift(T, ==){ cerr << boolalpha << i; return *this; }
	tem T> can_shift(T, !=){ return *this << get_range(begin(i), end(i)); }
	tem T, typename U > _op (pair<T, U> i){ 
		return *this << "< " << i.first << " , " << i.second << " >"; }
	tem T> _op (itr<T> i){
		*this <<  "{ ";
		for(auto it = i.begin; it != i.end; it++){
			*this << " , " + (it==i.begin?2:0) << *it;
		}
		return *this << " }";
	}
#else
tem T> _op (const T&) { return *this; }
#endif 
};

string _ARR_(int* arr, int sz){
	string ret = "{ " + to_string(arr[0]); 
	for(int i = 1; i < sz; i++) ret += " , " +  to_string(arr[i]);
	ret += " }"; return ret;
}

#define exp(...) " [ " << #__VA_ARGS__ << " : " << (__VA_ARGS__) << " ]"
/*</DEBUG>*/

typedef long long ll;
typedef unsigned long long ull;
typedef unsigned int uint;
typedef pair<int, int> pii;
//mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

#define pb push_back
#define FAST ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0)
#define TC int __TC__; cin >> __TC__; while(__TC__--)
#define ar array

const int INF = 1e9 + 7, N = 2e5;

int n, q, p[N];

struct node{
	node* left = nullptr,* right = nullptr;
	int v = 0;
};

node* root[N+1];

void build(node *rt, int lx, int rx){
	if(lx == rx) return;
	int m = lx+(rx-lx) / 2;

	rt->left = new node;
	rt->right = new node;
	build(rt->left, lx, m);
	build(rt->right, m+1, rx);
	return;
}


void add(int pos, node* lr, node* nr, int lx, int rx){
	if(lx == rx){
		++nr->v;
		debug() << exp(pos) exp(nr->v);
		return;
	}

	int m = lx + (rx - lx) / 2;

	if(pos <= m){ // go left
		nr->right = lr->right;
		nr->left = new node;
		nr->left->v = lr->left->v;
		add(pos, lr->left, nr->left, lx, m);
	}else{ // go right
		nr->left = lr->left;
		nr->right = new node;
		nr->right->v = lr->right->v;
		add(pos, lr->right, nr->right, m+1, rx);
	}
	nr->v = nr->left->v + nr->right->v;
}

int get(int l, int r, node* rt, int lx, int rx){
	if(r < lx || l > rx) return 0;
	if(lx >= l && rx <= r) return rt->v;
	int m = lx + (rx - lx) / 2;

	return get(l, r, rt->left, lx, m) + get(l, r, rt->right, m+1, rx);
}

int main(void)
{
	FAST;
	cin >> n >> q;

	for(int i = 0; i < n; ++i){
		cin >> p[i];
	}

	root[0] = new node;

	build(root[0], 1, N);

	for(int i = 1; i <= n; ++i){
		root[i] = new node;	
		debug() << exp(p[i-1]);
		add(p[i-1], root[i-1], root[i], 1, N); 
		debug() << exp(root[i]->v);
	}
	
	while(q--){
		int l, r; cin >> l >> r;
		int ans = 0;
		for(int j = 18; j >= 0; --j){
			int nans = ans + (1<<j);
			if(nans > N) continue;
			if(get(nans, N, root[r], 1, N) - get(nans, N, root[l-1], 1, N) >= nans) ans += (1<<j);
		}
		cout << ans << '\n';
	}

	return 0;
}

Subtask #1
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 13388 KB Output is correct
2 Correct 23 ms 13388 KB Output is correct
3 Correct 22 ms 13408 KB Output is correct
4 Correct 25 ms 13376 KB Output is correct
5 Correct 23 ms 13468 KB Output is correct
6 Correct 29 ms 13384 KB Output is correct
7 Correct 25 ms 13444 KB Output is correct
8 Correct 32 ms 13408 KB Output is correct
9 Correct 24 ms 13460 KB Output is correct
10 Correct 26 ms 13400 KB Output is correct

Subtask #2
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 13388 KB Output is correct
2 Correct 23 ms 13388 KB Output is correct
3 Correct 22 ms 13408 KB Output is correct
4 Correct 25 ms 13376 KB Output is correct
5 Correct 23 ms 13468 KB Output is correct
6 Correct 29 ms 13384 KB Output is correct
7 Correct 25 ms 13444 KB Output is correct
8 Correct 32 ms 13408 KB Output is correct
9 Correct 24 ms 13460 KB Output is correct
10 Correct 26 ms 13400 KB Output is correct
11 Correct 457 ms 43668 KB Output is correct
12 Correct 440 ms 43768 KB Output is correct
13 Correct 438 ms 43784 KB Output is correct
14 Correct 467 ms 43732 KB Output is correct
15 Correct 447 ms 43756 KB Output is correct
16 Correct 419 ms 43752 KB Output is correct
17 Correct 416 ms 43748 KB Output is correct
18 Correct 432 ms 43744 KB Output is correct
19 Correct 415 ms 43856 KB Output is correct
20 Correct 431 ms 43756 KB Output is correct

Subtask #3
50.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Correct 29 ms 13388 KB Output is correct
2 Correct 23 ms 13388 KB Output is correct
3 Correct 22 ms 13408 KB Output is correct
4 Correct 25 ms 13376 KB Output is correct
5 Correct 23 ms 13468 KB Output is correct
6 Correct 29 ms 13384 KB Output is correct
7 Correct 25 ms 13444 KB Output is correct
8 Correct 32 ms 13408 KB Output is correct
9 Correct 24 ms 13460 KB Output is correct
10 Correct 26 ms 13400 KB Output is correct
11 Correct 457 ms 43668 KB Output is correct
12 Correct 440 ms 43768 KB Output is correct
13 Correct 438 ms 43784 KB Output is correct
14 Correct 467 ms 43732 KB Output is correct
15 Correct 447 ms 43756 KB Output is correct
16 Correct 419 ms 43752 KB Output is correct
17 Correct 416 ms 43748 KB Output is correct
18 Correct 432 ms 43744 KB Output is correct
19 Correct 415 ms 43856 KB Output is correct
20 Correct 431 ms 43756 KB Output is correct
21 Correct 2371 ms 134680 KB Output is correct
22 Correct 2378 ms 134316 KB Output is correct
23 Correct 2261 ms 137020 KB Output is correct
24 Correct 2140 ms 137156 KB Output is correct
25 Correct 2112 ms 137096 KB Output is correct
26 Correct 2117 ms 137132 KB Output is correct
27 Correct 2110 ms 137128 KB Output is correct
28 Correct 2098 ms 137436 KB Output is correct
29 Correct 2100 ms 137124 KB Output is correct
30 Correct 2096 ms 137036 KB Output is correct