oj.uz

답안 #839430

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
839430 2023-08-30T03:00:48 Z daoquanglinh2007 Examination (JOI19_examination) C++17
43 / 100
 3000 ms 89604 KB 
#include <bits/stdc++.h>
using namespace std;

#define getbit(x, i) ((x&(1<<(i))) != 0)

const int NM = 3e5, SZ = 550, LOG = 18;

struct node{
	mutable int cnt, nxt[2];
	node(int a, int b, int c){
		cnt = a, nxt[0] = b, nxt[1] = c;
	}
};

struct trie{
	vector <node> T;
	void add_node(){
		T.push_back(node(0, -1, -1));
	}
	void init(){
		T.clear();
		add_node();
	}
	void add_int(int x){
		int cur = 0;
		for (int i = LOG; i >= 0; i--){
			T[cur].cnt++;
			int k = getbit(x, i);
			if (T[cur].nxt[k] == -1){
				add_node();
				T[cur].nxt[k] = T.size()-1;
			}
			cur = T[cur].nxt[k];
		}
		T[cur].cnt++;
	}
	int get(int x){
		int cur = 0, res = 0;
		for (int i = LOG; i >= 0; i--){
			int k = getbit(x, i);
			if (k == 0){
				if (T[cur].nxt[1] != -1) res += T[T[cur].nxt[1]].cnt;
			}
			if (T[cur].nxt[k] == -1) return res;
			cur = T[cur].nxt[k];
		}
		res += T[cur].cnt;
		return res;
	}
};

int N, Q;
int S[NM+5], T[NM+5], sum[NM+5], X[NM+5], Y[NM+5], Z[NM+5];
map <int, bool> mark;
vector <int> sorted_arr, id1, id2;
int ans[NM+5];
trie T1[NM+5], T2[SZ+5];

int get(int x){
	if (sorted_arr.back() < x) return -1;
	return lower_bound(sorted_arr.begin(), sorted_arr.end(), x)-sorted_arr.begin();
}

bool cmp1(int x, int y){
	return S[x] > S[y];
}

bool cmp2(int x, int y){
	return X[x] > X[y];
}

int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> N >> Q;
	for (int i = 1; i <= N; i++){
		cin >> S[i] >> T[i];
		if (!mark[S[i]]){
			sorted_arr.push_back(S[i]);
			mark[S[i]] = 1;
		}
		if (!mark[T[i]]){
			sorted_arr.push_back(T[i]);
			mark[T[i]] = 1;
		}
		sum[i] = S[i]+T[i];
		if (!mark[sum[i]]){
			sorted_arr.push_back(sum[i]);
			mark[sum[i]] = 1;
		}
		id1.push_back(i);
	}
	sort(sorted_arr.begin(), sorted_arr.end());
	for (int i = 1; i <= N; i++){
		S[i] = lower_bound(sorted_arr.begin(), sorted_arr.end(), S[i])-sorted_arr.begin();
		T[i] = lower_bound(sorted_arr.begin(), sorted_arr.end(), T[i])-sorted_arr.begin();
		sum[i] = lower_bound(sorted_arr.begin(), sorted_arr.end(), sum[i])-sorted_arr.begin();
	}
	for (int i = 1; i <= Q; i++){
		cin >> X[i] >> Y[i] >> Z[i];
		X[i] = get(X[i]);
		Y[i] = get(Y[i]);
		Z[i] = get(Z[i]);
		if (X[i] == -1 || Y[i] == -1 || Z[i] == -1){
			ans[i] = 0;
		}
		else{
			id2.push_back(i);
		}
	}
	for (int i = 0; i < sorted_arr.size(); i++)
		T1[i].init();
	for (int i = 0; i < SZ; i++)
		T2[i].init();
	sort(id1.begin(), id1.end(), cmp1);
	sort(id2.begin(), id2.end(), cmp2);
	
	int jj = 0;
	for (int ii = 0; ii < id2.size(); ii++){
		int i = id2[ii];
		while (jj < id1.size()){
			int j = id1[jj];
			if (S[j] < X[i]) break;
			T1[T[j]].add_int(sum[j]);
			T2[T[j]/SZ].add_int(sum[j]);
			jj++;
		}
		ans[i] = 0;
		int L = (Y[i]+SZ-1)/SZ;
		for (int k = L; k < SZ; k++)
			ans[i] += T2[k].get(Z[i]);
		for (int k = Y[i]; k < min((int)sorted_arr.size(), L*SZ); k++)
			ans[i] += T1[k].get(Z[i]);
	}
	for (int i = 1; i <= Q; i++) cout << ans[i] << '\n';
	return 0;
}

Compilation message

examination.cpp: In function 'int main()':
examination.cpp:112:20: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  112 |  for (int i = 0; i < sorted_arr.size(); i++)
      |                  ~~^~~~~~~~~~~~~~~~~~~
