oj.uz

Submission #721426

# Submission time Handle Problem Language Result Execution time Memory
721426 2023-04-10T21:51:59 Z Dan4Life Building Bridges (CEOI17_building) C++17
30 / 100
 67 ms 34980 KB 
#include <bits/stdc++.h>
using namespace std;
#define int long long
const int mxN = (int)1e5+10;
const int mxC = (int)1e6+10;
const int LINF = (int)1e9+10;
int n, m, x, h[mxN], w[mxN], dp[mxN];

struct Line{
	int m, c;
	Line(){ m=c=LINF; }
	Line(int _m, int _c){ m = _m, c = _c;}
	int operator()(int x){ return m*x+c; }
} seg[2*mxC+10];

void addLine(Line a, int p=0, int l=1, int r=mxC){
	if(l==r){
		if(seg[p](l)>a(l)) seg[p]=a;
		return;
	}
	int mid = (l+r)>>1; int rp = p+2*(mid-l+1);
	if(a.m > seg[p].m) swap(a,seg[p]);
	if(a(mid) < seg[p](mid))
		swap(a,seg[p]), addLine(a,p+1,l,mid);
	else addLine(a,rp,mid+1,r);
}

int query(int x, int p=0, int l=1, int r=mxC){
	if(l==r) return seg[p](x);
	int mid = (l+r)>>1; int rp = p+2*(mid-l+1);
	if(x<=mid) return min(query(x,p+1,l,mid),seg[p](x));
	return min(query(x,rp,mid+1,r),seg[p](x));
}

int32_t main()
{
    ios_base::sync_with_stdio(false); cin.tie(0);
    cin >> n; 
    for(int i = 1; i <= n; i++) cin >> h[i];
    for(int i = 1; i <= n; i++) cin >> w[i];
	dp[1] = -w[1];
	for(int i = 1; i <= n; i++){
		if(i>1)dp[i] = query(h[i])+h[i]*h[i]-w[i];
		addLine({-2*h[i],dp[i]+h[i]*h[i]});
	}
	cout << accumulate(w+1,w+n+1,0ll)+dp[n];
}

Subtask #1
30.0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Correct 15 ms 31604 KB Output is correct
3 Correct 13 ms 31576 KB Output is correct
4 Correct 14 ms 31644 KB Output is correct
5 Correct 14 ms 31572 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 67 ms 34932 KB Output is correct
2 Correct 53 ms 34896 KB Output is correct
3 Correct 49 ms 34980 KB Output is correct
4 Correct 53 ms 34832 KB Output is correct
5 Incorrect 45 ms 34824 KB Output isn't correct
6 Halted 0 ms 0 KB -

Subtask #3
0 / 40.0

# Verdict Execution time Memory Grader output
1 Correct 13 ms 31572 KB Output is correct
2 Correct 15 ms 31604 KB Output is correct
3 Correct 13 ms 31576 KB Output is correct
4 Correct 14 ms 31644 KB Output is correct
5 Correct 14 ms 31572 KB Output is correct
6 Correct 67 ms 34932 KB Output is correct
7 Correct 53 ms 34896 KB Output is correct
8 Correct 49 ms 34980 KB Output is correct
9 Correct 53 ms 34832 KB Output is correct
10 Incorrect 45 ms 34824 KB Output isn't correct
11 Halted 0 ms 0 KB -