# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
671107 | vuavisao | Discharging (NOI20_discharging) | C++14 | 100 ms | 19484 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>
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#define ll long long
#define ld long double
using namespace std;
const ll N = 1e6 + 10;
const ll INF = 1e18;
struct line {
ll a = 0, b = 0;
line() {};
line(ll _a, ll _b) { a = _a; b = _b; }
ll Fn(const ll& x) { return this -> a * x + this -> b; }
};
bool bad(line A, line B, line C) {
return (ld) (C.b - A.b) / (A.a - C.a) < (ld) (B.b - A.b) / (A.a - B.a);
}
struct CHT {
vector<line> memo = {};
ll ptr = 0; /// for a query where x has been sorted
void add_line(const line& cur) {
ll k = memo.size();
while(k >= 2 && bad(memo[k - 2], memo[k - 1], cur)) {
memo.pop_back();
Compilation message (stderr)
# | 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... |