結果

問題 No.949 飲酒プログラミングコンテスト
ユーザー haruki_Kharuki_K
提出日時 2019-12-19 20:48:57
言語 C++14
(gcc 13.2.0 + boost 1.83.0)
結果
AC  
実行時間 883 ms / 2,500 ms
コード長 4,945 bytes
コンパイル時間 1,833 ms
コンパイル使用メモリ 174,276 KB
実行使用メモリ 73,596 KB
最終ジャッジ日時 2023-09-21 07:12:02
合計ジャッジ時間 14,753 ms
ジャッジサーバーID
（参考情報） 		judge12 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 1 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 2 ms
4,376 KB
testcase_05 AC 1 ms
4,380 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 5 ms
4,376 KB
testcase_09 AC 3 ms
4,376 KB
testcase_10 AC 3 ms
4,380 KB
testcase_11 AC 532 ms
52,944 KB
testcase_12 AC 560 ms
53,840 KB
testcase_13 AC 477 ms
47,860 KB
testcase_14 AC 51 ms
9,060 KB
testcase_15 AC 381 ms
37,392 KB
testcase_16 AC 783 ms
66,912 KB
testcase_17 AC 74 ms
11,232 KB
testcase_18 AC 825 ms
70,492 KB
testcase_19 AC 527 ms
53,476 KB
testcase_20 AC 90 ms
13,284 KB
testcase_21 AC 32 ms
7,204 KB
testcase_22 AC 73 ms
11,916 KB
testcase_23 AC 7 ms
4,376 KB
testcase_24 AC 418 ms
39,720 KB
testcase_25 AC 836 ms
73,468 KB
testcase_26 AC 854 ms
73,536 KB
testcase_27 AC 863 ms
73,504 KB
testcase_28 AC 883 ms
73,480 KB
testcase_29 AC 764 ms
73,556 KB
testcase_30 AC 727 ms
73,504 KB
testcase_31 AC 713 ms
73,596 KB
testcase_32 AC 793 ms
73,464 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// >>> TEMPLATES
#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) for (int i = 0; i < int(n); i++)
#define rep1(i,n) for (int i = 1; i <= int(n); i++)
#define repR(i,n) for (int i = int(n)-1; i >= 0; i--)
#define rep1R(i,n) for (int i = int(n); i >= 1; i--)
#define loop(i,a,B) for (int i = a; i B; i++)
#define loopR(i,a,B) for (int i = a; i B; i--)
#define all(x) (x).begin(), (x).end()
#define allR(x) (x).rbegin(), (x).rend()
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fst first
#define snd second
#ifdef LOCAL
#define dump(...) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] ", dump_impl(#__VA_ARGS__, __VA_ARGS__)
#define say(x) cerr << "[" << __LINE__ << ":" << __FUNCTION__ << "] " << x << endl;
#define debug if (1)
void dump_impl(const char*) { cerr << endl; }
template <class T, class... U> void dump_impl(const char *s, T const& x, U const& ...y) { const char *o = "({[", *e = "]})"; for (int i = 0; *s != '\0'; cerr << *s++) { if (count(o,o+3,*s)) i++; if (count(e,e+3,*s)) i--; if (!i && *s == ',') break; } cerr << " = " << x; if (*s == ',') cerr << ", ", s++; dump_impl(s, y...); }
#else
#define dump(...)
#define say(x)
#define debug if (0)
#endif
using ll = long long;
using ld = long double;
template <class T> using pque_max = priority_queue<T>;
template <class T> using pque_min = priority_queue<T, vector<T>, greater<T> >;
template <class T, class = typename T::iterator, class = typename enable_if<!is_same<T, string>::value>::type>
ostream& operator<<(ostream& os, T const& v) { os << "{"; for (auto const& x : v) os << " " << x; return os << " }"; }
template <class T> istream& operator>>(istream& is, vector<T>& v) { for (auto& x : v) is >> x; return is; }
template <class T, class S> ostream& operator<<(ostream& os, pair<T,S> const& p) { return os << "(" << p.first << ", " << p.second << ")"; }
template <class T, class S> istream& operator>>(istream& is, pair<T,S>& p) { return is >> p.first >> p.second; }
template <size_t i, class T> typename enable_if<i >= tuple_size<T>::value>::type output_tuple(ostream&, T const&) { }
template <size_t i = 0, class T> typename enable_if<i < tuple_size<T>::value>::type
output_tuple(ostream& os, T const& t) { os << (i ? " " : "") << get<i>(t); output_tuple<i+1,T>(os,t); }
template <class... T> ostream& operator<<(ostream& os, tuple<T...> const& t) { return output_tuple(os,t), os; }
struct IOSetup { IOSetup() { cin.tie(nullptr); ios::sync_with_stdio(false); cout << fixed << setprecision(15); } } iosetup;
template <class F> struct FixPoint : private F {
    constexpr FixPoint(F&& f) : F(forward<F>(f)) {}
    template <class... T> constexpr auto operator()(T&&... x) const { return F::operator()(*this, forward<T>(x)...); }
};
struct MakeFixPoint {
    template <class F> constexpr auto operator|(F&& f) const { return FixPoint<F>(forward<F>(f)); }
};
#define MFP MakeFixPoint()|
#define def(name, ...) auto name = MFP [&](auto &&name, __VA_ARGS__)
template <class T, size_t d> struct vec_impl {
    using type = vector<typename vec_impl<T,d-1>::type>;
    template <class... U> static type make_v(size_t n, U&&... x) { return type(n, vec_impl<T,d-1>::make_v(forward<U>(x)...)); }
};
template <class T> struct vec_impl<T,0> { using type = T; static type make_v(T const& x = {}) { return x; } };
template <class T, size_t d = 1> using vec = typename vec_impl<T,d>::type;
template <class T, size_t d = 1, class... Args> auto make_v(Args&&... args) { return vec_impl<T,d>::make_v(forward<Args>(args)...); }
template <class T> void quit(T const& x) { cout << x << endl; exit(0); }
template <class T> constexpr bool chmin(T& x, T const& y) { if (x > y) { x = y; return true; } return false; }
template <class T> constexpr bool chmax(T& x, T const& y) { if (x < y) { x = y; return true; } return false; }
template <class It> constexpr auto sumof(It b, It e) { return accumulate(b,e,typename iterator_traits<It>::value_type{}); }
#define int ll
#define double ld
template <class T> int sz(T const& x) { return x.size(); }
const ll INF = (1LL<<62)-1; // ~ 4.6e18
// <<<

int32_t main() {
    int n; cin >> n;
    vector<int> a(n+1),b(n+1),d(n);
    cin >> a >> b >> d;
    sort(all(d));
    dump(d);

    auto check = [&](int m) -> bool {
        auto dp = make_v<int,2>(n+1,n+1);
        dp[0][0] = 1;
        rep (i,n+1) rep (j,n+1) if (dp[i][j]) {
            int k = m-1-i-j;
            if (k < 0) continue;
            dump(d[k]);
            if (i+1 < sz(a) && d[k] <= a[i+1]+b[j]) {
                dp[i+1][j] = 1;
            }
            if (j+1 < sz(b) && d[k] <= a[i]+b[j+1]) {
                dp[i][j+1] = 1;
            }
        }
        debug {
            rep (i,n+1) dump(i,dp[i]);
        }
        rep (i,m+1) if (dp[i][m-i]) return true;
        return false;
    };

    int l = 0, r = n+1;
    while (l+1 < r) {
        int m = (l+r)/2;
        (check(m) ? l : r) = m;
    }
    cout << l << endl;


}
0