oj.uz

답안 #377451

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
377451 2021-03-14T08:31:53 Z reymontada61 Pinball (JOI14_pinball) C++14
51 / 100
 1000 ms 146668 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long

int n, m;
const int MXN = 100005;
int l[MXN], r[MXN], to[MXN], c[MXN];

int lec[MXN], ric[MXN];

int MXE = LLONG_MAX / 2;

int ans = MXE;
bool can;


struct LzSegmentTree {
	
	int seg[35*MXN];
	int le[35*MXN];
	int ri[35*MXN]; 
	
	int n, nx;
	
	LzSegmentTree(int N) {
		seg[0] = seg[1] = MXE;
		le[0] = le[1] = 0;
		ri[0] = ri[1] = 0;
		nx = 1;
	}
	
	int get() {
		nx++;
		seg[nx] = MXE;
		le[nx] = 0;
		ri[nx] = 0;
		return nx;
	}
	
	void update(int ind, int l, int r, int pos, int by) {
		if (l == r) {
			seg[ind] = min(seg[ind], by);
			return;
		}
		int m = (l + r) / 2;
		if (pos <= m) {
			if (le[ind] == 0) le[ind] = get();
			update(le[ind], l, m, pos, by);
		}
		else {
			if (ri[ind] == 0) ri[ind] = get();
			update(ri[ind], m+1, r, pos, by);
		}
		seg[ind] = min(seg[le[ind]], seg[ri[ind]]);
	}
	
	int query(int ind, int l, int r, int ql, int qr) {
		if (ql <= l && r <= qr) {
			return seg[ind];
		}
		if (ql > r || qr < l) return MXE;
		if (le[ind] == 0) le[ind] = get();
		if (ri[ind] == 0) ri[ind] = get();
		int m = (l + r) / 2;
		return min(query(le[ind], l, m, ql, qr), query(ri[ind], m+1, r, ql, qr));
	}
	
};

signed main() {

	cin >> m >> n;
	for (int i=1; i<=m; i++) {
		cin >> l[i] >> r[i] >> to[i] >> c[i];
	}
	
	LzSegmentTree onL(n), onR(n);
	
	for (int i=1; i<=m; i++) {
		if (l[i] == 1) {
			lec[i] = c[i];
		}
		else {
			lec[i] = min(MXE, c[i] + onL.query(1, 1, n, l[i], r[i]));
		}
		
		if (r[i] == n) {
			ric[i] = c[i];
		}
		else {
			ric[i] = min(MXE, c[i] + onR.query(1, 1, n, l[i], r[i]));
		}
		
		onL.update(1, 1, n, to[i], lec[i]);
		onR.update(1, 1, n, to[i], ric[i]);
		
		if (lec[i] == MXE || ric[i] == MXE) continue;
		
		can = true;
		ans = min(ans, lec[i] + ric[i] - c[i]);
			
	}
	
	if (can) cout << ans << endl;
	else cout << -1 << endl;
	
}

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 620 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 2 ms 1408 KB Output is correct
13 Correct 2 ms 1260 KB Output is correct
14 Correct 2 ms 1388 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 620 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 2 ms 1408 KB Output is correct
13 Correct 2 ms 1260 KB Output is correct
14 Correct 2 ms 1388 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 2 ms 1004 KB Output is correct
17 Correct 7 ms 2156 KB Output is correct
18 Correct 4 ms 492 KB Output is correct
19 Correct 8 ms 4076 KB Output is correct
20 Correct 6 ms 1644 KB Output is correct
21 Correct 3 ms 1388 KB Output is correct
22 Correct 7 ms 3948 KB Output is correct
23 Correct 7 ms 4460 KB Output is correct
24 Correct 8 ms 4460 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 620 KB Output is correct
11 Correct 2 ms 748 KB Output is correct
12 Correct 2 ms 1408 KB Output is correct
13 Correct 2 ms 1260 KB Output is correct
14 Correct 2 ms 1388 KB Output is correct
15 Correct 1 ms 492 KB Output is correct
16 Correct 2 ms 1004 KB Output is correct
17 Correct 7 ms 2156 KB Output is correct
18 Correct 4 ms 492 KB Output is correct
19 Correct 8 ms 4076 KB Output is correct
20 Correct 6 ms 1644 KB Output is correct
21 Correct 3 ms 1388 KB Output is correct
22 Correct 7 ms 3948 KB Output is correct
23 Correct 7 ms 4460 KB Output is correct
24 Correct 8 ms 4460 KB Output is correct
25 Correct 55 ms 7668 KB Output is correct
26 Correct 194 ms 38400 KB Output is correct
27 Correct 646 ms 70252 KB Output is correct
28 Correct 419 ms 10116 KB Output is correct
29 Correct 463 ms 80108 KB Output is correct
30 Correct 739 ms 23144 KB Output is correct
31 Execution timed out 1037 ms 146668 KB Time limit exceeded
32 Halted 0 ms 0 KB -