# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
431619 | kai824 | Long Distance Coach (JOI17_coach) | C++17 | 2003 ms | 16084 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define int long long
typedef pair<int,int> pii;
#define f first
#define s second
#define mp make_pair
int x,n,m,w,t;
int arr[200005],vals[200005];
int td[200005];//"time of death"
bool die[200005];
pii ppl[200005],kp[200005];
vector<pii> kk;
inline int calc(int dj,int cur_time){
return (cur_time/t) + (dj<=(cur_time%t)?1:0);
}
int32_t main(){
ios_base::sync_with_stdio(false);cin.tie(0);
cin>>x>>n>>m>>w>>t;
int cost=0;
for(int i=0;i<n;i++){//our "kill points" (+ end of journey)
cin>>arr[i];
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |