結果
問題 | No.703 ゴミ拾い Easy |
ユーザー | penguinshunya |
提出日時 | 2020-01-28 09:56:00 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 96 ms / 1,500 ms |
コード長 | 3,454 bytes |
コンパイル時間 | 1,871 ms |
コンパイル使用メモリ | 174,576 KB |
実行使用メモリ | 12,572 KB |
最終ジャッジ日時 | 2023-08-30 19:13:49 |
合計ジャッジ時間 | 6,789 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge15 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 4 ms
5,728 KB |
testcase_01 | AC | 3 ms
5,856 KB |
testcase_02 | AC | 4 ms
5,756 KB |
testcase_03 | AC | 4 ms
5,680 KB |
testcase_04 | AC | 4 ms
5,636 KB |
testcase_05 | AC | 3 ms
5,708 KB |
testcase_06 | AC | 3 ms
5,756 KB |
testcase_07 | AC | 4 ms
5,716 KB |
testcase_08 | AC | 3 ms
5,672 KB |
testcase_09 | AC | 3 ms
5,700 KB |
testcase_10 | AC | 3 ms
5,784 KB |
testcase_11 | AC | 3 ms
5,744 KB |
testcase_12 | AC | 3 ms
5,744 KB |
testcase_13 | AC | 3 ms
5,840 KB |
testcase_14 | AC | 3 ms
5,704 KB |
testcase_15 | AC | 4 ms
5,724 KB |
testcase_16 | AC | 4 ms
5,704 KB |
testcase_17 | AC | 3 ms
5,768 KB |
testcase_18 | AC | 4 ms
5,716 KB |
testcase_19 | AC | 4 ms
5,700 KB |
testcase_20 | AC | 3 ms
5,660 KB |
testcase_21 | AC | 4 ms
5,732 KB |
testcase_22 | AC | 4 ms
5,664 KB |
testcase_23 | AC | 4 ms
5,720 KB |
testcase_24 | AC | 94 ms
12,456 KB |
testcase_25 | AC | 94 ms
12,480 KB |
testcase_26 | AC | 94 ms
12,480 KB |
testcase_27 | AC | 94 ms
12,544 KB |
testcase_28 | AC | 94 ms
12,556 KB |
testcase_29 | AC | 93 ms
12,504 KB |
testcase_30 | AC | 93 ms
12,536 KB |
testcase_31 | AC | 93 ms
12,476 KB |
testcase_32 | AC | 94 ms
12,552 KB |
testcase_33 | AC | 94 ms
12,488 KB |
testcase_34 | AC | 83 ms
12,420 KB |
testcase_35 | AC | 82 ms
12,456 KB |
testcase_36 | AC | 82 ms
12,420 KB |
testcase_37 | AC | 82 ms
12,572 KB |
testcase_38 | AC | 82 ms
12,440 KB |
testcase_39 | AC | 81 ms
12,364 KB |
testcase_40 | AC | 83 ms
12,484 KB |
testcase_41 | AC | 81 ms
12,496 KB |
testcase_42 | AC | 82 ms
12,416 KB |
testcase_43 | AC | 82 ms
12,364 KB |
testcase_44 | AC | 3 ms
5,680 KB |
testcase_45 | AC | 3 ms
5,696 KB |
testcase_46 | AC | 96 ms
12,352 KB |
testcase_47 | AC | 96 ms
12,492 KB |
testcase_48 | AC | 4 ms
5,704 KB |
testcase_49 | AC | 3 ms
5,720 KB |
ソースコード
#include <bits/stdc++.h> #define rep(i, n) for (int i = 0; i < int(n); i++) #define rrep(i, n) for (int i = int(n) - 1; i >= 0; i--) #define reps(i, n) for (int i = 1; i <= int(n); i++) #define rreps(i, n) for (int i = int(n); i >= 1; i--) #define repc(i, n) for (int i = 0; i <= int(n); i++) #define rrepc(i, n) for (int i = int(n); i >= 0; i--) #define repi(i, a, b) for (int i = int(a); i < int(b); i++) #define repic(i, a, b) for (int i = int(a); i <= int(b); i++) #define each(x, y) for (auto &x : y) #define all(a) (a).begin(), (a).end() #define bit(b) (1ll << (b)) using namespace std; using i32 = int; using i64 = long long; using u64 = unsigned long long; using f80 = long double; using vi32 = vector<i32>; using vi64 = vector<i64>; using vu64 = vector<u64>; using vf80 = vector<f80>; using vstr = vector<string>; inline void yes() { cout << "Yes" << '\n'; exit(0); } inline void no() { cout << "No" << '\n'; exit(0); } inline i64 gcd(i64 a, i64 b) { if (min(a, b) == 0) return max(a, b); if (a % b == 0) return b; return gcd(b, a % b); } inline i64 lcm(i64 a, i64 b) { return a / gcd(a, b) * b; } inline u64 xorshift() { static u64 x = 88172645463325252ull; x = x ^ (x << 7); return x = x ^ (x >> 9); } template <typename T> class pqasc : public priority_queue<T, vector<T>, greater<T>> {}; template <typename T> class pqdesc : public priority_queue<T, vector<T>, less<T>> {}; template <typename T> inline void amax(T &x, T y) { if (x < y) x = y; } template <typename T> inline void amin(T &x, T y) { if (x > y) x = y; } template <typename T> inline T exp(T x, i64 n, T e = 1) { T r = e; while (n > 0) { if (n & 1) r *= x; x *= x; n >>= 1; } return r; } template <typename T> inline T bis(T ok, T ng, function<bool(T)> f, T eps = 1) { while (abs(ok - ng) > eps) { T mi = (ok + ng) / 2; (f(mi) ? ok : ng) = mi; } return ok; } template <typename T> istream& operator>>(istream &is, vector<T> &v) { each(x, v) is >> x; return is; } template <typename T> ostream& operator<<(ostream &os, vector<T> &v) { rep(i, v.size()) { if (i) os << ' '; os << v[i]; } return os; } template <typename T, typename S> istream& operator>>(istream &is, pair<T, S> &p) { is >> p.first >> p.second; return is; } template <typename T, typename S> ostream& operator<<(ostream &os, pair<T, S> &p) { os << p.first << ' ' << p.second; return os; } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); cout << fixed << setprecision(16); solve(); return 0; } struct ConvexHullTrick { using F = pair<i64, i64>; deque<F> deq; #define a first #define b second #define lines deq.size() bool invalid(F f0, F f1, F f2) { return (__int128_t) (f1.a - f0.a) * (f2.b - f1.b) >= (__int128_t) (f1.b - f0.b) * (f2.a - f1.a); } i64 f(F f, i64 x) { return f.a * x + f.b; } void add(F f) { while (lines >= 2 && invalid(deq[lines - 2], deq[lines - 1], f)) { deq.pop_back(); } deq.push_back(f); } i64 min(i64 x) { while (lines >= 2 && f(deq[0], x) >= f(deq[1], x)) { deq.pop_front(); } return f(deq[0], x); } #undef a #undef b #undef lines }; i64 dp[300001]; void solve() { int n; cin >> n; vi64 A(n), x(n), y(n); cin >> A >> x >> y; rep(i, 300001) dp[i] = 1e18; dp[0] = 0; ConvexHullTrick cht; rep(i, n) { i64 a = -2 * x[i]; i64 b = x[i] * x[i] + y[i] * y[i] + dp[i]; cht.add(make_pair(a, b)); dp[i + 1] = cht.min(A[i]) + A[i] * A[i]; } cout << dp[n] << endl; }