제출 #1047159

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1047159		Abito	추월 (IOI23_overtaking)	C++17	39 / 100	3536 ms	16164 KiB

overtaking

#include "overtaking.h"
#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=1005;
int a[N],b[N],c[N],n,m,t[N][N],e[N][N];
void init(int32_t L, int32_t N, vector<long long> T, vector<int32_t> W, int32_t X, int32_t M, vector<int32_t> S)
{
    n=N,m=M;
    for (int i=0;i<n;i++) a[i]=T[i],b[i]=W[i];
    for (int i=0;i<m;i++) c[i]=S[i];
    b[n]=X;
    return;
}

long long arrival_time(long long Y)
{
    a[n]=Y;
    for (int i=0;i<=n;i++) t[i][0]=a[i];
    for (int j=1;j<m;j++){
        for (int i=0;i<=n;i++){
            t[i][j]=e[i][j]=t[i][j-1]+b[i]*(c[j]-c[j-1]);
        }
        for (int i=0;i<=n;i++){
            for (int k=0;k<=n;k++){
                if (t[k][j-1]<t[i][j-1]) t[i][j]=max(t[i][j],e[k][j]);
            }
        }
    }
    return t[n][m-1];
}

• Subtask 0: 0 / 0
• Subtask 1: 9 / 9
• Subtask 2: 10 / 10
• Subtask 3: 20 / 20
• Subtask 4: 0 / 26
• Subtask 5: 0 / 35