oj.uz

Submission #231665

# Submission time Handle Problem Language Result Execution time Memory
231665 2020-05-14T10:22:03 Z kimbj0709 Building Bridges (CEOI17_building) C++14
100 / 100
 74 ms 29552 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
#define maxn 400050
struct Line {
  int m, b;
  int operator()(int x) { return m * x + b; }
} a[maxn*4];
void insert(int l, int r, Line seg, int o) {
  if(l + 1 == r) {
    if(seg(l) > a[o](l)) a[o] = seg;
    return;
  }
  int mid= (l + r) >> 1, lson = o * 2 + 1, rson = o * 2 + 2;
  if(a[o].m > seg.m) swap(a[o], seg);
  if(a[o](mid) < seg(mid)) {
    swap(a[o], seg);
    insert(l, mid, seg, lson);
  }
  else insert(mid, r, seg, rson);
}
int query(int l, int r, int x, int o) {
  if(l + 1 == r) return a[o](x);
  int mid = (l + r) >> 1, lson = o * 2 + 1, rson = o * 2 + 2;
  if(x < mid) return max(a[o](x), query(l, mid, x, lson));
  else return max(a[o](x), query(mid, r, x, rson));
}
int32_t main() {
  ios::sync_with_stdio(0);
  cin.tie(0);cout.tie(0);
  for(int i=0;i<maxn*4;i++){
    a[i] = {(int)0,(int)(-10000000000000000)};
  }
  int no_of_input;
  cin >> no_of_input;
  int input;
  int s = 0;
  vector<int> vect1;
  vector<int> vect2;
  vector<int> dp(no_of_input+1,0);
  for(int i=0;i<no_of_input;i++){
    cin >> input;
    vect1.push_back(input);
  }
  for(int i=0;i<no_of_input;i++){
    cin >> input;
    s += input;
    vect2.push_back(input);
  }
 
  s -= vect2[0];
  vect2[0] = 0;
  dp[0] = 0;
  Line temp;
  temp.m = 2*vect1[0];
  temp.b = -(vect1[0]*vect1[0]-vect2[0]);
  insert(0,maxn,temp,0);
  for(int i=1;i<no_of_input;i++){
    //cout << query(0,maxn,vect1[i],0) << endl;
    assert(query(0,maxn,vect1[i],0)!=-10000000000000000);
    dp[i] = -query(0,maxn,vect1[i],0)-vect2[i]+vect1[i]*vect1[i];
    Line temp;
    temp.m = 2*vect1[i];
    temp.b = -(vect1[i]*vect1[i]+dp[i]);
    //cout << temp.m << " " << temp.b << endl;
    insert(0,maxn,temp,0);
  }
  /*for(int i=0;i<no_of_input;i++){
    cout << dp[i] << ' ';
  }
  cout << endl;*/
  cout << dp[no_of_input-1]+s;
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 25472 KB Output is correct
2 Correct 17 ms 25344 KB Output is correct
3 Correct 17 ms 25472 KB Output is correct
4 Correct 17 ms 25472 KB Output is correct
5 Correct 17 ms 25472 KB Output is correct

Subtask #2
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 62 ms 29424 KB Output is correct
2 Correct 63 ms 29432 KB Output is correct
3 Correct 63 ms 29424 KB Output is correct
4 Correct 58 ms 29304 KB Output is correct
5 Correct 56 ms 29296 KB Output is correct

Subtask #3
40.0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 17 ms 25472 KB Output is correct
2 Correct 17 ms 25344 KB Output is correct
3 Correct 17 ms 25472 KB Output is correct
4 Correct 17 ms 25472 KB Output is correct
5 Correct 17 ms 25472 KB Output is correct
6 Correct 62 ms 29424 KB Output is correct
7 Correct 63 ms 29432 KB Output is correct
8 Correct 63 ms 29424 KB Output is correct
9 Correct 58 ms 29304 KB Output is correct
10 Correct 56 ms 29296 KB Output is correct
11 Correct 73 ms 28656 KB Output is correct
12 Correct 68 ms 28656 KB Output is correct
13 Correct 63 ms 28656 KB Output is correct
14 Correct 74 ms 28656 KB Output is correct
15 Correct 58 ms 28656 KB Output is correct
16 Correct 54 ms 29424 KB Output is correct
17 Correct 47 ms 29468 KB Output is correct
18 Correct 48 ms 29552 KB Output is correct