結果
問題 | No.703 ゴミ拾い Easy |
ユーザー | t98slider |
提出日時 | 2023-01-31 03:43:58 |
言語 | C++14 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 92 ms / 1,500 ms |
コード長 | 3,073 bytes |
コンパイル時間 | 2,733 ms |
コンパイル使用メモリ | 174,320 KB |
実行使用メモリ | 10,244 KB |
最終ジャッジ日時 | 2023-09-12 22:52:22 |
合計ジャッジ時間 | 9,142 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,384 KB |
testcase_04 | AC | 2 ms
4,380 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 2 ms
4,380 KB |
testcase_07 | AC | 2 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,376 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,380 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 2 ms
4,380 KB |
testcase_15 | AC | 2 ms
4,380 KB |
testcase_16 | AC | 2 ms
4,380 KB |
testcase_17 | AC | 2 ms
4,376 KB |
testcase_18 | AC | 2 ms
4,380 KB |
testcase_19 | AC | 2 ms
4,376 KB |
testcase_20 | AC | 2 ms
4,376 KB |
testcase_21 | AC | 2 ms
4,376 KB |
testcase_22 | AC | 2 ms
4,376 KB |
testcase_23 | AC | 2 ms
4,376 KB |
testcase_24 | AC | 92 ms
10,168 KB |
testcase_25 | AC | 91 ms
10,216 KB |
testcase_26 | AC | 92 ms
10,172 KB |
testcase_27 | AC | 90 ms
10,052 KB |
testcase_28 | AC | 91 ms
10,136 KB |
testcase_29 | AC | 91 ms
10,060 KB |
testcase_30 | AC | 91 ms
10,120 KB |
testcase_31 | AC | 92 ms
10,116 KB |
testcase_32 | AC | 91 ms
10,124 KB |
testcase_33 | AC | 91 ms
10,156 KB |
testcase_34 | AC | 78 ms
10,052 KB |
testcase_35 | AC | 79 ms
10,224 KB |
testcase_36 | AC | 80 ms
10,124 KB |
testcase_37 | AC | 78 ms
10,108 KB |
testcase_38 | AC | 80 ms
10,108 KB |
testcase_39 | AC | 80 ms
10,136 KB |
testcase_40 | AC | 79 ms
10,128 KB |
testcase_41 | AC | 77 ms
10,176 KB |
testcase_42 | AC | 78 ms
10,244 KB |
testcase_43 | AC | 79 ms
10,112 KB |
testcase_44 | AC | 2 ms
4,380 KB |
testcase_45 | AC | 2 ms
4,380 KB |
testcase_46 | AC | 92 ms
10,040 KB |
testcase_47 | AC | 90 ms
10,056 KB |
testcase_48 | AC | 2 ms
4,380 KB |
testcase_49 | AC | 2 ms
4,376 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; using ll = long long; class LiChaoTree{ struct Line{ long long a, b; long long get(long long x){return a * x + b; } Line(long long a, long long b) : a(a), b(b) {} }; struct Node { Node *left, *right; Line line; Node(Line line) : left(nullptr), right(nullptr), line(line) {} }; const long long inf = 1ll << 60; const Line inf_line = Line{0, inf}; Node *root; long long lx, rx; Node* _add_line(Node *nd, Line line, long long l, long long r){ if(l == r) return nullptr; if(nd == nullptr) return new Node(line); long long m = (l + r) >> 1; bool left = (line.get(l) <= nd->line.get(l)); bool mid = (line.get(m) <= nd->line.get(m)); bool right = (line.get(r) <= nd->line.get(r)); if(left && right)nd->line = line; if(left == right)return nd; if(mid) std::swap(nd->line, line); if(left != mid){ nd->left = _add_line(nd->left, line, l, m); }else{ nd->right = _add_line(nd->right, line, m, r); } return nd; } Node* _add_segment_line(long long a, long long b, Node *nd, Line line, long long l, long long r) { if(r <= a || b <= l) return nd; if(a <= l && r <= b) return _add_line(nd, line, l, r); if(nd == nullptr) nd = new Node(inf_line); long long m = (l + r) >> 1; nd->left = _add_segment_line(a, b, nd->left, line, l, m); nd->right = _add_segment_line(a, b, nd->right, line, m, r); return nd; } long long query(long long x, long long l, long long r){ Node *nd = root; long long res = inf; while(r > l && nd != nullptr) { long long m = (l + r) >> 1; res = std::min(res, nd->line.get(x)); if(x < m) { r = m; nd = nd->left; } else { l = m; nd = nd->right; } } return res; } public: // [xl, xr) LiChaoTree(long long lx, long long rx) : lx(lx), rx(rx), root(nullptr) {} void add_line(long long a, long long b) { Line line(a, b); root = _add_line(root, line, lx, rx); } void add_segment_line(long long a, long long b, long long l, long long r) { Line line = Line{a, b}; root = _add_segment_line(l, r, root, line, lx, rx); } long long get(long long x) { return query(x, lx, rx); } }; int main(){ ios::sync_with_stdio(false); cin.tie(0); int n; cin >> n; vector<ll> a(n), x(n), y(n); for(auto &&v:a)cin >> v; for(auto &&v:x)cin >> v; for(auto &&v:y)cin >> v; LiChaoTree LCT(0, 100001); LCT.add_line(-2 * x[0], x[0] * x[0] + y[0] * y[0]); for(int i = 0; i + 1 < n; i++){ ll v = LCT.get(a[i]) + a[i] * a[i]; LCT.add_line(-2 * x[i + 1], x[i + 1] * x[i + 1] + y[i + 1] * y[i + 1] + v); } cout << LCT.get(a.back()) + a.back() * a.back() << '\n'; }