oj.uz

Submission #405742

# Submission time Handle Problem Language Result Execution time Memory
405742 2021-05-16T21:07:00 Z ritul_kr_singh Pinball (JOI14_pinball) C++17
100 / 100
 314 ms 26316 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define sp << ' ' <<
#define nl << '\n'

const int INF = 1e16;

struct SegmentTree{
	vector<int> a; int sz = 1;
	SegmentTree(int n){
		while(sz < n) sz += sz;
		a.assign(2*sz, INF);
	}
	void update(int i, int v, int x, int lx, int rx){
		if(rx-lx==1) return void(a[x] = min(a[x], v));
		int mx = (lx + rx) / 2;
		if(i < mx) update(i, v, 2*x+1, lx, mx);
		else update(i, v, 2*x+2, mx, rx);
		a[x] = min(a[2*x+1], a[2*x+2]);
	}
	void update(int i, int v){ update(i, v, 0, 0, sz); }
	int rangeMin(int l, int r, int x, int lx, int rx){
		if(r<=lx || rx<=l) return INF;
		if(l<=lx && rx<=r) return a[x];
		int mx = (lx + rx) / 2;
		return min(rangeMin(l, r, 2*x+1, lx, mx), rangeMin(l, r, 2*x+2, mx, rx));
	}
	int rangeMin(int l, int r){ return rangeMin(l, r+1, 0, 0, sz); }
};

signed main(){
	cin.tie(0)->sync_with_stdio(0);
	int m, n; cin >> m >> n;
	array<int, 4> a[m];
	vector<int> vals = {1, n};
	for(auto &i : a){
		for(int j=0; j<3; ++j) cin >> i[j], vals.push_back(i[j]);
		cin >> i[3];
	}

	sort(vals.begin(), vals.end());
	for(auto &i : a){
		for(int j=0; j<3; ++j) i[j] = lower_bound(vals.begin(), vals.end(), i[j]) - vals.begin();
	}

	int last = lower_bound(vals.begin(), vals.end(), n) - vals.begin();

	SegmentTree dpL(last+1), dpR(last+1);
	dpL.update(0, 0);
	dpR.update(last, 0);

	int res = INF;
	
	for(auto &i : a){
		int l = dpL.rangeMin(i[0], i[1]);
		int r = dpR.rangeMin(i[0], i[1]);
		res = min(res, l + r + i[3]);

		dpL.update(i[2], l + i[3]);
		dpR.update(i[2], r + i[3]);
	}

	cout << (res == INF ? -1 : res);
}

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

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

Subtask #3
22.0 / 22.0

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

Subtask #4
49.0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Correct 1 ms 204 KB Output is correct
4 Correct 1 ms 204 KB Output is correct
5 Correct 1 ms 204 KB Output is correct
6 Correct 1 ms 204 KB Output is correct
7 Correct 1 ms 204 KB Output is correct
8 Correct 1 ms 204 KB Output is correct
9 Correct 1 ms 332 KB Output is correct
10 Correct 1 ms 332 KB Output is correct
11 Correct 1 ms 332 KB Output is correct
12 Correct 1 ms 332 KB Output is correct
13 Correct 1 ms 332 KB Output is correct
14 Correct 1 ms 332 KB Output is correct
15 Correct 1 ms 332 KB Output is correct
16 Correct 2 ms 332 KB Output is correct
17 Correct 3 ms 460 KB Output is correct
18 Correct 3 ms 460 KB Output is correct
19 Correct 3 ms 456 KB Output is correct
20 Correct 3 ms 452 KB Output is correct
21 Correct 2 ms 332 KB Output is correct
22 Correct 3 ms 460 KB Output is correct
23 Correct 3 ms 536 KB Output is correct
24 Correct 2 ms 460 KB Output is correct
25 Correct 21 ms 2256 KB Output is correct
26 Correct 66 ms 6720 KB Output is correct
27 Correct 206 ms 15008 KB Output is correct
28 Correct 247 ms 26100 KB Output is correct
29 Correct 134 ms 13296 KB Output is correct
30 Correct 314 ms 26316 KB Output is correct
31 Correct 298 ms 26224 KB Output is correct
32 Correct 295 ms 26228 KB Output is correct
33 Correct 33 ms 4260 KB Output is correct
34 Correct 116 ms 13284 KB Output is correct
35 Correct 173 ms 26108 KB Output is correct
36 Correct 281 ms 26156 KB Output is correct
37 Correct 245 ms 26168 KB Output is correct
38 Correct 228 ms 26096 KB Output is correct