examination.cpp:120:22: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  120 |  for (int ii = 0; ii < id2.size(); ii++){
      |                   ~~~^~~~~~~~~~~~
examination.cpp:122:13: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
  122 |   while (jj < id1.size()){
      |          ~~~^~~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7412 KB Output is correct
5 Correct 3 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 22 ms 9704 KB Output is correct
8 Correct 22 ms 9720 KB Output is correct
9 Correct 23 ms 9720 KB Output is correct
10 Correct 16 ms 8504 KB Output is correct
11 Correct 19 ms 9324 KB Output is correct
12 Correct 9 ms 7584 KB Output is correct
13 Correct 20 ms 9708 KB Output is correct
14 Correct 19 ms 9684 KB Output is correct
15 Correct 18 ms 9664 KB Output is correct
16 Correct 19 ms 9044 KB Output is correct
17 Correct 16 ms 7972 KB Output is correct
18 Correct 5 ms 7508 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 993 ms 67432 KB Output is correct
2 Correct 1133 ms 67424 KB Output is correct
3 Correct 923 ms 67412 KB Output is correct
4 Correct 404 ms 28552 KB Output is correct
5 Correct 789 ms 45116 KB Output is correct
6 Correct 200 ms 11588 KB Output is correct
7 Correct 1288 ms 67220 KB Output is correct
8 Correct 858 ms 67200 KB Output is correct
9 Correct 1258 ms 67508 KB Output is correct
10 Correct 764 ms 41764 KB Output is correct
11 Correct 276 ms 20136 KB Output is correct
12 Correct 62 ms 10820 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 993 ms 67432 KB Output is correct
2 Correct 1133 ms 67424 KB Output is correct
3 Correct 923 ms 67412 KB Output is correct
4 Correct 404 ms 28552 KB Output is correct
5 Correct 789 ms 45116 KB Output is correct
6 Correct 200 ms 11588 KB Output is correct
7 Correct 1288 ms 67220 KB Output is correct
8 Correct 858 ms 67200 KB Output is correct
9 Correct 1258 ms 67508 KB Output is correct
10 Correct 764 ms 41764 KB Output is correct
11 Correct 276 ms 20136 KB Output is correct
12 Correct 62 ms 10820 KB Output is correct
13 Correct 1736 ms 67192 KB Output is correct
14 Correct 1248 ms 67452 KB Output is correct
15 Correct 1083 ms 67596 KB Output is correct
16 Correct 411 ms 28640 KB Output is correct
17 Correct 1158 ms 45120 KB Output is correct
18 Correct 223 ms 11600 KB Output is correct
19 Correct 1610 ms 67360 KB Output is correct
20 Correct 1410 ms 67204 KB Output is correct
21 Correct 1783 ms 67292 KB Output is correct
22 Correct 860 ms 41928 KB Output is correct
23 Correct 301 ms 20148 KB Output is correct
24 Correct 50 ms 10816 KB Output is correct

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 4 ms 7380 KB Output is correct
2 Correct 5 ms 7380 KB Output is correct
3 Correct 3 ms 7380 KB Output is correct
4 Correct 3 ms 7412 KB Output is correct
5 Correct 3 ms 7380 KB Output is correct
6 Correct 3 ms 7380 KB Output is correct
7 Correct 22 ms 9704 KB Output is correct
8 Correct 22 ms 9720 KB Output is correct
9 Correct 23 ms 9720 KB Output is correct
10 Correct 16 ms 8504 KB Output is correct
11 Correct 19 ms 9324 KB Output is correct
12 Correct 9 ms 7584 KB Output is correct
13 Correct 20 ms 9708 KB Output is correct
14 Correct 19 ms 9684 KB Output is correct
15 Correct 18 ms 9664 KB Output is correct
16 Correct 19 ms 9044 KB Output is correct
17 Correct 16 ms 7972 KB Output is correct
18 Correct 5 ms 7508 KB Output is correct
19 Correct 993 ms 67432 KB Output is correct
20 Correct 1133 ms 67424 KB Output is correct
21 Correct 923 ms 67412 KB Output is correct
22 Correct 404 ms 28552 KB Output is correct
23 Correct 789 ms 45116 KB Output is correct
24 Correct 200 ms 11588 KB Output is correct
25 Correct 1288 ms 67220 KB Output is correct
26 Correct 858 ms 67200 KB Output is correct
27 Correct 1258 ms 67508 KB Output is correct
28 Correct 764 ms 41764 KB Output is correct
29 Correct 276 ms 20136 KB Output is correct
30 Correct 62 ms 10820 KB Output is correct
31 Correct 1736 ms 67192 KB Output is correct
32 Correct 1248 ms 67452 KB Output is correct
33 Correct 1083 ms 67596 KB Output is correct
34 Correct 411 ms 28640 KB Output is correct
35 Correct 1158 ms 45120 KB Output is correct
36 Correct 223 ms 11600 KB Output is correct
37 Correct 1610 ms 67360 KB Output is correct
38 Correct 1410 ms 67204 KB Output is correct
39 Correct 1783 ms 67292 KB Output is correct
40 Correct 860 ms 41928 KB Output is correct
41 Correct 301 ms 20148 KB Output is correct
42 Correct 50 ms 10816 KB Output is correct
43 Correct 1750 ms 89472 KB Output is correct
44 Correct 2129 ms 89544 KB Output is correct
45 Correct 1346 ms 89508 KB Output is correct
46 Correct 455 ms 41060 KB Output is correct
47 Correct 919 ms 70836 KB Output is correct
48 Correct 109 ms 11212 KB Output is correct
49 Correct 2154 ms 89596 KB Output is correct
50 Correct 2173 ms 89604 KB Output is correct
51 Execution timed out 3087 ms 88704 KB Time limit exceeded
52 Halted 0 ms 0 KB -