oj.uz

Submission #707343

# Submission time Handle Problem Language Result Execution time Memory
707343 2023-03-08T19:52:01 Z amirhoseinfar1385 Pinball (JOI14_pinball) C++17
100 / 100
 278 ms 40408 KB 
#include<bits/stdc++.h>
using namespace std;
int n,m;
long long inf=1e15,kaf=(1<<20);
struct segment{
	long long seg[(1<<21)];
	segment(){
		for(int i=0;i<(1<<21);i++){
			seg[i]=inf;
		}
	}
	void upd(int i,long long w){
		if(i==0){
			return ;
		}	
		seg[i]=min(seg[i],w);
		return upd((i>>1),w);
	}
	long long pors(int i,int l,int r,int tl,int tr){
		if(l>r||l>tr||r<tl){
			return inf;
		}
		if(l>=tl&&r<=tr){
			return seg[i];
		}	
		int m=(l+r)>>1;
		long long ret=min(pors((i<<1),l,m,tl,tr),pors((i<<1)^1,m+1,r,tl,tr));
		return ret;
	}
};
segment seg1,seg2;

int main(){
	ios::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin>>n>>m;
	long long res=inf;
	vector<pair<pair<int,int>,pair<int,int>>>allq(n);
	vector<int>allind;
	for(int i=0;i<n;i++){
		cin>>allq[i].first.first>>allq[i].first.second>>allq[i].second.first>>allq[i].second.second;
		allind.push_back(allq[i].first.first);
		allind.push_back(allq[i].first.second);
		allind.push_back(allq[i].second.first);
	}
	allind.push_back(1);
	allind.push_back(m);
	sort(allind.begin(),allind.end());
	allind.resize(unique(allind.begin(),allind.end())-allind.begin());
	int p=lower_bound(allind.begin(),allind.end(),1)-allind.begin();
	seg1.upd(kaf+p,0);
	p=lower_bound(allind.begin(),allind.end(),m)-allind.begin();
	seg2.upd(kaf+p,0);
	for(int i=0;i<n;i++){
		long long l,r,c,w;
		c=lower_bound(allind.begin(),allind.end(),allq[i].second.first)-allind.begin();
		w=allq[i].second.second;
		l=lower_bound(allind.begin(),allind.end(),allq[i].first.first)-allind.begin();
		r=lower_bound(allind.begin(),allind.end(),allq[i].first.second)-allind.begin();
		//cin>>l>>r>>c>>w;
		long long fake=seg1.pors(1,0,kaf-1,l,r)+seg2.pors(1,0,kaf-1,l,r);
		fake+=w;
		res=min(fake,res);
		fake=seg1.pors(1,0,kaf-1,l,r);
		fake+=w;
		seg1.upd(kaf+c,fake);	
		fake=seg2.pors(1,0,kaf-1,l,r);
		fake+=w;
		seg2.upd(kaf+c,fake);
	}
	if(res>=inf){
		cout<<-1<<"\n";
	}
	else{
		cout<<res<<'\n';
	}
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 33108 KB Output is correct
2 Correct 15 ms 33136 KB Output is correct
3 Correct 14 ms 33072 KB Output is correct
4 Correct 14 ms 33104 KB Output is correct
5 Correct 14 ms 33124 KB Output is correct
6 Correct 15 ms 33132 KB Output is correct
7 Correct 15 ms 33084 KB Output is correct
8 Correct 14 ms 33092 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 33108 KB Output is correct
2 Correct 15 ms 33136 KB Output is correct
3 Correct 14 ms 33072 KB Output is correct
4 Correct 14 ms 33104 KB Output is correct
5 Correct 14 ms 33124 KB Output is correct
6 Correct 15 ms 33132 KB Output is correct
7 Correct 15 ms 33084 KB Output is correct
8 Correct 14 ms 33092 KB Output is correct
9 Correct 14 ms 33108 KB Output is correct
10 Correct 18 ms 33056 KB Output is correct
11 Correct 14 ms 33156 KB Output is correct
12 Correct 18 ms 33236 KB Output is correct
13 Correct 14 ms 33032 KB Output is correct
14 Correct 15 ms 33152 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 33108 KB Output is correct
2 Correct 15 ms 33136 KB Output is correct
3 Correct 14 ms 33072 KB Output is correct
4 Correct 14 ms 33104 KB Output is correct
5 Correct 14 ms 33124 KB Output is correct
6 Correct 15 ms 33132 KB Output is correct
7 Correct 15 ms 33084 KB Output is correct
8 Correct 14 ms 33092 KB Output is correct
9 Correct 14 ms 33108 KB Output is correct
10 Correct 18 ms 33056 KB Output is correct
11 Correct 14 ms 33156 KB Output is correct
12 Correct 18 ms 33236 KB Output is correct
13 Correct 14 ms 33032 KB Output is correct
14 Correct 15 ms 33152 KB Output is correct
15 Correct 14 ms 33132 KB Output is correct
16 Correct 14 ms 33108 KB Output is correct
17 Correct 21 ms 33236 KB Output is correct
18 Correct 15 ms 33128 KB Output is correct
19 Correct 20 ms 33108 KB Output is correct
20 Correct 16 ms 33160 KB Output is correct
21 Correct 15 ms 33108 KB Output is correct
22 Correct 16 ms 33168 KB Output is correct
23 Correct 16 ms 33200 KB Output is correct
24 Correct 15 ms 33236 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 33108 KB Output is correct
2 Correct 15 ms 33136 KB Output is correct
3 Correct 14 ms 33072 KB Output is correct
4 Correct 14 ms 33104 KB Output is correct
5 Correct 14 ms 33124 KB Output is correct
6 Correct 15 ms 33132 KB Output is correct
7 Correct 15 ms 33084 KB Output is correct
8 Correct 14 ms 33092 KB Output is correct
9 Correct 14 ms 33108 KB Output is correct
10 Correct 18 ms 33056 KB Output is correct
11 Correct 14 ms 33156 KB Output is correct
12 Correct 18 ms 33236 KB Output is correct
13 Correct 14 ms 33032 KB Output is correct
14 Correct 15 ms 33152 KB Output is correct
15 Correct 14 ms 33132 KB Output is correct
16 Correct 14 ms 33108 KB Output is correct
17 Correct 21 ms 33236 KB Output is correct
18 Correct 15 ms 33128 KB Output is correct
19 Correct 20 ms 33108 KB Output is correct
20 Correct 16 ms 33160 KB Output is correct
21 Correct 15 ms 33108 KB Output is correct
22 Correct 16 ms 33168 KB Output is correct
23 Correct 16 ms 33200 KB Output is correct
24 Correct 15 ms 33236 KB Output is correct
25 Correct 33 ms 33788 KB Output is correct
26 Correct 65 ms 35060 KB Output is correct
27 Correct 166 ms 37668 KB Output is correct
28 Correct 151 ms 40368 KB Output is correct
29 Correct 136 ms 37112 KB Output is correct
30 Correct 203 ms 40408 KB Output is correct
31 Correct 249 ms 40408 KB Output is correct
32 Correct 230 ms 40376 KB Output is correct
33 Correct 45 ms 34492 KB Output is correct
34 Correct 121 ms 37048 KB Output is correct
35 Correct 165 ms 40408 KB Output is correct
36 Correct 278 ms 40368 KB Output is correct
37 Correct 224 ms 40404 KB Output is correct
38 Correct 216 ms 40392 KB Output is correct