#include<iostream>
#include<algorithm>
#include<vector>
#include "overtaking.h"
using namespace std;
struct line
{
long long m,c;
long long calc(long long x){return m*x+c;}
long double intersect(line l){return (long double)(c-l.c)/(l.m-m);}
};
vector<line>lines;
vector<int>s;
long long l,n,m,x;
void init(int L, int N, std::vector<long long> T, std::vector<int> W, int X, int M, std::vector<int> S)
{
l=L;
n=N;
x=X;
m=M;
s=S;
vector<pair<int,int>>order;
for(int i=0;i<n;i++)
{
order.push_back({W[i],i});
}
sort(order.begin(),order.end());
for(int i=0;i<n;i++)
{
int id=order[i].second;
line l;
l.m=W[id];
l.c=T[id];
lines.push_back(l);
}
}
long long arrival_time(long long Y)
{
line cur;
cur.m=x;
cur.c=Y;
if(cur.m>=lines[0].m)
{
return cur.calc(l);
}
auto point=cur.intersect(lines[0]);
for(int j=0;j<m;j++)
{
if(s[j]>=point)
{
return cur.calc(l);
}
if(s[j]>point)
{
long long dist=lines[0].calc(s[j]);
return (l-dist)*x;
}
}
}
Compilation message (stderr)
overtaking.cpp: In function 'long long int arrival_time(long long int)':
overtaking.cpp:62:1: warning: control reaches end of non-void function [-Wreturn-type]
62 | }
| ^| # | 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... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |
| # | Verdict | Execution time | Memory | Grader output |
|---|
| Fetching results... |