oj.uz

Submission #967464

# Submission time Handle Problem Language Result Execution time Memory
967464 2024-04-22T06:56:49 Z penguin133 Pinball (JOI14_pinball) C++17
29 / 100
 1000 ms 160064 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());
 
map <pi, int> mp[1005];
int n, m, A[100005], B[100005], C[100005], D[100005];
int dp(int x, int l, int r){
	if(l >= r)return 0;
	if(x == n + 1)return 1e18;
	if(mp[x].find({l, r}) != mp[x].end())return mp[x][{l, r}];
	int tmp = dp(x + 1, l, r);
	int lft = (A[x] <= l ? max(l, C[x]) : l), rgt = (B[x] >= r ? min(C[x], r) : r);
	tmp = min(tmp, dp(x + 1, lft, rgt) + D[x]);
	return mp[x][{l, r}] = tmp;
}
 
void solve(){
	cin >> n >> m;
	for(int i = 1; i <= n; i++)cin >> A[i] >> B[i] >> C[i] >> D[i];
	int res = dp(1, 1, m);
	if(res >= 1e17)cout << -1 << '\n';
	else cout << res;
}
 
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:34:1: warning: ISO C++ forbids declaration of 'main' with no type [-Wreturn-type]
   34 | main(){
      | ^~~~

Subtask #1
11.0 / 11.0

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

Subtask #2
18.0 / 18.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 25 ms 7772 KB Output is correct
10 Correct 52 ms 12364 KB Output is correct
11 Correct 19 ms 6748 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 3 ms 3676 KB Output is correct

Subtask #3
0 / 22.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 25 ms 7772 KB Output is correct
10 Correct 52 ms 12364 KB Output is correct
11 Correct 19 ms 6748 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 3 ms 3676 KB Output is correct
15 Correct 8 ms 3676 KB Output is correct
16 Correct 3 ms 3164 KB Output is correct
17 Execution timed out 1048 ms 160064 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #4
0 / 49.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 2396 KB Output is correct
2 Correct 1 ms 2396 KB Output is correct
3 Correct 1 ms 2396 KB Output is correct
4 Correct 0 ms 2396 KB Output is correct
5 Correct 1 ms 2396 KB Output is correct
6 Correct 1 ms 2648 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 1 ms 2396 KB Output is correct
9 Correct 25 ms 7772 KB Output is correct
10 Correct 52 ms 12364 KB Output is correct
11 Correct 19 ms 6748 KB Output is correct
12 Correct 2 ms 2908 KB Output is correct
13 Correct 2 ms 3164 KB Output is correct
14 Correct 3 ms 3676 KB Output is correct
15 Correct 8 ms 3676 KB Output is correct
16 Correct 3 ms 3164 KB Output is correct
17 Execution timed out 1048 ms 160064 KB Time limit exceeded
18 Halted 0 ms 0 KB -