#include <bits/stdc++.h>
using namespace std;
#define int long long
#define ld long double
#define show(x,y) cout << y << " " << #x << endl;
#define show2(x,y,i,j) cout << y << " " << #x << " " << j << " " << #i << endl;
#define show3(x,y,i,j,p,q) cout << y << " " << #x << " " << j << " " << #i << " " << q << " " << #p << endl;
#define show4(x,y) for(auto it:y) cout << it << " "; cout << #x << endl;
typedef pair<long long,int>pii;
//typedef pair<pii,pii>pi2;
typedef array<int,3>pi2;
mt19937 rng(chrono::system_clock::now().time_since_epoch().count());
int n,m;
array<int,4>arr[1005]; //l r to cost
int memo[205][205][205];
int dp(int index, int l, int r){
if(index==-1){
if(l<=1&&r>=m){
return 0;
}
else{
return 1e15;
}
}
if(memo[index][l][r]!=-1) return memo[index][l][r];
int ans=1e15;
if(arr[index][2]>=l&&arr[index][2]<=r){
ans=min(ans,dp(index-1,min(l,arr[index][0]),max(r,arr[index][1]))+arr[index][3]);
}
if(r<l){
ans=min(ans,dp(index-1,arr[index][0],arr[index][1])+arr[index][3]);
}
ans=min(ans,dp(index-1,l,r));
//show3(l,l,r,r,ans,ans);
return memo[index][l][r]=ans;
}
void solve(){
cin >> n >> m;
for(int x=0;x<n;x++){
cin >> arr[x][0] >> arr[x][1] >> arr[x][2] >> arr[x][3];
}
memset(memo,-1,sizeof(memo));
int hold=dp(n-1,1,0);
if(hold>=1e15){
cout << -1;
}
else cout << hold;
}
int32_t main(){
ios::sync_with_stdio(0);
cin.tie(0);
int t=1;
//cin >> t;
while(t--){
solve();
}
}
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
67676 KB |
Output is correct |
2 |
Correct |
18 ms |
67676 KB |
Output is correct |
3 |
Correct |
14 ms |
67828 KB |
Output is correct |
4 |
Correct |
14 ms |
67712 KB |
Output is correct |
5 |
Correct |
14 ms |
67672 KB |
Output is correct |
6 |
Correct |
14 ms |
67676 KB |
Output is correct |
7 |
Correct |
13 ms |
67676 KB |
Output is correct |
8 |
Correct |
13 ms |
67840 KB |
Output is correct |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
67676 KB |
Output is correct |
2 |
Correct |
18 ms |
67676 KB |
Output is correct |
3 |
Correct |
14 ms |
67828 KB |
Output is correct |
4 |
Correct |
14 ms |
67712 KB |
Output is correct |
5 |
Correct |
14 ms |
67672 KB |
Output is correct |
6 |
Correct |
14 ms |
67676 KB |
Output is correct |
7 |
Correct |
13 ms |
67676 KB |
Output is correct |
8 |
Correct |
13 ms |
67840 KB |
Output is correct |
9 |
Runtime error |
71 ms |
137296 KB |
Execution killed with signal 11 |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
67676 KB |
Output is correct |
2 |
Correct |
18 ms |
67676 KB |
Output is correct |
3 |
Correct |
14 ms |
67828 KB |
Output is correct |
4 |
Correct |
14 ms |
67712 KB |
Output is correct |
5 |
Correct |
14 ms |
67672 KB |
Output is correct |
6 |
Correct |
14 ms |
67676 KB |
Output is correct |
7 |
Correct |
13 ms |
67676 KB |
Output is correct |
8 |
Correct |
13 ms |
67840 KB |
Output is correct |
9 |
Runtime error |
71 ms |
137296 KB |
Execution killed with signal 11 |
10 |
Halted |
0 ms |
0 KB |
- |
# |
결과 |
실행 시간 |
메모리 |
Grader output |
1 |
Correct |
24 ms |
67676 KB |
Output is correct |
2 |
Correct |
18 ms |
67676 KB |
Output is correct |
3 |
Correct |
14 ms |
67828 KB |
Output is correct |
4 |
Correct |
14 ms |
67712 KB |
Output is correct |
5 |
Correct |
14 ms |
67672 KB |
Output is correct |
6 |
Correct |
14 ms |
67676 KB |
Output is correct |
7 |
Correct |
13 ms |
67676 KB |
Output is correct |
8 |
Correct |
13 ms |
67840 KB |
Output is correct |
9 |
Runtime error |
71 ms |
137296 KB |
Execution killed with signal 11 |
10 |
Halted |
0 ms |
0 KB |
- |