# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
907143 | Dec0Dedd | Building Bridges (CEOI17_building) | C++14 | 71 ms | 8888 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;
typedef complex<long long> point;
#define ll long long
#define x real
#define y imag
const int MAXN = 2e5;
const int MAXH = 2e6;
const long long INF = 4e18;
long long dp[MAXN];
struct Line {
ll a, b;
ll operator()(ll x) {
return a*x+b;
}
};
struct Node {
Line seg;
Node *left = NULL, *right = NULL;
Node(Line x): seg(x) {};
};
void insert(int l, int r, Line seg, Node *nd) {
int m = (l+r)/2;
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |