結果
問題 | No.1251 絶対に間違ってはいけない最小化問題 |
ユーザー | KoD |
提出日時 | 2020-10-09 21:55:50 |
言語 | C++17 (gcc 13.2.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 282 ms / 2,000 ms |
コード長 | 2,932 bytes |
コンパイル時間 | 821 ms |
コンパイル使用メモリ | 90,804 KB |
実行使用メモリ | 18,384 KB |
最終ジャッジ日時 | 2023-09-27 16:44:27 |
合計ジャッジ時間 | 16,929 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge15 |
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,380 KB |
testcase_03 | AC | 2 ms
4,376 KB |
testcase_04 | AC | 2 ms
4,376 KB |
testcase_05 | AC | 1 ms
4,376 KB |
testcase_06 | AC | 1 ms
4,380 KB |
testcase_07 | AC | 1 ms
4,380 KB |
testcase_08 | AC | 1 ms
4,376 KB |
testcase_09 | AC | 2 ms
4,380 KB |
testcase_10 | AC | 1 ms
4,380 KB |
testcase_11 | AC | 2 ms
4,376 KB |
testcase_12 | AC | 1 ms
4,376 KB |
testcase_13 | AC | 1 ms
4,380 KB |
testcase_14 | AC | 1 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 | 228 ms
17,256 KB |
testcase_19 | AC | 241 ms
16,988 KB |
testcase_20 | AC | 104 ms
11,032 KB |
testcase_21 | AC | 16 ms
4,608 KB |
testcase_22 | AC | 122 ms
12,068 KB |
testcase_23 | AC | 11 ms
4,380 KB |
testcase_24 | AC | 160 ms
14,416 KB |
testcase_25 | AC | 113 ms
11,500 KB |
testcase_26 | AC | 38 ms
6,232 KB |
testcase_27 | AC | 11 ms
4,380 KB |
testcase_28 | AC | 282 ms
18,056 KB |
testcase_29 | AC | 255 ms
18,100 KB |
testcase_30 | AC | 228 ms
18,108 KB |
testcase_31 | AC | 223 ms
18,152 KB |
testcase_32 | AC | 233 ms
18,048 KB |
testcase_33 | AC | 219 ms
18,376 KB |
testcase_34 | AC | 248 ms
18,044 KB |
testcase_35 | AC | 226 ms
18,228 KB |
testcase_36 | AC | 217 ms
18,056 KB |
testcase_37 | AC | 217 ms
18,096 KB |
testcase_38 | AC | 219 ms
18,112 KB |
testcase_39 | AC | 214 ms
18,052 KB |
testcase_40 | AC | 216 ms
18,108 KB |
testcase_41 | AC | 215 ms
18,384 KB |
testcase_42 | AC | 231 ms
18,236 KB |
testcase_43 | AC | 1 ms
4,380 KB |
testcase_44 | AC | 2 ms
4,376 KB |
ソースコード
#line 1 "main.cpp" /** * @title Template */ #include <iostream> #include <algorithm> #include <utility> #include <numeric> #include <vector> #include <array> #include <cassert> #include <map> #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/chmin_chmax.cpp" template <class T, class U> constexpr bool chmin(T &lhs, const U &rhs) { if (lhs > rhs) { lhs = rhs; return true; } return false; } template <class T, class U> constexpr bool chmax(T &lhs, const U &rhs) { if (lhs < rhs) { lhs = rhs; return true; } return false; } /** * @title Chmin/Chmax */ #line 2 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp" #line 4 "/Users/kodamankod/Desktop/cpp_programming/Library/other/range.cpp" class range { public: class iterator { private: int64_t M_position; public: constexpr iterator(int64_t position) noexcept: M_position(position) { } constexpr void operator ++ () noexcept { ++M_position; } constexpr bool operator != (iterator other) const noexcept { return M_position != other.M_position; } constexpr int64_t operator * () const noexcept { return M_position; } }; class reverse_iterator { private: int64_t M_position; public: constexpr reverse_iterator(int64_t position) noexcept: M_position(position) { } constexpr void operator ++ () noexcept { --M_position; } constexpr bool operator != (reverse_iterator other) const noexcept { return M_position != other.M_position; } constexpr int64_t operator * () const noexcept { return M_position; } }; private: const iterator M_first, M_last; public: constexpr range(int64_t first, int64_t last) noexcept: M_first(first), M_last(std::max(first, last)) { } constexpr iterator begin() const noexcept { return M_first; } constexpr iterator end() const noexcept { return M_last; } constexpr reverse_iterator rbegin() const noexcept { return reverse_iterator(*M_last - 1); } constexpr reverse_iterator rend() const noexcept { return reverse_iterator(*M_first - 1); } }; /** * @title Range */ #line 17 "main.cpp" using i32 = std::int32_t; using i64 = std::int64_t; using u32 = std::uint32_t; using u64 = std::uint64_t; using isize = std::ptrdiff_t; using usize = std::size_t; constexpr i32 inf32 = (i32(1) << 30) - 1; constexpr i64 inf64 = (i64(1) << 62) - 1; int main() { usize N; std::cin >> N; std::vector<i64> A(N), B(N); for (auto &x: A) { std::cin >> x; } for (auto &x: B) { std::cin >> x; } std::map<i64, i64> AB; for (auto i: range(0, N)) { AB[A[i]] += B[i]; } i64 sum = 0; for (const auto &[_, b]: AB) { sum += b; } i64 cur = 0; i64 ans = 0; for (const auto &[a, b]: AB) { cur += b; if (cur >= sum - cur) { ans = a; break; } } i64 calc = 0; for (const auto &[a, b]: AB) { calc += b * std::abs(ans - a); } std::cout << ans << ' ' << calc << '\n'; return 0; }