oj.uz

Submission #444082

# Submission time Handle Problem Language Result Execution time Memory
444082 2021-07-13T05:47:55 Z minhcool Examination (JOI19_examination) C++17
22 / 100
 3000 ms 23392 KB 
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
#include<time.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 = 1000;
 
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){
	counter++;
	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};
	}
	//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, 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
		//cout << i << "\n";
		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);
		vector<ii> vc1;
		for(int j = max(1LL, 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(!que.size()) break;
					ii temp = que.top();
					//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[temp.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 < 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);
				}
			}
			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);
					upd(uomp[students1[ind].se], 1);
				}
				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: In function 'void process()':
examination.cpp:71: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]
   71 |  for(int i = 0; i < vc.size(); i++) uomp[vc[i]] = i + 1;
      |                 ~~^~~~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 36 ms 1124 KB Output is correct
8 Correct 36 ms 1108 KB Output is correct
9 Correct 37 ms 1108 KB Output is correct
10 Correct 24 ms 776 KB Output is correct
11 Correct 36 ms 1120 KB Output is correct
12 Correct 26 ms 852 KB Output is correct
13 Correct 6 ms 1100 KB Output is correct
14 Correct 6 ms 1144 KB Output is correct
15 Correct 6 ms 1156 KB Output is correct
16 Correct 5 ms 1100 KB Output is correct
17 Correct 24 ms 844 KB Output is correct
18 Correct 3 ms 892 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 23056 KB Output is correct
2 Correct 459 ms 23224 KB Output is correct
3 Correct 555 ms 23096 KB Output is correct
4 Correct 224 ms 19000 KB Output is correct
5 Correct 415 ms 23112 KB Output is correct
6 Correct 330 ms 19028 KB Output is correct
7 Correct 419 ms 23084 KB Output is correct
8 Correct 428 ms 21944 KB Output is correct
9 Correct 415 ms 21816 KB Output is correct
10 Correct 401 ms 22980 KB Output is correct
11 Correct 267 ms 18872 KB Output is correct
12 Correct 242 ms 18744 KB Output is correct

Subtask #3
0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 487 ms 23056 KB Output is correct
2 Correct 459 ms 23224 KB Output is correct
3 Correct 555 ms 23096 KB Output is correct
4 Correct 224 ms 19000 KB Output is correct
5 Correct 415 ms 23112 KB Output is correct
6 Correct 330 ms 19028 KB Output is correct
7 Correct 419 ms 23084 KB Output is correct
8 Correct 428 ms 21944 KB Output is correct
9 Correct 415 ms 21816 KB Output is correct
10 Correct 401 ms 22980 KB Output is correct
11 Correct 267 ms 18872 KB Output is correct
12 Correct 242 ms 18744 KB Output is correct
13 Correct 2976 ms 23392 KB Output is correct
14 Correct 2240 ms 23360 KB Output is correct
15 Correct 462 ms 23156 KB Output is correct
16 Correct 1570 ms 19208 KB Output is correct
17 Correct 2224 ms 23220 KB Output is correct
18 Correct 417 ms 19416 KB Output is correct
19 Execution timed out 3078 ms 22792 KB Time limit exceeded
20 Halted 0 ms 0 KB -

Subtask #4
0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 0 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 0 ms 332 KB Output is correct
5 Correct 1 ms 332 KB Output is correct
6 Correct 0 ms 332 KB Output is correct
7 Correct 36 ms 1124 KB Output is correct
8 Correct 36 ms 1108 KB Output is correct
9 Correct 37 ms 1108 KB Output is correct
10 Correct 24 ms 776 KB Output is correct
11 Correct 36 ms 1120 KB Output is correct
12 Correct 26 ms 852 KB Output is correct
13 Correct 6 ms 1100 KB Output is correct
14 Correct 6 ms 1144 KB Output is correct
15 Correct 6 ms 1156 KB Output is correct
16 Correct 5 ms 1100 KB Output is correct
17 Correct 24 ms 844 KB Output is correct
18 Correct 3 ms 892 KB Output is correct
19 Correct 487 ms 23056 KB Output is correct
20 Correct 459 ms 23224 KB Output is correct
21 Correct 555 ms 23096 KB Output is correct
22 Correct 224 ms 19000 KB Output is correct
23 Correct 415 ms 23112 KB Output is correct
24 Correct 330 ms 19028 KB Output is correct
25 Correct 419 ms 23084 KB Output is correct
26 Correct 428 ms 21944 KB Output is correct
27 Correct 415 ms 21816 KB Output is correct
28 Correct 401 ms 22980 KB Output is correct
29 Correct 267 ms 18872 KB Output is correct
30 Correct 242 ms 18744 KB Output is correct
31 Correct 2976 ms 23392 KB Output is correct
32 Correct 2240 ms 23360 KB Output is correct
33 Correct 462 ms 23156 KB Output is correct
34 Correct 1570 ms 19208 KB Output is correct
35 Correct 2224 ms 23220 KB Output is correct
36 Correct 417 ms 19416 KB Output is correct
37 Execution timed out 3078 ms 22792 KB Time limit exceeded
38 Halted 0 ms 0 KB -