# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
940859 | vivo2006 | Building Bridges (CEOI17_building) | C++17 | 81 ms | 66548 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<cstring>
#define MAXN 100001
#define int long long
using namespace std;
long long n, total, h[MAXN], w[MAXN], cur, dp[MAXN];
struct Line
{
long long m, b;
Line() {m = b = 1e12 + 10;}
Line(long long _m, long long _b)
{
m = _m;
b = _b;
}
long long operator() (long long x)
{
return m * x + b;
}
};
struct LiChao
{
Line arr[40 * MAXN];
void add(int ind, int l, int r, Line seg)
{
if(l == r)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |