oj.uz

답안 #444043

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444043 2021-07-13T03:56:48 Z minhcool Examination (JOI19_examination) C++17
22 / 100
 3000 ms 23248 KB 
#include<bits/stdc++.h>
using namespace std;
 
#define int long long
#define fi first
#define se second
#define pb push_back
#define mp make_pair
#define foru(i, l, r) for(int i = l; i <= r; i++)
#define ford(i, r, l) for(int i = r; i >= l; i--)
 
typedef pair<int, int> ii;
typedef pair<ii, int> iii;
typedef pair<ii, ii> iiii;
 
const int N = 2e5 + 5, block = 370;
 
const int oo = 1e18 + 7, mod = 1e9 + 7;
 
int n, q;
 
unordered_map<int, int> uomp;
vector<int> vc;
 
iii queries[N];
ii students1[N], students2[N];
 
vector<int> srt[N/block];
 
int bit[N];
bool in[N];
 
int answer[N];
 
void upd(int pos, int val){
	for(; pos <= n + q; pos += pos & -pos) bit[pos] += val;
}
 
int get(int pos){
	int ans = 0;
	for(; pos; pos -= pos & -pos) ans += bit[pos];
	return ans;
}
 
bool cmp(int a, int b){
	return (queries[a].fi.fi > queries[b].fi.fi);
}
 
void process(){
	cin >> n >> q;
	vector<int> vc;
	for(int i = 1; i <= n; i++){
		cin >> students1[i].fi >> students1[i].se;
		vc.pb(students1[i].se);
		students2[i] = {students1[i].fi + students1[i].se, i};
	}
	sort(students2 + 1, students2 + n + 1);
	for(int i = 1; i <= q; i++){
		cin >> queries[i].fi.fi >> queries[i].fi.se >> queries[i].se;
		vc.pb(queries[i].fi.se);
		int pos = lower_bound(students2 + 1, students2 + n + 1, make_pair(queries[i].se, 0LL)) - students2;
		srt[pos / block].pb(i);
	}
	sort(vc.begin(), vc.end());
	vc.resize(unique(vc.begin(), vc.end()) - vc.begin());
	for(int i = 0; i < vc.size(); i++) uomp[vc[i]] = i + 1;
	set<ii> se;
	for(int i = n/block + 2; i >= 0; i--){// l = (i * block), r = (i + 1) * block - 1
		stack<ii> que;
		for(auto it : se) que.push(it);
		sort(srt[i].begin(), srt[i].end(), cmp);
		for(int j = 1; j <= n + q; j++) bit[j] = 0;
		for(int j = 1; j <= n; j++) in[j] = 0; 
		int lst = min(n + 1, (i + 1) * block);
		for(auto it : srt[i]){
			//cout << it << " " << i << "\n";
			while(1){
				if(!que.size()) break;
				int x = que.top().fi;
				if(x < queries[it].fi.fi) break;
				//cout << x << " " << que.size() << "\n";
				in[que.top().se] = 1;
				upd(uomp[students1[que.top().se].se], 1);
				que.pop();
			}
			int temp = lower_bound(students2 + 1, students2 + n + 1, make_pair(queries[it].se, 0LL)) - students2;
			//cout << it << " " << temp << "\n";
			//cout << lst << " " << temp << " " << queries[it].se << "\n";
			//continue;
			for(int j = lst; j < temp; j++){
				if(in[students2[j].se]){
					in[students2[j].se] = 0;
					upd(uomp[students1[students2[j].se].se], -1);
				}
			} 
			for(int j = temp; j <= min(n, (i + 1) * block - 1); j++){
				if(students1[students2[j].se].fi >= queries[it].fi.fi && !in[students2[j].se]){
					in[students2[j].se] = 1;
					upd(uomp[students1[students2[j].se].se], 1);
				}
				lst = temp;
			}
			answer[it] = get(n + q) - get(uomp[queries[it].fi.se] - 1);
		}
		for(int j = i * block; j <= min(n, (i + 1) * block); j++){
			int tmp = students2[j].se;
			//cout << j << " " << tmp << "\n";
			se.insert({students1[tmp].fi, tmp});
		}
	}
	for(int i = 1; i <= q; i++) cout << answer[i] << "\n";
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	process();
}

Compilation message

examination.cpp: In function 'void process()':
examination.cpp:66:19: warning: comparison of integer expressions of different signedness: 'long long int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   66 |  for(int i = 0; i < vc.size(); i++) uomp[vc[i]] = i + 1;
      |                 ~~^~~~~~~~~~~

Subtask #1
2.0 / 2.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 18 ms 1184 KB Output is correct
8 Correct 17 ms 1132 KB Output is correct
9 Correct 17 ms 1156 KB Output is correct
10 Correct 12 ms 920 KB Output is correct
11 Correct 18 ms 1176 KB Output is correct
12 Correct 11 ms 844 KB Output is correct
13 Correct 9 ms 1100 KB Output is correct
14 Correct 8 ms 1100 KB Output is correct
15 Correct 8 ms 1168 KB Output is correct
16 Correct 7 ms 1188 KB Output is correct
17 Correct 12 ms 844 KB Output is correct
18 Correct 4 ms 844 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 917 ms 23248 KB Output is correct
2 Correct 864 ms 23248 KB Output is correct
3 Correct 870 ms 23232 KB Output is correct
4 Correct 476 ms 19228 KB Output is correct
5 Correct 1020 ms 23164 KB Output is correct
6 Correct 681 ms 19164 KB Output is correct
7 Correct 804 ms 23112 KB Output is correct
8 Correct 874 ms 21880 KB Output is correct
9 Correct 1104 ms 21936 KB Output is correct
10 Correct 1052 ms 22968 KB Output is correct
11 Correct 666 ms 18940 KB Output is correct
12 Correct 498 ms 18756 KB Output is correct

Subtask #3
0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 917 ms 23248 KB Output is correct
2 Correct 864 ms 23248 KB Output is correct
3 Correct 870 ms 23232 KB Output is correct
4 Correct 476 ms 19228 KB Output is correct
5 Correct 1020 ms 23164 KB Output is correct
6 Correct 681 ms 19164 KB Output is correct
7 Correct 804 ms 23112 KB Output is correct
8 Correct 874 ms 21880 KB Output is correct
9 Correct 1104 ms 21936 KB Output is correct
10 Correct 1052 ms 22968 KB Output is correct
11 Correct 666 ms 18940 KB Output is correct
12 Correct 498 ms 18756 KB Output is correct
13 Execution timed out 3059 ms 22104 KB Time limit exceeded
14 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 332 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 332 KB Output is correct
4 Correct 1 ms 332 KB Output is correct
5 Correct 0 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 18 ms 1184 KB Output is correct
8 Correct 17 ms 1132 KB Output is correct
9 Correct 17 ms 1156 KB Output is correct
10 Correct 12 ms 920 KB Output is correct
11 Correct 18 ms 1176 KB Output is correct
12 Correct 11 ms 844 KB Output is correct
13 Correct 9 ms 1100 KB Output is correct
14 Correct 8 ms 1100 KB Output is correct
15 Correct 8 ms 1168 KB Output is correct
16 Correct 7 ms 1188 KB Output is correct
17 Correct 12 ms 844 KB Output is correct
18 Correct 4 ms 844 KB Output is correct
19 Correct 917 ms 23248 KB Output is correct
20 Correct 864 ms 23248 KB Output is correct
21 Correct 870 ms 23232 KB Output is correct
22 Correct 476 ms 19228 KB Output is correct
23 Correct 1020 ms 23164 KB Output is correct
24 Correct 681 ms 19164 KB Output is correct
25 Correct 804 ms 23112 KB Output is correct
26 Correct 874 ms 21880 KB Output is correct
27 Correct 1104 ms 21936 KB Output is correct
28 Correct 1052 ms 22968 KB Output is correct
29 Correct 666 ms 18940 KB Output is correct
30 Correct 498 ms 18756 KB Output is correct
31 Execution timed out 3059 ms 22104 KB Time limit exceeded
32 Halted 0 ms 0 KB -