제출 #1070453

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1070453		Malix	추월 (IOI23_overtaking)	C++17	19 / 100	2 ms	480 KiB

overtaking

#include "overtaking.h"
#include <bits/stdc++.h>
using namespace std;
 
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> tii;
typedef vector<ll> li;
typedef vector<li> lii;
 
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define PB push_back
#define MP make_pair
#define LSOne(s) ((s)&(-s))
 
ll INF=1000000000000000010;
int inf=1e9+10;

vector<ll> arr,t;
vector<int> sz,w;
ll k;
int n,m;

void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S)
{
    n=N;m=M;
    k=(ll)X;
    sz=S;
    t=T;
    w=W;
    arr.resize(m);
    if(n==1)REP(i,0,m)arr[i]=T[0]+(ll)W[0]*(ll)S[i];
    return;
}

long long arrival_time(long long Y)
{
if(n==1){
    ll ans=Y+(ll)sz[m-1]*k;
    REP(i,1,m)if(arr[i]>=Y+(ll)k*sz[i]&&arr[i-1]<Y+(ll)k*sz[i-1]){
        ans=arr[i]+k*(ll)(sz[m-1]-sz[i]);
        return ans;
    }
    return ans;
}
    ll ans=Y+(ll)sz[1]*k;
    REP(i,0,n)if(t[i]<Y)ans=max(ans,t[i]+(ll)sz[1]*w[i]);
    return ans;
}

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