oj.uz

답안 #207227

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
207227 2020-03-06T18:59:23 Z DodgeBallMan Building Bridges (CEOI17_building) C++14
100 / 100
 83 ms 36728 KB 
#include <bits/stdc++.h>
#define long long long
using namespace std;
 
const long INF = 1e18;
const int N = 1e5+5, M = 1e6, MXN = 1<<20;
 
struct line {
    long k, b;
    line(long k = 0, long b = INF) : k(k), b(b) { }
    long get(long x) { return k*x + b; }
} t[MXN<<1];
 
int n;
long dp[N], h[N], w[N];
bitset<MXN<<1> vis;
 
void update(line x, int p = 1, int l = 0, int r = M) {
    if(!vis[p]) { vis[p] = true, t[p] = x; return; }
    if(t[p].get(l) < x.get(l) && t[p].get(r) < x.get(r)) return;
    if(t[p].get(l) > x.get(l) && t[p].get(r) > x.get(r)) { t[p] = x; return; }
    int m = (l + r) >> 1;
    if(t[p].get(l) > x.get(l)) swap(t[p], x);
    if(l == r) return;
    if(t[p].get(m) > x.get(m)) swap(t[p], x), update(x, p<<1, l, m);
    else update(x, p<<1|1, m+1, r);
}
 
long query(long pos, int p = 1, int l = 0, int r = M) {
    if(l == r) return t[p].get(pos);
    int m = (l + r) >> 1;
    long ans = t[p].get(pos);
    if(pos <= m) ans = min(ans, query(pos, p<<1, l, m));
    else ans = min(ans, query(pos, p<<1|1, m+1, r));
    return ans;
}
 
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), w[i] += w[i-1];
    for(int i = 1; i <= n; ++i) {
        if(i != 1) dp[i] = h[i]*h[i] + w[i-1] + query(h[i]); 
        update(line(-2*h[i], dp[i] + h[i]*h[i] - w[i]));
    }
    printf("%lld\n", dp[n]);
}

Compilation message

building.cpp: In function 'int main()':
building.cpp:39:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d", &n);
     ~~~~~^~~~~~~~~~
building.cpp:40:38: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; ++i) scanf("%lld", h+i);
                                 ~~~~~^~~~~~~~~~~~~
building.cpp:41:51: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     for(int i = 1; i <= n; ++i) scanf("%lld", w+i), w[i] += w[i-1];
                                 ~~~~~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~

Subtask #1
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 33144 KB Output is correct
2 Correct 21 ms 33144 KB Output is correct
3 Correct 21 ms 33144 KB Output is correct
4 Correct 21 ms 33148 KB Output is correct
5 Correct 21 ms 33272 KB Output is correct

Subtask #2
30.0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 73 ms 35576 KB Output is correct
2 Correct 78 ms 36564 KB Output is correct
3 Correct 73 ms 36600 KB Output is correct
4 Correct 70 ms 36472 KB Output is correct
5 Correct 65 ms 36472 KB Output is correct

Subtask #3
40.0 / 40.0

# 결과 실행 시간 메모리 Grader output
1 Correct 37 ms 33144 KB Output is correct
2 Correct 21 ms 33144 KB Output is correct
3 Correct 21 ms 33144 KB Output is correct
4 Correct 21 ms 33148 KB Output is correct
5 Correct 21 ms 33272 KB Output is correct
6 Correct 73 ms 35576 KB Output is correct
7 Correct 78 ms 36564 KB Output is correct
8 Correct 73 ms 36600 KB Output is correct
9 Correct 70 ms 36472 KB Output is correct
10 Correct 65 ms 36472 KB Output is correct
11 Correct 81 ms 36664 KB Output is correct
12 Correct 80 ms 36600 KB Output is correct
13 Correct 70 ms 36584 KB Output is correct
14 Correct 83 ms 36728 KB Output is correct
15 Correct 63 ms 36472 KB Output is correct
16 Correct 66 ms 36472 KB Output is correct
17 Correct 53 ms 36604 KB Output is correct
18 Correct 54 ms 36600 KB Output is correct