| # | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 813744 | jun6873 | Harbingers (CEOI09_harbingers) | C++17 | 1087 ms | 25256 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;
using lint = long long;
using pint = pair<lint, lint>;
#define x first
#define y second
struct cht {
int a[100004];
lint b[100004];
int cnt = 0;
struct record {
int cnt, i;
int a;
lint b;
};
vector<record> rec;
void update(lint a0, lint b0) {
record r;
r.cnt = cnt;
while (cnt >= 2 and (b[cnt] - b[cnt - 1]) / (double)(a[cnt] - a[cnt - 1]) <=
(b0 - b[cnt]) / (double)(a0 - a[cnt]))
cnt--;
cnt++;
r.i = cnt;
| # | Verdict | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||