結果
問題 | No.2261 Coffee |
ユーザー | sten_san |
提出日時 | 2023-04-07 22:19:10 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 252 ms / 2,000 ms |
コード長 | 3,503 bytes |
コンパイル時間 | 2,071 ms |
コンパイル使用メモリ | 203,248 KB |
実行使用メモリ | 7,168 KB |
最終ジャッジ日時 | 2024-10-02 19:48:29 |
合計ジャッジ時間 | 9,796 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
5,248 KB |
testcase_01 | AC | 2 ms
5,248 KB |
testcase_02 | AC | 2 ms
5,248 KB |
testcase_03 | AC | 2 ms
5,248 KB |
testcase_04 | AC | 2 ms
5,248 KB |
testcase_05 | AC | 2 ms
5,248 KB |
testcase_06 | AC | 2 ms
5,248 KB |
testcase_07 | AC | 2 ms
5,248 KB |
testcase_08 | AC | 2 ms
5,248 KB |
testcase_09 | AC | 2 ms
5,248 KB |
testcase_10 | AC | 2 ms
5,248 KB |
testcase_11 | AC | 2 ms
5,248 KB |
testcase_12 | AC | 2 ms
5,248 KB |
testcase_13 | AC | 2 ms
5,248 KB |
testcase_14 | AC | 2 ms
5,248 KB |
testcase_15 | AC | 2 ms
5,248 KB |
testcase_16 | AC | 2 ms
5,248 KB |
testcase_17 | AC | 10 ms
5,248 KB |
testcase_18 | AC | 9 ms
5,248 KB |
testcase_19 | AC | 8 ms
5,248 KB |
testcase_20 | AC | 7 ms
5,248 KB |
testcase_21 | AC | 9 ms
5,248 KB |
testcase_22 | AC | 7 ms
5,248 KB |
testcase_23 | AC | 9 ms
5,248 KB |
testcase_24 | AC | 230 ms
6,856 KB |
testcase_25 | AC | 198 ms
6,400 KB |
testcase_26 | AC | 245 ms
7,152 KB |
testcase_27 | AC | 230 ms
6,784 KB |
testcase_28 | AC | 165 ms
6,528 KB |
testcase_29 | AC | 163 ms
6,400 KB |
testcase_30 | AC | 128 ms
5,760 KB |
testcase_31 | AC | 203 ms
7,040 KB |
testcase_32 | AC | 202 ms
7,076 KB |
testcase_33 | AC | 202 ms
7,168 KB |
testcase_34 | AC | 200 ms
7,168 KB |
testcase_35 | AC | 199 ms
7,132 KB |
testcase_36 | AC | 197 ms
7,124 KB |
testcase_37 | AC | 199 ms
7,092 KB |
testcase_38 | AC | 246 ms
7,088 KB |
testcase_39 | AC | 242 ms
7,104 KB |
testcase_40 | AC | 245 ms
7,040 KB |
testcase_41 | AC | 250 ms
7,168 KB |
testcase_42 | AC | 252 ms
7,168 KB |
testcase_43 | AC | 249 ms
7,152 KB |
testcase_44 | AC | 247 ms
7,040 KB |
ソースコード
#include <bits/stdc++.h> using namespace std; struct iofast_t { iofast_t() { ios::sync_with_stdio(false); cin.tie(nullptr); } } iofast; struct uns_t {} uns; template <typename Element, typename Head, typename ...Args> auto vec(Element init, Head arg, Args ...args) { if constexpr (sizeof...(Args) == 0) return vector(arg, init); else return vector(arg, vec(init, args...)); } template <typename Element, typename Head, typename ...Args> auto vec(uns_t, Head arg, Args ...args) { return vec(Element(), arg, args...); } template <typename Container> auto distance(const Container &c, decltype(begin(c)) iter) { return distance(begin(c), iter); } template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>> auto isort(RIter first, RIter last, Compare comp = Compare()) { vector<int> i(distance(first, last)); iota(begin(i), end(i), 0); sort(begin(i), end(i), [&](auto x, auto y) { return comp(*(first + x), *(first + y)); }); return i; } template <typename, template <typename> typename, typename = void_t<>> struct detect : false_type {}; template <typename T, template <typename> typename Check> struct detect<T, Check, void_t<Check<T>>> : true_type {}; template <typename T, template <typename> typename Check> constexpr inline bool detect_v = detect<T, Check>::value; template <typename T> using has_member_sort = decltype(declval<T>().sort()); template <typename Container, typename Compare = less<typename Container::value_type>> auto sorted(Container c, Compare comp = Compare()) { if constexpr (detect_v<Container, has_member_sort>) { c.sort(comp); return c; } else { sort(begin(c), end(c), comp); return c; } } template <typename Container, typename Compare = equal_to<typename Container::value_type>> auto uniqued(Container c, Compare comp = Compare()) { c.erase(unique(begin(c), end(c), comp), end(c)); return c; } template <typename T, typename Compare = less<T>> T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); } template <typename T, typename Compare = less<T>> T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); } template <typename F> constexpr auto fix(F &&f) noexcept { return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable { return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...); }; } int main() { constexpr auto inf = INT64_MAX / 4; constexpr auto par = 5; int n; cin >> n; auto p = vec<array<int64_t, par>>(uns, n); for (auto &v : p) for (auto &e : v) cin >> e; array<int64_t, 1 << par> max; fill(begin(max), end(max), -inf); for (int bits = 0; bits < (1 << par); ++bits) { for (auto &v : p) { int64_t sum = 0; for (int i = 0; i < par; ++i) { if (bits & (1 << i)) { sum += v[i] * 2; } sum -= v[i]; } chmax(max[bits], sum); } } for (auto &v : p) { int64_t ans = -inf; for (int bits = 0; bits < (1 << par); ++bits) { int64_t sum = 0; for (int i = 0; i < par; ++i) { if (!(bits & (1 << i))) { sum += v[i] * 2; } sum -= v[i]; } chmax(ans, sum + max[bits]); } cout << ans << endl; } }