# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
445150 | keta_tsimakuridze | Building Bridges (CEOI17_building) | C++14 | 134 ms | 67488 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>
#define f first
#define s second
#define ll long long
#define int long long
using namespace std;
const int N=2e6+5,mod=1e9+7;
int t,a[N],b[N],n;
pair<ll,ll>tree[4*N];
ll f(ll k,ll x,ll b){
return k*x+b;
}
void insert(int u,int l,int r,ll k,ll b) {
if(l==r) {
if(f(tree[u].f,l,tree[u].s) > f(k,l,b)) {
tree[u] = {k,b};
}
return;
}
int mid = (l+r)/2;
if(k < tree[u].f) {
swap(k,tree[u].f);
swap(b,tree[u].s);
}
if(f(k,mid,b) >= f(tree[u].f,mid,tree[u].s)) {
insert(2*u,l,mid,k,b);
}
else {
insert(2*u+1,mid+1,r,tree[u].f,tree[u].s);
tree[u] = {k,b};
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... |