oj.uz

답안 #82710

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
82710 2018-11-01T11:37:36 Z Bodo171 Semiexpress (JOI17_semiexpress) C++14
0 / 100
 2 ms 376 KB 
#include <iostream>
#include <fstream>
using namespace std;
const int nmax=3005;
long long v[nmax],act[nmax],dp[nmax];
int n,m,k,i,j;
long long a,b,c,T,coef;
int main()
{
    //freopen("data.in","r",stdin);
    cin>>n>>m>>k;
    cin>>a>>b>>c;
    cin>>T;
    for(i=1;i<=m;i++)
    {
        cin>>v[i];
    }
    k-=m;
    for(long long cnt=1;cnt<m;cnt++)
    {
        if(T-1LL*(cnt-1)*b>=0)
           act[0]=(1LL*T-(v[cnt]-1)*b)/a;
        else act[0]=0;
        for(coef=1;coef<=k;coef++)
        {
            if(1LL*T-(v[cnt]-1)*b-(act[coef-1]+1)*c>=0) act[coef]=act[coef-1]+(1LL*T-(v[cnt]-1)*b-(act[coef-1]+1)*c)/a+1;
            else act[coef]=act[coef-1];
            act[coef]=min(act[coef],v[cnt+1]-v[cnt]);
        }
        for(coef=1;coef<=k;coef++)
           if(act[coef]<v[cnt+1]-v[cnt])
            act[coef]++;
        for(i=k;i>=0;i--)
            for(j=0;j<=i;j++)
               dp[i]=max(dp[i],dp[i-j]+act[j]);
    }
    long long  cnt=m;
    if(T-1LL*(v[cnt]-1)*b>=0)
        dp[k]++;
    cout<<dp[k]-1;//vezi ultima statie
    return 0;
}

Subtask #1
0 / 18.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #3
0 / 52.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 2 ms 376 KB Output isn't correct
2 Halted 0 ms 0 KB -