#include<bits/stdc++.h>
using namespace std;
#define lalala ios_base::sync_with_stdio(false);cin.tie(NULL);
//#define endl "\n"
#define ll long long
#define pb push_back
#define N 200005
// süre nerde pokemon_deg
vector<tuple<ll int,ll int,ll int>> pokemon;
int n,m,k;
ll int dp[101][102][2001];
map<int,int> mp;
ll int hesap(int hangi_pokemon,ll int sn,ll int sonyer){
if(dp[hangi_pokemon][sonyer][sn]!=0)return dp[hangi_pokemon][sonyer][sn];
if(hangi_pokemon>=m)return 0;
ll int a=hesap(hangi_pokemon+1,sn,sonyer);
ll int b=0;
ll int nerde,deg,tim;
tie(tim,nerde,deg)=pokemon[hangi_pokemon];
ll int xxx,yyy,zzz;
if(sonyer!=101)tie(yyy,xxx,zzz)=pokemon[sonyer];
else xxx=k;
if(tim>abs(nerde-xxx)+sn){
b=hesap(hangi_pokemon+1,sn+abs(nerde-xxx),hangi_pokemon)+deg;
}
dp[hangi_pokemon][sonyer][sn]=max(a,b);
return dp[hangi_pokemon][sonyer][sn];
}
int main(){
lalala;
cin>>n>>k>>m;
for(int i=0;i<m;i++){
ll int a,b,c;cin>>a>>b>>c;
pokemon.pb({c,a,b});
}
sort(pokemon.begin(),pokemon.end());
cout<<hesap(0,0,101)<<endl;
}
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
1 ms |
340 KB |
Output is correct |
| 2 |
Correct |
1 ms |
340 KB |
Output is correct |
| 3 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
| 4 |
Correct |
1 ms |
724 KB |
Output is correct |
| 5 |
Correct |
2 ms |
2260 KB |
Output is correct |
| 6 |
Incorrect |
2 ms |
3924 KB |
Output isn't correct |
| 7 |
Incorrect |
3 ms |
5332 KB |
Output isn't correct |
| 8 |
Incorrect |
4 ms |
5972 KB |
Output isn't correct |
| 9 |
Incorrect |
3 ms |
6228 KB |
Output isn't correct |
| 10 |
Incorrect |
7 ms |
10196 KB |
Output isn't correct |
