oj.uz

답안 #444524

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
444524 2021-07-14T08:19:06 Z minhcool Examination (JOI19_examination) C++17
43 / 100
 3000 ms 19784 KB 
#include<bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;
using namespace std;
 
#define hash hashy
#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 = 900;
 
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];
int counter = 0;
 
void upd(int pos, int 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);
}
 
ii que[N];
 
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};
	}
	//if(n == 100000 && q == 100000 && students1[i].fi == 92665) return;
	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, 0)) - 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
		//cout << i << "\n";
		int itr = 0;
		for(set<ii>::iterator it = se.begin(); it != se.end(); it++){
			itr++;
			que[itr] = (*it);
		}
		//stack<ii> que;
		//for(set<ii>::iterator it = se.begin(); it != se.end(); it++) 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);
		vector<ii> vc1;
		for(int j = max(1, i * block); j < min(n + 1, (i + 1) * block); j++){
			int tmp = students2[j].se;
			//if(!tmp) cout << j << " " << tmp << "\n";
			vc1.pb({students1[tmp].fi, tmp});
		}
		sort(vc1.begin(), vc1.end());
		for(auto it : srt[i]){
			//cout << it << " " << i << "\n";
				while(1){
					if(!itr) break;
					ii temp = que[itr];
					//int x = que.top().fi;
					if(temp.fi < queries[it].fi.fi) break;
					//cout << x << " " << que.size() << "\n";
					in[temp.se] = 1;
					//upd(uomp[students1[students2[j].se].se], -1);
					int pos = uomp[students1[temp.se].se];
					for(; pos <= n + q; pos += pos & -pos) bit[pos]++;
					//upd(uomp[students1[temp.se].se], 1);
					itr--;
				}
			int temp = lower_bound(students2 + 1, students2 + n + 1, make_pair(queries[it].se, 0)) - 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);
					int pos = uomp[students1[students2[j].se].se];
					for(; pos <= n + q; pos += pos & -pos) bit[pos]--;
				}
			} 
			for(int j = temp; j < lst; 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);
					int pos = uomp[students1[students2[j].se].se];
					for(; pos <= n + q; pos += pos & -pos) bit[pos]++;
				}
			}
			lst = temp;
			while(1){
				if(!vc1.size()) break;
				if(vc1.back().fi < queries[it].fi.fi) break;
				int ind = vc1.back().se;
				if(!in[ind] && students1[ind].fi + students1[ind].se >= queries[it].se){
					in[ind] = 1;
					//assert(ind);
					int pos = uomp[students1[ind].se];
					for(; pos <= n + q; pos += pos & -pos) bit[pos]++;
				}
				vc1.pop_back();
				//cout << vc1.size() << "\n";
			}
			answer[it] = get(n + q) - get(uomp[queries[it].fi.se] - 1);
		}
		for(int j = i * block; j < min(n + 1, (i + 1) * block); j++){
			int tmp = students2[j].se;
			//cout << j << " " << tmp << "\n";
			se.insert({students1[tmp].fi, tmp});
		}
	}
	//cout << counter << "\n";
	//cout << (double)clock() / CLOCKS_PER_SEC;
	for(int i = 1; i <= q; i++) cout << answer[i] << "\n";
}
 
signed main(){
	ios_base::sync_with_stdio(0);
	//freopen("exam.txt", "r", stdin);
	process();
}

Compilation message

examination.cpp:20:21: warning: overflow in conversion from 'double' to 'int' changes value from '1.0e+18' to '2147483647' [-Woverflow]
   20 | const int oo = 1e18 + 7, mod = 1e9 + 7;
      |                ~~~~~^~~
examination.cpp: In function 'void process()':
examination.cpp:72:19: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   72 |  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 1 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 1 ms 332 KB Output is correct
7 Correct 25 ms 960 KB Output is correct
8 Correct 27 ms 964 KB Output is correct
9 Correct 28 ms 920 KB Output is correct
10 Correct 20 ms 688 KB Output is correct
11 Correct 30 ms 948 KB Output is correct
12 Correct 20 ms 692 KB Output is correct
13 Correct 6 ms 972 KB Output is correct
14 Correct 6 ms 972 KB Output is correct
15 Correct 6 ms 972 KB Output is correct
16 Correct 5 ms 972 KB Output is correct
17 Correct 19 ms 684 KB Output is correct
18 Correct 4 ms 588 KB Output is correct

