# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
217129 | 2020-03-29T05:48:50 Z | juggernaut | 코알라 (JOI13_koala) | C++14 | 10 ms | 512 KB |
//Just try and the idea will come #include<bits/stdc++.h> #define fr first #define sc second using namespace std; typedef long long int ll; ll k,m,d,a,n,i,dp[1005],j; pair<ll,ll>p[1005]; int main(){ scanf("%lld%lld%lld%lld%lld",&k,&m,&d,&a,&n); for(i=2;i<n+2;i++)scanf("%lld%lld",&p[i].fr,&p[i].sc); p[1]={k,0}; n+=2; p[n]={m,0}; for(i=2;i<=n;i++){ dp[i]=-1e18; for(j=1;j<i;j++)dp[i]=max(dp[i],dp[j]-a*((p[i].fr-p[j].fr+d-1)/d)+p[i].sc); } printf("%lld",dp[n]); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Correct | 8 ms | 384 KB | Output is correct |
2 | Correct | 8 ms | 384 KB | Output is correct |
3 | Correct | 7 ms | 384 KB | Output is correct |
4 | Correct | 5 ms | 384 KB | Output is correct |
5 | Correct | 8 ms | 384 KB | Output is correct |
6 | Correct | 8 ms | 384 KB | Output is correct |
7 | Correct | 4 ms | 384 KB | Output is correct |
8 | Correct | 10 ms | 384 KB | Output is correct |
9 | Correct | 8 ms | 384 KB | Output is correct |
10 | Correct | 8 ms | 384 KB | Output is correct |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Runtime error | 5 ms | 512 KB | Execution killed with signal 11 (could be triggered by violating memory limits) |
2 | Halted | 0 ms | 0 KB | - |