oj.uz

Submission #967469

# Submission time Handle Problem Language Result Execution time Memory
967469 2024-04-22T07:15:35 Z penguin133 Pinball (JOI14_pinball) C++17
11 / 100
 1 ms 4956 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], 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] = root->qry(A[i], C[i]) + D[i];
		root->upd(C[i], dp[i]);
	}
	root = new node(1, m);
	root->upd(m, 0);
	int ans = 1e18;
	for(int i = 1; i <= n; i++){
		dp2[i] = root->qry(C[i], B[i]) + D[i];
		root->upd(C[i], dp2[i]);
		ans = min(ans, dp[i] + dp2[i] - D[i]);
	}
	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:70:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   70 | main(){
      | ^~~~

Subtask #1
11.0 / 11.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 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 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct

Subtask #2
0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 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 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Incorrect 1 ms 4956 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 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 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Incorrect 1 ms 4956 KB Output isn't correct
12 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 4440 KB Output is correct
2 Correct 1 ms 4444 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 4440 KB Output is correct
6 Correct 1 ms 4440 KB Output is correct
7 Correct 1 ms 4440 KB Output is correct
8 Correct 1 ms 4444 KB Output is correct
9 Correct 1 ms 4700 KB Output is correct
10 Correct 1 ms 4956 KB Output is correct
11 Incorrect 1 ms 4956 KB Output isn't correct
12 Halted 0 ms 0 KB -