# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
1029016 | borisAngelov | Harbingers (CEOI09_harbingers) | C++17 | 56 ms | 20816 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;
const int maxn = 100005;
const long long inf = (1LL << 62);
int n;
vector<pair<int, int>> g[maxn];
struct Line
{
long long a;
long long b;
int node;
long long calc(long long x)
{
return a * x + b;
}
};
struct ConvexHullTrick
{
int sz = 0;
int ptr = 0;
pair<Line, double> lowerEnvelope[maxn];
stack<pair<int, int>> rollback;
double cross(const Line& l1, const Line& l2)
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |