oj.uz

답안 #340204

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
340204 2020-12-27T09:27:29 Z Bill_00 Pinball (JOI14_pinball) C++14
51 / 100
 1000 ms 302444 KB 
#include <bits/stdc++.h>
#define ff first
#define ss second
#define pb push_back
#define mp make_pair
#define M 100005
#define MAX 1e18
typedef long long ll; 
using namespace std;
ll m,n,L,R,ans=MAX;
ll a[M],b[M];
ll c[M],d[M];

struct node{
	bool vis;
	ll mn;
	node *le,*ri;
	inline void update(ll up,ll l,ll r){
		if(r<L || R<l) return;
		if(L<=l && r<=R){
			if(vis){
				mn=min(mn,up);
			}
			else mn=up;
			vis=1;
			return;
		}
		if(le==NULL) le=new node();
		if(ri==NULL) ri=new node();
		ll m=l+r>>1;
		le->update(up,l,m);
		ri->update(up,m+1,r);
		if(!(le->vis)){
			mn=ri->mn;
			vis=1;
			return;
		}
		if(!(ri->vis)){
			mn=le->mn;
			vis=1;
			return;
		}
		mn=min((le->mn),(ri->mn));
		vis=1;
		return;
	}

	inline ll query(ll l,ll r){
		if(r<L || R<l) return MAX;
		if(L<=l && r<=R){
			if(vis) return mn;
			else return MAX;
		}
		if(le==NULL) le=new node();
		if(ri==NULL) ri=new node();
		ll m=l+r>>1;
		return min((le->query(l,m)),(ri->query(m+1,r)));
	}

} *seg1=new node(),*seg2=new node();



int main(){
	ios_base::sync_with_stdio(0);
	cin.tie(0);
	cout.tie(0);
	cin >> m >> n;
	for(int i=1;i<=m;++i){
		cin >> a[i] >> b[i];
		cin >> c[i] >> d[i];
	}
	L=R=1;
	seg1->update(0,1,n);
	L=R=n;
	seg2->update(0,1,n);
	for(int i=1;i<=m;++i){
		L=a[i],R=b[i];
		ll cost1=(seg1->query(1,n));
		ll cost2=(seg2->query(1,n));
		if(cost1!=MAX && cost2!=MAX){
			ans=min(ans,cost1+cost2+d[i]);
		}
		L=R=c[i];
		if(cost1!=MAX){
			seg1->update(cost1+d[i],1,n);
		}
		if(cost2!=MAX){
			seg2->update(cost2+d[i],1,n);
		}
	}
	if(ans==MAX) cout << -1;
	else cout << ans;
}

Compilation message

pinball.cpp: In member function 'void node::update(ll, ll, ll)':
pinball.cpp:30:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   30 |   ll m=l+r>>1;
      |        ~^~
pinball.cpp: In member function 'll node::query(ll, ll)':
pinball.cpp:56:9: warning: suggest parentheses around '+' inside '>>' [-Wparentheses]
   56 |   ll m=l+r>>1;
      |        ~^~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 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 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 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 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 2 ms 1004 KB Output is correct
12 Correct 3 ms 1900 KB Output is correct
13 Correct 3 ms 2028 KB Output is correct
14 Correct 3 ms 2156 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 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 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 2 ms 1004 KB Output is correct
12 Correct 3 ms 1900 KB Output is correct
13 Correct 3 ms 2028 KB Output is correct
14 Correct 3 ms 2156 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 2 ms 1388 KB Output is correct
17 Correct 8 ms 3948 KB Output is correct
18 Correct 4 ms 620 KB Output is correct
19 Correct 12 ms 7532 KB Output is correct
20 Correct 8 ms 2796 KB Output is correct
21 Correct 3 ms 2156 KB Output is correct
22 Correct 10 ms 6636 KB Output is correct
23 Correct 12 ms 8300 KB Output is correct
24 Correct 12 ms 7916 KB Output is correct

Subtask #4
0 / 49.0

# 결과 실행 시간 메모리 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 1 ms 364 KB Output is correct
8 Correct 1 ms 364 KB Output is correct
9 Correct 1 ms 492 KB Output is correct
10 Correct 1 ms 748 KB Output is correct
11 Correct 2 ms 1004 KB Output is correct
12 Correct 3 ms 1900 KB Output is correct
13 Correct 3 ms 2028 KB Output is correct
14 Correct 3 ms 2156 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 2 ms 1388 KB Output is correct
17 Correct 8 ms 3948 KB Output is correct
18 Correct 4 ms 620 KB Output is correct
19 Correct 12 ms 7532 KB Output is correct
20 Correct 8 ms 2796 KB Output is correct
21 Correct 3 ms 2156 KB Output is correct
22 Correct 10 ms 6636 KB Output is correct
23 Correct 12 ms 8300 KB Output is correct
24 Correct 12 ms 7916 KB Output is correct
25 Correct 51 ms 15212 KB Output is correct
26 Correct 231 ms 80364 KB Output is correct
27 Correct 608 ms 139884 KB Output is correct
28 Correct 324 ms 6892 KB Output is correct
29 Correct 492 ms 161644 KB Output is correct
30 Correct 624 ms 33388 KB Output is correct
31 Execution timed out 1096 ms 302444 KB Time limit exceeded
32 Halted 0 ms 0 KB -