Subtask #2
20.0 / 20.0

# 결과 실행 시간 메모리 Grader output
1 Correct 363 ms 15556 KB Output is correct
2 Correct 357 ms 15660 KB Output is correct
3 Correct 334 ms 15648 KB Output is correct
4 Correct 194 ms 11504 KB Output is correct
5 Correct 335 ms 15592 KB Output is correct
6 Correct 229 ms 11568 KB Output is correct
7 Correct 332 ms 15652 KB Output is correct
8 Correct 345 ms 14332 KB Output is correct
9 Correct 364 ms 14460 KB Output is correct
10 Correct 324 ms 15396 KB Output is correct
11 Correct 174 ms 11396 KB Output is correct
12 Correct 151 ms 11204 KB Output is correct

Subtask #3
21.0 / 21.0

# 결과 실행 시간 메모리 Grader output
1 Correct 363 ms 15556 KB Output is correct
2 Correct 357 ms 15660 KB Output is correct
3 Correct 334 ms 15648 KB Output is correct
4 Correct 194 ms 11504 KB Output is correct
5 Correct 335 ms 15592 KB Output is correct
6 Correct 229 ms 11568 KB Output is correct
7 Correct 332 ms 15652 KB Output is correct
8 Correct 345 ms 14332 KB Output is correct
9 Correct 364 ms 14460 KB Output is correct
10 Correct 324 ms 15396 KB Output is correct
11 Correct 174 ms 11396 KB Output is correct
12 Correct 151 ms 11204 KB Output is correct
13 Correct 2488 ms 15928 KB Output is correct
14 Correct 1875 ms 15728 KB Output is correct
15 Correct 348 ms 15604 KB Output is correct
16 Correct 1372 ms 11832 KB Output is correct
17 Correct 1975 ms 15844 KB Output is correct
18 Correct 335 ms 11764 KB Output is correct
19 Correct 2290 ms 15920 KB Output is correct
20 Correct 2215 ms 15976 KB Output is correct
21 Correct 2781 ms 15092 KB Output is correct
22 Correct 320 ms 15476 KB Output is correct
23 Correct 185 ms 11392 KB Output is correct
24 Correct 148 ms 11200 KB Output is correct

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 1 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 1 ms 332 KB Output is correct
7 Correct 25 ms 960 KB Output is correct
8 Correct 27 ms 964 KB Output is correct
9 Correct 28 ms 920 KB Output is correct
10 Correct 20 ms 688 KB Output is correct
11 Correct 30 ms 948 KB Output is correct
12 Correct 20 ms 692 KB Output is correct
13 Correct 6 ms 972 KB Output is correct
14 Correct 6 ms 972 KB Output is correct
15 Correct 6 ms 972 KB Output is correct
16 Correct 5 ms 972 KB Output is correct
17 Correct 19 ms 684 KB Output is correct
18 Correct 4 ms 588 KB Output is correct
19 Correct 363 ms 15556 KB Output is correct
20 Correct 357 ms 15660 KB Output is correct
21 Correct 334 ms 15648 KB Output is correct
22 Correct 194 ms 11504 KB Output is correct
23 Correct 335 ms 15592 KB Output is correct
24 Correct 229 ms 11568 KB Output is correct
25 Correct 332 ms 15652 KB Output is correct
26 Correct 345 ms 14332 KB Output is correct
27 Correct 364 ms 14460 KB Output is correct
28 Correct 324 ms 15396 KB Output is correct
29 Correct 174 ms 11396 KB Output is correct
30 Correct 151 ms 11204 KB Output is correct
31 Correct 2488 ms 15928 KB Output is correct
32 Correct 1875 ms 15728 KB Output is correct
33 Correct 348 ms 15604 KB Output is correct
34 Correct 1372 ms 11832 KB Output is correct
35 Correct 1975 ms 15844 KB Output is correct
36 Correct 335 ms 11764 KB Output is correct
37 Correct 2290 ms 15920 KB Output is correct
38 Correct 2215 ms 15976 KB Output is correct
39 Correct 2781 ms 15092 KB Output is correct
40 Correct 320 ms 15476 KB Output is correct
41 Correct 185 ms 11392 KB Output is correct
42 Correct 148 ms 11200 KB Output is correct
43 Execution timed out 3076 ms 19784 KB Time limit exceeded
44 Halted 0 ms 0 KB -