oj.uz

답안 #99040

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
99040 2019-02-28T07:15:14 Z arman_ferdous Building Bridges (CEOI17_building) C++17
100 / 100
 134 ms 66140 KB 
#include <bits/stdc++.h>
using namespace std;
 
using ll = long long;
const int N = 1e5+100;
const int MAX = 1e6+100;
const ll inf = 1e18;
 
struct LiChao{
	struct pt{ ll m, c; };
	ll eval(pt p, ll x) { return p.m * x + p.c; }
 
	pt t[MAX<<2];
	LiChao() { for(int i = 0; i < (MAX<<2); i++) t[i] = {0,inf}; }
	
	void insert(int node, int L, int R, pt p) {
		if(L == R) {
			if(eval(p,L) < eval(t[node],L)) t[node] = p;
			return;
		} int mid = (L+R)>>1, lc = node<<1, rc = lc|1;
 
		bool one = eval(p,L) < eval(t[node],L);
		bool two = eval(p,mid) < eval(t[node],mid);
 
		if(two) swap(t[node], p);
		if(one != two) insert(lc, L, mid, p);
		else insert(rc, mid+1, R, p);
	}
	ll get(int node, int L, int R, ll x) {
		if(L == R) return eval(t[node], x);
		int mid = (L+R)>>1, lc = node<<1, rc = lc|1;
		if(x <= mid) return min(eval(t[node], x), get(lc, L, mid, x));
		return min(eval(t[node], x), get(rc, mid+1, R, x));
	}
}ds;
 
int n;
ll h[N], w[N], S[N], dp[N];
 
int main() {
	scanf("%d", &n);
	for(int i = 1; i <= n; i++)
		scanf("%lld", &h[i]);
	for(int i = 1; i <= n; i++) {
		scanf("%lld", &w[i]);
		S[i] = S[i-1] + w[i];
	}
	dp[1] = 0;
	ds.insert(1, 0, MAX-1, {-2ll*h[1], h[1]*h[1] - S[1]});
	for(int i = 2; i <= n; i++) {
		ll got = ds.get(1, 0, MAX-1, h[i]);
		dp[i] = got + h[i] * h[i] + S[i-1];
		ds.insert(1, 0, MAX-1, {-2ll*h[i], dp[i] - S[i] + h[i] * h[i]});
	}
	printf("%lld\n", dp[n]);
	return 0;
}

Compilation message

building.cpp: In function 'int main()':
building.cpp:41:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d", &n);
  ~~~~~^~~~~~~~~~
building.cpp:43:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &h[i]);
   ~~~~~^~~~~~~~~~~~~~~
building.cpp:45:8: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
   scanf("%lld", &w[i]);
   ~~~~~^~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 62968 KB Output is correct
2 Correct 55 ms 62968 KB Output is correct
3 Correct 52 ms 62968 KB Output is correct
4 Correct 52 ms 62968 KB Output is correct
5 Correct 50 ms 63096 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 103 ms 66132 KB Output is correct
2 Correct 94 ms 66040 KB Output is correct
3 Correct 115 ms 66136 KB Output is correct
4 Correct 85 ms 66040 KB Output is correct
5 Correct 100 ms 66040 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 56 ms 62968 KB Output is correct
2 Correct 55 ms 62968 KB Output is correct
3 Correct 52 ms 62968 KB Output is correct
4 Correct 52 ms 62968 KB Output is correct
5 Correct 50 ms 63096 KB Output is correct
6 Correct 103 ms 66132 KB Output is correct
7 Correct 94 ms 66040 KB Output is correct
8 Correct 115 ms 66136 KB Output is correct
9 Correct 85 ms 66040 KB Output is correct
10 Correct 100 ms 66040 KB Output is correct
11 Correct 134 ms 66012 KB Output is correct
12 Correct 119 ms 66012 KB Output is correct
13 Correct 99 ms 66140 KB Output is correct
14 Correct 116 ms 66040 KB Output is correct
15 Correct 90 ms 66032 KB Output is correct
16 Correct 90 ms 66040 KB Output is correct
17 Correct 109 ms 66132 KB Output is correct
18 Correct 82 ms 66140 KB Output is correct