제출 #980991

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
980991		vjudge1	Overtaking (IOI23_overtaking)	C++17	19 / 100	2270 ms	600 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){
        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];
    }
    else if(n==1){
        ll ex1=t[0], ex2=y, t1=t[0], t2=y;
            for(int i=1;i<m;i++){
                ll aux1=t1, aux2=t2;
                ex1=t1+(w[0]*((ll)s[i]-s[i-1]));
                ex2=t2+((ll)x*((ll)s[i]-s[i-1]));
                if(aux2<aux1){
                    t1=max(ex1, ex2);
                    t2=ex2;
                }
                else if(aux1<aux2){
                    t2=max(ex1, ex2);
                    t1=ex1;
                }
                else{
                    t1=ex1;
                    t2=ex2;
                }
            }
            return t2;
    }
    else    return 0;
}

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