oj.uz

Submission #117362

# Submission time Handle Problem Language Result Execution time Memory
117362 2019-06-15T16:24:30 Z Adhyyan1252 Pinball (JOI14_pinball) C++11
100 / 100
 385 ms 16136 KB 
#include<bits/stdc++.h>

using namespace std;

#define int long long
#define INF 1e16
//825 

struct segtree{
	vector<int> t;
	int sz;
	
	segtree(int size){
		sz = size;
		t = vector<int>(4*size, INF);
	}
	
	void upd(int i, int s, int e, int indx, int val){
		if(s == e){
			t[i] = min(val, t[i]);
			return;
		}
		int m = (s + e)/2;
		if(indx <= m){
			upd(i*2, s, m, indx, val);
		}else{
			upd(i*2+1, m+1, e, indx, val);
		}
		t[i] = min(t[i*2], t[i*2+1]);
	}
	
	int query(int i, int s, int e, int l, int r){
		if(l > r) return INF;
		if(l <= s && e <= r) return t[i	];
		if(s > r || e < l) return INF;
		int m = (s + e)/2;
		return min(query(i*2, s, m, l, r), query(i*2+1, m+1, e, l, r));
	}
};

signed main(){
	int n, m; cin>>m>>n;
	vector<int> a, b, c, d;
	a.resize(m);
	b.resize(m);
	c.resize(m);
	d.resize(m);
	
	for(int i = 0; i < m; i++){
		cin>>a[i]>>b[i]>>c[i]>>d[i];
	}

	
	vector<pair<int, int> > lc, rc;
	for(int i = 0; i < m; i++){
		lc.push_back({c[i], i});
	}
	sort(lc.begin(), lc.end());
	
	vector<int> lindx(m);
	for(int i = 0; i < m; i++){
		lindx[lc[i].second] = i;
	}

	
	segtree left(m), right(m);
	
	int ans = INF;
	for(int i = 0; i < m; i++){
	
		//upd this device now
		//the index is lindx[i]
		//find the range of vertices for query
		//do binary search on lc array with a, b
		
		
		pair<int, int> ls = {a[i], -1};
		pair<int, int> rs = {b[i], INF};
		int l = lower_bound(lc.begin(), lc.end(),ls)-lc.begin();
		int r = upper_bound(lc.begin(), lc.end(),rs)-lc.begin()-1;
		//cout<<"RANGE: "<<i<<" : "<<lindx[i]<<" "<<l<<" "<<r<<endl;
		int Lnval = left.query(1, 0, left.sz-1, l, r) + d[i];
		
		if(a[i] == 1) Lnval = d[i];
		
		left.upd(1, 0, left.sz-1, lindx[i], Lnval);
		
		int Rnval = right.query(1, 0, right.sz-1, l, r) + d[i];
		if(b[i] == n) Rnval = d[i];
		right.upd(1, 0, right.sz-1, lindx[i], Rnval);
		
		ans = min(ans, Lnval + Rnval - d[i]);
		
		//cout<<i<<": "<<Lnval<<" "<<Rnval<<endl;
	}
	
	if(ans >= INF) cout<<-1<<endl;
	else cout<<ans<<endl;
}

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct

Subtask #3
22.0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 384 KB Output is correct
3 Correct 2 ms 384 KB Output is correct
4 Correct 2 ms 384 KB Output is correct
5 Correct 2 ms 384 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 384 KB Output is correct
8 Correct 2 ms 384 KB Output is correct
9 Correct 2 ms 384 KB Output is correct
10 Correct 3 ms 384 KB Output is correct
11 Correct 2 ms 384 KB Output is correct
12 Correct 3 ms 384 KB Output is correct
13 Correct 3 ms 384 KB Output is correct
14 Correct 3 ms 384 KB Output is correct
15 Correct 2 ms 384 KB Output is correct
16 Correct 3 ms 384 KB Output is correct
17 Correct 5 ms 512 KB Output is correct
18 Correct 4 ms 512 KB Output is correct
19 Correct 5 ms 512 KB Output is correct
20 Correct 4 ms 512 KB Output is correct
21 Correct 3 ms 384 KB Output is correct
22 Correct 5 ms 512 KB Output is correct
23 Correct 5 ms 512 KB Output is correct
24 Correct 5 ms 512 KB Output is correct
25 Correct 28 ms 1912 KB Output is correct
26 Correct 76 ms 4336 KB Output is correct
27 Correct 243 ms 11164 KB Output is correct
28 Correct 330 ms 15848 KB Output is correct
29 Correct 170 ms 8428 KB Output is correct
30 Correct 366 ms 16104 KB Output is correct
31 Correct 360 ms 16104 KB Output is correct
32 Correct 366 ms 16052 KB Output is correct
33 Correct 50 ms 3568 KB Output is correct
34 Correct 158 ms 8172 KB Output is correct
35 Correct 274 ms 16104 KB Output is correct
36 Correct 385 ms 15976 KB Output is correct
37 Correct 353 ms 16136 KB Output is correct
38 Correct 336 ms 15980 KB Output is correct