제출 #1070321

#제출 시각아이디문제언어결과실행 시간메모리
1070321Malix추월 (IOI23_overtaking)C++17
0 / 100
0 ms348 KiB
#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; vector<int> sz; 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; arr.resize(m); REP(i,0,m)arr[i]=T[0]+(ll)W[0]*(ll)S[i]; k=(ll)X; sz=S; return; } long long arrival_time(long long Y) { ll ans=Y+(ll)sz[m-1]*k; if(Y==0)return ans; REP(i,1,m)if(arr[i]>Y+(ll)k*sz[i]){ ans=arr[i]+k*(ll)(sz[m-1]-sz[i]); return ans; } return ans; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...