제출 #615934

#	제출 시각UTC-0	아이디	문제	언어	결과	실행 시간	메모리
615934	2022-07-31 15:32:26	Hanksburger	Building Bridges (CEOI17_building)	C++17	100 / 100	55 ms	7624 KiB

building

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
#include <bits/stdc++.h>
using namespace std;
long long seg[4000005], dp[100005], h[100005], w[100005];
vector<pair<long long, long long> > v;
void update(long long i, long long l, long long r, long long x)
{
    if (l==r)
    {
        if (v[x].first*l+v[x].second<v[seg[i]].first*l+v[seg[i]].second)
            seg[i]=x;
        return;
    }
    int m=(l+r)/2;
    if (v[x].first*m+v[x].second<v[seg[i]].first*m+v[seg[i]].second)
        swap(x, seg[i]);
    if (v[x].first<v[seg[i]].first)
        update(i*2+1, m+1, r, x);
    else
        update(i*2, l, m, x);
}
long long query(long long i, long long l, long long r, long long x)
{
    if (l==r)
        return v[seg[i]].first*x+v[seg[i]].second;
    long long m=(l+r)/2;
    if (x<=m)
        return min(v[seg[i]].first*x+v[seg[i]].second, query(i*2, l, m, x));
    else
        return min(v[seg[i]].first*x+v[seg[i]].second, query(i*2+1, m+1, r, x));
}
 
 
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX

• Subtask 1: 30 / 30
• Subtask 2: 30 / 30
• Subtask 3: 40 / 40