# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
432282 | kai824 | Long Distance Coach (JOI17_coach) | C++17 | 178 ms | 17896 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 kp[200005],dp[200005];
int dea[200005];
pii ppl[200005];
inline int calc(int dj,int cur_time){
return ((cur_time/t) + (dj<=(cur_time%t)?1:0))*w;
}
vector<pair<int,pii> >cht;
int inter(pii a,pii b){
return (b.s-a.s)/(a.f-b.f);
}
void add_line(int m,int c){//strictly decreasing gradients...
pii ll=mp(m,c);
while(cht.size()>1 && inter(ll,cht.back().s)<=cht[cht.size()-2].f){
cht.pop_back();
}
if(cht.size()>0)cht.back().f=inter(cht.back().s,ll);
cht.emplace_back(LLONG_MAX,ll);
# | 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... |