oj.uz

답안 #967482

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
967482 2024-04-22T08:17:46 Z penguin133 Pinball (JOI14_pinball) C++17
100 / 100
 508 ms 346216 KB 
#include <bits/stdc++.h>
using namespace std;

#define int long long
#define pi pair<int, int>
#define pii pair<int, pi>
#define fi first
#define se second
#ifdef _WIN32
#define getchar_unlocked _getchar_nolock
#endif
mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count());

struct node{
	int s, e, m, val;
	node *l, *r;
	node(int _s, int _e){
		s = _s, e = _e, m = (s + e) >> 1;
		val = 1e18;
		l = r = nullptr;
	}
	
	void mc(){
		if(l != nullptr || s == e)return;
		l = new node(s, m);
		r = new node(m+1, e);
	}
	
	void upd(int p, int v){
		if(s == e)val = min(val, v);
		else{
			mc();
			if(p <= m)l->upd(p, v);
			else r->upd(p, v);
			val = min(l->val, r->val);
		}
	}
	
	int qry(int a, int b){
		if(a == s && b == e)return val;
		if(l == nullptr)return val;
		if(b <= m)return l->qry(a, b);
		if(a > m)return r->qry(a, b);
		return min(l->qry(a, m), r->qry(m+1, b));
	}
}*root;

int dp[100005][2], dp2[100005], A[100005], B[100005], C[100005], D[100005];
int n, m;
void solve(){
	cin >> n >> m;
	for(int i = 1; i <= n; i++)cin >> A[i] >> B[i] >> C[i] >> D[i];
	root = new node(1, m);
	root->upd(1, 0);
	for(int i = 1; i <= n; i++){
		dp[i][0] = root->qry(C[i], m);
		dp[i][1] = root->qry(A[i], C[i]) + D[i];
		root->upd(C[i], dp[i][1]);
	}
	root = new node(1, m);
	root->upd(m, 0);
	int ans = 1e18;
	for(int i = 1; i <= n; i++){
		int tmp = root->qry(1, C[i]);
		dp2[i] = root->qry(C[i], B[i]) + D[i];
		root->upd(C[i], dp2[i]);
		ans = min(ans, dp[i][1] + dp2[i] - D[i]);
		ans = min(ans, dp[i][0] + dp2[i]);
		ans = min(ans, dp[i][1] + tmp);
		ans = min(ans, dp[i][0] + tmp);
	}
	cout << (ans >= 1e17 ? -1 : ans);
}

main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int tc = 1;
	//cin >> tc;
	for(int tc1=1;tc1<=tc;tc1++){
		// cout << "Case #" << tc1 << ": ";
		solve();
	}
}

Compilation message

pinball.cpp:75:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   75 | main(){
      | ^~~~

Subtask #1
11.0 / 11.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 5 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct

Subtask #2
18.0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 5 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4952 KB Output is correct
11 Correct 1 ms 5208 KB Output is correct
12 Correct 2 ms 5464 KB Output is correct
13 Correct 2 ms 5464 KB Output is correct
14 Correct 2 ms 5468 KB Output is correct

Subtask #3
22.0 / 22.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 5 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4952 KB Output is correct
11 Correct 1 ms 5208 KB Output is correct
12 Correct 2 ms 5464 KB Output is correct
13 Correct 2 ms 5464 KB Output is correct
14 Correct 2 ms 5468 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 2 ms 5212 KB Output is correct
17 Correct 6 ms 7652 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 7 ms 9048 KB Output is correct
20 Correct 4 ms 7004 KB Output is correct
21 Correct 2 ms 5724 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 7 ms 9564 KB Output is correct
24 Correct 5 ms 9308 KB Output is correct

Subtask #4
49.0 / 49.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 5 ms 4564 KB Output is correct
3 Correct 1 ms 4444 KB Output is correct
4 Correct 1 ms 4444 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 4444 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4696 KB Output is correct
10 Correct 1 ms 4952 KB Output is correct
11 Correct 1 ms 5208 KB Output is correct
12 Correct 2 ms 5464 KB Output is correct
13 Correct 2 ms 5464 KB Output is correct
14 Correct 2 ms 5468 KB Output is correct
15 Correct 1 ms 4956 KB Output is correct
16 Correct 2 ms 5212 KB Output is correct
17 Correct 6 ms 7652 KB Output is correct
18 Correct 3 ms 4956 KB Output is correct
19 Correct 7 ms 9048 KB Output is correct
20 Correct 4 ms 7004 KB Output is correct
21 Correct 2 ms 5724 KB Output is correct
22 Correct 5 ms 8796 KB Output is correct
23 Correct 7 ms 9564 KB Output is correct
24 Correct 5 ms 9308 KB Output is correct
25 Correct 29 ms 17752 KB Output is correct
26 Correct 84 ms 61624 KB Output is correct
27 Correct 285 ms 131968 KB Output is correct
28 Correct 228 ms 13076 KB Output is correct
29 Correct 204 ms 134448 KB Output is correct
30 Correct 321 ms 47780 KB Output is correct
31 Correct 508 ms 252636 KB Output is correct
32 Correct 475 ms 206144 KB Output is correct
33 Correct 54 ms 50124 KB Output is correct
34 Correct 215 ms 169416 KB Output is correct
35 Correct 406 ms 346216 KB Output is correct
36 Correct 485 ms 335440 KB Output is correct
37 Correct 504 ms 335400 KB Output is correct
38 Correct 441 ms 335576 KB Output is correct