이 제출은 이전 버전의 oj.uz에서 채점하였습니다. 현재는 제출 당시와는 다른 서버에서 채점을 하기 때문에, 다시 제출하면 결과가 달라질 수도 있습니다.
#include <bits/stdc++.h>
using namespace std;
#define st first
#define nd second
#define pb push_back
#define pf push_front
#define _pb pop_back
#define _pf pop_front
#define lb lower_bound
#define ub upper_bound
#define bg begin
#define ed end
#define ins insert
#define ers erase
#define mtp make_tuple
#define sz(x) (int)(x).size()
#define all(x) (x).bg(), (x).ed
#define ft front
#define bk back
#define ll long long
#define ull unsigned long long
#define db double
#define ldb long double
#define str string
#define pi pair<int, int>
#define pll pair<ll, ll>
#define vi vector<int>
#define vll vector<ll>
#define vpi vector<pi>
#define vpll vector<pll>
#define FOR(i, l, r) for (int i = (l); i <= (r); ++i)
#define FOS(i, r, l) for (int i = (r); i >= (l); --i)
#define FRN(i, n) for (int i = 0; i < (n); ++i)
#define FSN(i, n) for (int i = (n) - 1; i >= 0; --i)
#define EACH(i, x) for (auto &i : (x))
#define WHILE while
template<typename T> T gcd(T a, T b) { WHILE(b) { a %= b; swap(a, b); } return a; }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }
#define file "TEST"
mt19937 rd(chrono::steady_clock::now().time_since_epoch().count());
ll rand(ll l, ll r) { return uniform_int_distribution<ll>(l, r)(rd); }
struct Save {
int i;
pll v;
Save() {}
Save(int i, pll v) : i(i), v(v) {}
};
const int oo = 1e9 + 5;
const int T = 4e6 + 5;
const int N = 1e6 + 5;
const pll df = {0, 1e18};
int n, t[N], cnt[N];
ll d[N], d1[N];
ll cost(int i, pll d) { return 1LL * d.st * i + d.nd; }
pll tr[T];
vector<Save> s;
void upd(int i, int l, int r, pll v) {
int mid = l + (r - l) / 2;
if (cost(mid, v) < cost(mid, tr[i])) {
s.pb(Save(i, tr[i]));
swap(tr[i], v);
}
if (l == r) return;
if (cost(l, tr[i]) > cost(l, v)) upd(i * 2, l, mid, v);
else upd(i * 2 + 1, mid + 1, r, v);
}
ll get(int i, int l, int r, int q) {
ll rs = cost(q, tr[i]);
int mid = l + (r - l) / 2;
if (l == r) return rs;
if (q <= mid) rs = min(rs, get(i * 2, l, mid, q));
else rs = min(rs, get(i * 2 + 1, mid + 1, r, q));
return rs;
}
void roll(int cnt) {
FRN(i, cnt) {
tr[s.bk().i] = s.bk().v;
s._pb();
}
}
signed main() {
ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
// freopen(file".inp", "r", stdin);
// freopen(file".out", "w", stdout);
// s.resize(2e7);
// s.clear();
cin >> n;
FOR(i, 1, n) cin >> t[i];
int pos = 0;
FOR(i, 1, n << 2) tr[i] = df;
deque<int> d2;
FOS(i, n, 1) {
WHILE(!d2.empty() && t[d2.bk()] <= t[i]) {
roll(cnt[d2.bk()]);
d2._pb();
}
d1[i] = 1LL * (n - i + 1) * t[i] + (d2.empty()? 0 : d[d2.bk()]);
d2.pb(i);
int pre = sz(s);
upd(1, 1, n, {-t[i], d1[i] + 1LL * i * t[i]});
cnt[i] = sz(s) - pre;
d[i] = get(1, 1, n, i);
}
cout << d[1];
// cerr << "\nTime: " << setprecision(5) << fixed << (ldb)clock() / CLOCKS_PER_SEC << "ms\n";
return 0;
}
/*
*/
컴파일 시 표준 에러 (stderr) 메시지
Discharging.cpp: In function 'int main()':
Discharging.cpp:89:9: warning: unused variable 'pos' [-Wunused-variable]
89 | int pos = 0;
| ^~~
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |