Submission #980982

#	Time	Username	Problem	Language	Result	Execution time	Memory
980982		vjudge1	추월 (IOI23_overtaking)	C++17	10 / 100	2194 ms	488 KiB

overtaking

#include <algorithm>
#include <fstream>
#include <vector>
#include <queue>
#include <stack>
#include <iostream>
#include <cmath>
#include <queue>
#include <set>
#include <string>
#include <cstring>
#include <map>
#include <unordered_map>
#include <unordered_set>
#define F first
#define S second
#define PB push_back
using namespace std;
const long long MOD=1e9+7, INF=1e18;
const int INFI=1e9;
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<int> vi;
typedef vector<vi> vvi;
typedef vector<ii> vii;
typedef vector<pair<int, ii>> viii;
typedef vector<vii> vvii;
typedef vector<ll> vll;
typedef vector<vll> vvll;

vll t;
vi w, s;
int l, n, x, m;
void init(int L, int N, vll T, vi W, int X, int M, vi SS)
//int main()
{
    l=L;    n=N;    x=X;    m=M;
    t=T;    w=W;    s=SS;
}

ll arrival_time(ll y){
    if(m>2) return 0;
    vll times(n+1, 0), ex(n+1, 0), ans(n+1, 0);
    for(int i=0;i<n;i++)    times[i]=t[i];
    times[n]=y;
    for(int i=0;i<n;i++)    ex[i]=times[i]+((ll)w[i]*(s[1]-s[0]));
    ex[n]=times[n]+((ll)x*(s[1]-s[0]));
    for(int i=0;i<=n;i++){
        ll mx=ex[i];
        for(int j=0;j<=n;j++)
            if(times[j]<times[i])   mx=max(mx, ex[j]);
        ans[i]=mx;
    }
    return ans[n];
}

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