# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
65150 | Vahan | Split the sequence (APIO14_sequence) | C++17 | 1321 ms | 132096 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<iostream>
#include<deque>
#include<fstream>
using namespace std;
ifstream fin("./sequence/43");
long long d[100007][201],n,k,a[200000],A[200000];
long long i,j,cur;
deque<pair<long long,long long> > q;
bool bad(pair<long long,long long> x, pair<long long,long long> y, pair<long long,long long> z) {
long long p1=(y.first-z.first) * (y.second-x.second);
long long p2=(x.first-y.first) * (z.second-y.second);
return p1>=p2;
}
void addline(pair<long long,long long> x)
{
long long r=q.size()-1;
if(q.size()>=2 && bad(q[r-1],q[r],x))
{
q.pop_back();
r--;
}
q.push_back(x);
}
void setcur(long long x)
{
long long u=q.size()-1;
if (cur > u)
cur = u;
while (cur<u && q[cur + 1].first * x + q[cur + 1].second>=q[cur].first * x + q[cur].second)
# | 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... |