# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
335918 | mihai145 | Discharging (NOI20_discharging) | C++14 | 151 ms | 24556 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>
using namespace std;
struct Line
{
long long m, n;
long long eval(long long x)
{
return m * x + n;
}
long double intersect(Line l)
{
return (1.0 * (l.n - n)) / (1.0 * (m - l.m));
}
};
struct CHT
{
deque <Line> dq;
void Insert(Line l)
{
while((int)dq.size() > 1 && dq.end()[-1].intersect(l) < dq.end()[-2].intersect(dq.end()[-1]))
dq.pop_back();
dq.push_back(l);
# | 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... |