제출 #1193064

#제출 시각아이디문제언어결과실행 시간메모리
1193064AmrOvertaking (IOI23_overtaking)C++20
0 / 100
0 ms324 KiB
#include "overtaking.h" #include<bits/stdc++.h> using namespace std; #define F first #define S second typedef long long ll; ll x; vector<int> s; ll m; ll ans[1002], ans2[1002]; void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S) { x = X; s = S; m = M; ans[0] = T[0]; for(int i = 1; i < M; i++) ans[i] = ans[i-1] + W[0] * (S[i]-S[i-1]); //for(int i = 0; i < M ;i++) cout << ans[i] << " "; return; } long long arrival_time(long long Y) { ans2[0] = Y; for(int i = 1; i < m; i++) {ans2[i] = ans2[i-1] + x * (s[i]-s[i-1]); if(ans[i-1]<ans2[i-1]&&ans2[i]<ans[i]) ans2[i] = ans[i];} return ans2[m-1]; }
#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...