結果
問題 | No.2248 max(C)-min(C) |
ユーザー | sten_san |
提出日時 | 2023-03-17 22:36:00 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 118 ms / 3,000 ms |
コード長 | 3,873 bytes |
コンパイル時間 | 2,334 ms |
コンパイル使用メモリ | 213,796 KB |
実行使用メモリ | 15,104 KB |
最終ジャッジ日時 | 2023-10-18 15:32:11 |
合計ジャッジ時間 | 8,131 ms |
ジャッジサーバーID (参考情報) |
judge14 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,348 KB |
testcase_01 | AC | 2 ms
4,348 KB |
testcase_02 | AC | 2 ms
4,348 KB |
testcase_03 | AC | 2 ms
4,348 KB |
testcase_04 | AC | 2 ms
4,348 KB |
testcase_05 | AC | 2 ms
4,348 KB |
testcase_06 | AC | 2 ms
4,348 KB |
testcase_07 | AC | 3 ms
4,348 KB |
testcase_08 | AC | 3 ms
4,348 KB |
testcase_09 | AC | 3 ms
4,348 KB |
testcase_10 | AC | 2 ms
4,348 KB |
testcase_11 | AC | 3 ms
4,348 KB |
testcase_12 | AC | 3 ms
4,348 KB |
testcase_13 | AC | 3 ms
4,348 KB |
testcase_14 | AC | 3 ms
4,348 KB |
testcase_15 | AC | 3 ms
4,348 KB |
testcase_16 | AC | 2 ms
4,348 KB |
testcase_17 | AC | 3 ms
4,348 KB |
testcase_18 | AC | 101 ms
10,720 KB |
testcase_19 | AC | 14 ms
4,348 KB |
testcase_20 | AC | 117 ms
13,012 KB |
testcase_21 | AC | 112 ms
15,104 KB |
testcase_22 | AC | 77 ms
9,864 KB |
testcase_23 | AC | 50 ms
6,124 KB |
testcase_24 | AC | 20 ms
4,428 KB |
testcase_25 | AC | 107 ms
14,768 KB |
testcase_26 | AC | 93 ms
10,352 KB |
testcase_27 | AC | 107 ms
14,736 KB |
testcase_28 | AC | 11 ms
4,348 KB |
testcase_29 | AC | 96 ms
10,392 KB |
testcase_30 | AC | 39 ms
5,748 KB |
testcase_31 | AC | 116 ms
13,012 KB |
testcase_32 | AC | 23 ms
4,468 KB |
testcase_33 | AC | 36 ms
5,700 KB |
testcase_34 | AC | 117 ms
13,012 KB |
testcase_35 | AC | 118 ms
13,012 KB |
testcase_36 | AC | 117 ms
13,012 KB |
testcase_37 | AC | 61 ms
9,640 KB |
testcase_38 | AC | 112 ms
13,012 KB |
testcase_39 | AC | 112 ms
13,012 KB |
testcase_40 | AC | 113 ms
13,012 KB |
testcase_41 | AC | 96 ms
10,688 KB |
testcase_42 | AC | 112 ms
13,012 KB |
testcase_43 | AC | 101 ms
14,688 KB |
testcase_44 | AC | 113 ms
13,012 KB |
testcase_45 | AC | 86 ms
10,304 KB |
testcase_46 | AC | 45 ms
6,100 KB |
testcase_47 | AC | 112 ms
13,012 KB |
testcase_48 | AC | 93 ms
13,012 KB |
testcase_49 | AC | 116 ms
13,012 KB |
testcase_50 | AC | 115 ms
13,012 KB |
testcase_51 | AC | 116 ms
13,012 KB |
testcase_52 | AC | 116 ms
13,012 KB |
testcase_53 | AC | 20 ms
4,428 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 = INT_MAX; int n; cin >> n; auto a = vec<int>(uns, n); auto b = vec<int>(uns, n); for (auto &e : a) cin >> e; for (auto &e : b) cin >> e; for (int i = 0; i < n; ++i) { if (a[i] > b[i]) { swap(a[i], b[i]); } } auto p = vec<tuple<int, int>>(uns, 0); for (int i = 0; i < n; ++i) { p.push_back({ a[i], i }); p.push_back({ b[i], i }); p.push_back({ (a[i] + b[i]) / 2, i }); } sort(begin(p), end(p)); int ans = inf, sub = 1; auto count = vec<int>(0, n); count[get<1>(p[0])] = 1; auto l = begin(p), r = begin(p); auto incr = [&]() { if (r == prev(end(p))) { return false; } auto [y, i] = *++r; if (count[i]++ == 0) { ++sub; } return true; }; auto incl = [&]() { if (l == prev(end(p))) { return false; } auto [y, i] = *l++; if (--count[i] == 0) { --sub; } return true; }; while (r != end(p)) { if (!incr()) { break; } auto [y1, _1] = *r; while (sub == n) { auto [y2, _2] = *l; chmin(ans, y1 - y2); if (!incl()) { break; } } } cout << ans << endl; }