oj.uz

Submission #380610

# Submission time Handle Problem Language Result Execution time Memory
380610 2021-03-22T12:46:52 Z mariowong Examination (JOI19_examination) C++14
100 / 100
 772 ms 25056 KB 
#include <bits/stdc++.h>
using namespace std;
 
struct node{
	long long maths,ict,sum;
	int indx;	
}a[200005];
bool cmp(node a1,node a2){
	if (a1.maths != a2.maths)
	return a1.maths > a2.maths;
	return a1.indx < a2.indx;
}
int n,m,pt;
long long seg[800005]; 
pair <long long,int> d[200005];
long long ct,now,ans[200005];
vector <pair<long long,long long>  > u;
vector <pair<pair<long long,long long>,int>  > q;
void build (int id,int x,int y){
	if (x == y)
	seg[id]=0;
	else
	{
		int mid=(x+y)/2;
		if (seg[id] != 0){
			build(id*2,x,mid);
			build(id*2+1,mid+1,y);
		}
		seg[id]=0;
	}
}
void update(int id,int x,int y,int pos){
	if (x == y)
	seg[id]++;
	else
	{
		int mid=(x+y)/2;
		if (pos <= mid) update(id*2,x,mid,pos);
		else update(id*2+1,mid+1,y,pos);
		seg[id]=seg[id*2]+seg[id*2+1];
	}
}
int query(int id,int x,int y,int l,int r){
	if (l <= x && y <= r)
	return seg[id];
	if (x > r || y < l)
	return 0;
	int mid=(x+y)/2;
	return query(id*2,x,mid,l,r)+query(id*2+1,mid+1,y,l,r);
}
void solve(int x,int y){
	if (x == y);
	else
	{
		int mid=(x+y)/2;
		u.clear(); q.clear();
		build(1,0,ct);
		for (int i=x;i<=mid;i++){
			if (a[i].indx == 0)
			u.push_back(make_pair(a[i].ict,a[i].sum));
		}
		for (int i=mid+1;i<=y;i++){
			if (a[i].indx != 0)
			q.push_back(make_pair(make_pair(a[i].ict,a[i].sum),a[i].indx));
		}
		sort(u.begin(),u.end()); sort(q.begin(),q.end()); 
		reverse(u.begin(),u.end()); reverse(q.begin(),q.end()); 
		pt=0;
		for (int i=0;i<q.size();i++){
			while (pt < (int)u.size() && u[pt].first >= q[i].first.first){
				update(1,0,ct,u[pt].second);
				pt++;
			} 
			ans[q[i].second]+=query(1,0,ct,q[i].first.second,ct);
		}
		solve(x,mid);
		solve(mid+1,y);
	}
}
int main(){
	ios::sync_with_stdio(false);
	cin >> n >> m;
	for (int i=1;i<=n;i++){
		cin >> a[i].maths >> a[i].ict;
		a[i].sum=a[i].maths+a[i].ict;
		d[i]=make_pair(a[i].sum,i);
	}
	for (int i=n+1;i<=n+m;i++){
		cin >> a[i].maths >> a[i].ict >> a[i].sum; a[i].indx=i-n;
		d[i]=make_pair(a[i].sum,i);
	}
	sort(d+1,d+1+n+m); 
	for (int i=1;i<=n+m;i++){
		if (d[i].first != d[i-1].first) 
		ct++;
		a[d[i].second].sum=ct;
	}
	sort(a+1,a+1+n+m,cmp); 
	solve(1,n+m);
	for (int i=1;i<=m;i++){
		cout << ans[i] << "\n";
	}
	return 0;
}

Compilation message

examination.cpp: In function 'void solve(int, int)':
examination.cpp:69:17: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<std::pair<std::pair<long long int, long long int>, int> >::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   69 |   for (int i=0;i<q.size();i++){
      |                ~^~~~~~~~~

Subtask #1
2.0 / 2.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 15 ms 876 KB Output is correct
8 Correct 12 ms 876 KB Output is correct
9 Correct 12 ms 876 KB Output is correct
10 Correct 11 ms 876 KB Output is correct
11 Correct 10 ms 876 KB Output is correct
12 Correct 7 ms 748 KB Output is correct
13 Correct 9 ms 1004 KB Output is correct
14 Correct 9 ms 1004 KB Output is correct
15 Correct 9 ms 1004 KB Output is correct
16 Correct 6 ms 1004 KB Output is correct
17 Correct 10 ms 1004 KB Output is correct
18 Correct 5 ms 876 KB Output is correct

Subtask #2
20.0 / 20.0

# Verdict Execution time Memory Grader output
1 Correct 498 ms 16020 KB Output is correct
2 Correct 494 ms 15844 KB Output is correct
3 Correct 504 ms 15972 KB Output is correct
4 Correct 396 ms 14820 KB Output is correct
5 Correct 291 ms 15204 KB Output is correct
6 Correct 225 ms 14020 KB Output is correct
7 Correct 321 ms 20704 KB Output is correct
8 Correct 519 ms 18340 KB Output is correct
9 Correct 336 ms 20672 KB Output is correct
10 Correct 228 ms 16484 KB Output is correct
11 Correct 342 ms 16484 KB Output is correct
12 Correct 176 ms 13544 KB Output is correct

Subtask #3
21.0 / 21.0

# Verdict Execution time Memory Grader output
1 Correct 498 ms 16020 KB Output is correct
2 Correct 494 ms 15844 KB Output is correct
3 Correct 504 ms 15972 KB Output is correct
4 Correct 396 ms 14820 KB Output is correct
5 Correct 291 ms 15204 KB Output is correct
6 Correct 225 ms 14020 KB Output is correct
7 Correct 321 ms 20704 KB Output is correct
8 Correct 519 ms 18340 KB Output is correct
9 Correct 336 ms 20672 KB Output is correct
10 Correct 228 ms 16484 KB Output is correct
11 Correct 342 ms 16484 KB Output is correct
12 Correct 176 ms 13544 KB Output is correct
13 Correct 689 ms 18916 KB Output is correct
14 Correct 676 ms 18940 KB Output is correct
15 Correct 488 ms 18404 KB Output is correct
16 Correct 570 ms 18044 KB Output is correct
17 Correct 461 ms 18276 KB Output is correct
18 Correct 271 ms 15076 KB Output is correct
19 Correct 665 ms 18848 KB Output is correct
20 Correct 658 ms 19044 KB Output is correct
21 Correct 582 ms 20192 KB Output is correct
22 Correct 229 ms 16484 KB Output is correct
23 Correct 339 ms 16612 KB Output is correct
24 Correct 172 ms 13544 KB Output is correct

Subtask #4
57.0 / 57.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 364 KB Output is correct
2 Correct 1 ms 364 KB Output is correct
3 Correct 1 ms 364 KB Output is correct
4 Correct 1 ms 364 KB Output is correct
5 Correct 1 ms 364 KB Output is correct
6 Correct 1 ms 364 KB Output is correct
7 Correct 15 ms 876 KB Output is correct
8 Correct 12 ms 876 KB Output is correct
9 Correct 12 ms 876 KB Output is correct
10 Correct 11 ms 876 KB Output is correct
11 Correct 10 ms 876 KB Output is correct
12 Correct 7 ms 748 KB Output is correct
13 Correct 9 ms 1004 KB Output is correct
14 Correct 9 ms 1004 KB Output is correct
15 Correct 9 ms 1004 KB Output is correct
16 Correct 6 ms 1004 KB Output is correct
17 Correct 10 ms 1004 KB Output is correct
18 Correct 5 ms 876 KB Output is correct
19 Correct 498 ms 16020 KB Output is correct
20 Correct 494 ms 15844 KB Output is correct
21 Correct 504 ms 15972 KB Output is correct
22 Correct 396 ms 14820 KB Output is correct
23 Correct 291 ms 15204 KB Output is correct
24 Correct 225 ms 14020 KB Output is correct
25 Correct 321 ms 20704 KB Output is correct
26 Correct 519 ms 18340 KB Output is correct
27 Correct 336 ms 20672 KB Output is correct
28 Correct 228 ms 16484 KB Output is correct
29 Correct 342 ms 16484 KB Output is correct
30 Correct 176 ms 13544 KB Output is correct
31 Correct 689 ms 18916 KB Output is correct
32 Correct 676 ms 18940 KB Output is correct
33 Correct 488 ms 18404 KB Output is correct
34 Correct 570 ms 18044 KB Output is correct
35 Correct 461 ms 18276 KB Output is correct
36 Correct 271 ms 15076 KB Output is correct
37 Correct 665 ms 18848 KB Output is correct
38 Correct 658 ms 19044 KB Output is correct
39 Correct 582 ms 20192 KB Output is correct
40 Correct 229 ms 16484 KB Output is correct
41 Correct 339 ms 16612 KB Output is correct
42 Correct 172 ms 13544 KB Output is correct
43 Correct 729 ms 22848 KB Output is correct
44 Correct 730 ms 22916 KB Output is correct
45 Correct 710 ms 22820 KB Output is correct
46 Correct 591 ms 21220 KB Output is correct
47 Correct 489 ms 21476 KB Output is correct
48 Correct 286 ms 14948 KB Output is correct
49 Correct 535 ms 25056 KB Output is correct
50 Correct 772 ms 22904 KB Output is correct
51 Correct 522 ms 24928 KB Output is correct
52 Correct 444 ms 21220 KB Output is correct
53 Correct 353 ms 18404 KB Output is correct