結果

問題 No.1163 I want to be a high achiever
ユーザー Shuz*Shuz*
提出日時 2020-08-12 12:52:05
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 409 ms / 2,000 ms
コード長 4,792 bytes
コンパイル時間 1,692 ms
コンパイル使用メモリ 168,868 KB
実行使用メモリ 394,956 KB
最終ジャッジ日時 2024-10-09 18:09:28
合計ジャッジ時間 10,818 ms
ジャッジサーバーID
（参考情報） 		judge1 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 16 ms
19,840 KB
testcase_01 AC 15 ms
19,712 KB
testcase_02 AC 16 ms
19,840 KB
testcase_03 AC 15 ms
19,712 KB
testcase_04 AC 400 ms
394,808 KB
testcase_05 AC 365 ms
394,956 KB
testcase_06 AC 409 ms
394,928 KB
testcase_07 AC 340 ms
394,836 KB
testcase_08 AC 339 ms
394,720 KB
testcase_09 AC 348 ms
394,856 KB
testcase_10 AC 333 ms
394,784 KB
testcase_11 AC 339 ms
394,792 KB
testcase_12 AC 339 ms
394,852 KB
testcase_13 AC 340 ms
394,792 KB
testcase_14 AC 335 ms
394,888 KB
testcase_15 AC 337 ms
394,768 KB
testcase_16 AC 337 ms
394,912 KB
testcase_17 AC 335 ms
394,788 KB
testcase_18 AC 366 ms
394,748 KB
testcase_19 AC 313 ms
394,896 KB
testcase_20 AC 366 ms
394,844 KB
testcase_21 AC 306 ms
394,828 KB
testcase_22 AC 313 ms
394,752 KB
testcase_23 AC 306 ms
394,720 KB
testcase_24 AC 310 ms
394,788 KB
testcase_25 AC 310 ms
394,892 KB
testcase_26 AC 308 ms
394,880 KB
testcase_27 AC 15 ms
20,356 KB
testcase_28 AC 3 ms
6,816 KB
testcase_29 AC 306 ms
394,876 KB
testcase_30 AC 5 ms
6,836 KB
testcase_31 AC 5 ms
7,676 KB
testcase_32 AC 7 ms
9,692 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
template <class T> using pvector = vector<pair<T, T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
constexpr const ll dx[4] = {1, 0, -1, 0};
constexpr const ll dy[4] = {0, 1, 0, -1};
constexpr const ll MOD = 1e9 + 7;
constexpr const ll mod = 998244353;
constexpr const ll INF = 1LL << 60;
constexpr const ll inf = 1 << 30;
constexpr const char rt = '\n';
constexpr const char sp = ' ';
#define mp make_pair
#define mt make_tuple
#define pb push_back
#define eb emplace_back
#define elif else if
#define all(a, v, ...)                                                         \
    ([&](decltype((v)) w) { return (a)(begin(w), end(w), ##__VA_ARGS__); })(v)
#define rall(a, v, ...)                                                        \
    ([&](decltype((v)) w) { return (a)(rbegin(w), rend(w), ##__VA_ARGS__); })(v)
#define fi first
#define se second

template <class T> bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return 1;
    }
    return 0;
}
template <class T> bool chmin(T &a, const T &b) {
    if (a > b) {
        a = b;
        return 1;
    }
    return 0;
}

// Debug
#define debug(...)                                                             \
    {                                                                          \
        cerr << __LINE__ << ": " << #__VA_ARGS__ << " = ";                     \
        for (auto &&X : {__VA_ARGS__}) cerr << "[" << X << "] ";               \
        cerr << rt;                                                            \
    }

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << rt;                        \
        rep(_i, h) {                                                           \
            rep(_j, w) cerr << a[_i][_j] << sp;                                \
            cerr << rt;                                                        \
        }                                                                      \
        cerr << "]" << rt;                                                     \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(_i, n) if (_i) cerr << sp << a[_i];                                \
        else cerr << a[_i];                                                    \
        cerr << "]" << rt;                                                     \
    }

// Loop
#define inc(i, a, n) for (ll i = (a), _##i = (n); i <= _##i; ++i)
#define dec(i, a, n) for (ll i = (a), _##i = (n); i >= _##i; --i)
#define rep(i, n) for (ll i = 0, _##i = (n); i < _##i; ++i)
#define each(i, a) for (auto &&i : a)

// Stream
#define fout(n) cout << fixed << setprecision(n)
struct io {
    io() { cin.tie(nullptr), ios::sync_with_stdio(false); }
} io;

// Speed
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")

// Math
inline constexpr ll gcd(const ll a, const ll b) {
    return b ? gcd(b, a % b) : a;
}
inline constexpr ll lcm(const ll a, const ll b) { return a / gcd(a, b) * b; }

inline constexpr ll modulo(const ll n, const ll m = MOD) {
    ll k = n % m;
    return k + m * (k < 0);
}
inline constexpr ll chmod(ll &n, const ll m = MOD) {
    n %= m;
    return n += m * (n < 0);
}
inline constexpr ll mpow(ll a, ll n, const ll m = MOD) {
    ll r = 1;
    rep(i, 64) {
        if (n & (1LL << i)) r *= a;
        chmod(r, m);
        a *= a;
        chmod(a, m);
    }
    return r;
}
inline ll inv(const ll n, const ll m = MOD) {
    ll a = n, b = m, x = 1, y = 0;
    while (b) {
        ll t = a / b;
        a -= t * b;
        swap(a, b);
        x -= t * y;
        swap(x, y);
    }
    return modulo(x, m);
}

ll DP[501][100001];
signed main() {
    ll N, X;
    cin >> N >> X;

    ll A[N], B[N];
    rep(i, N) cin >> A[i], A[i] -= X;
    rep(i, N) cin >> B[i];
    rep(i, N + 1) rep(j, 100001) DP[i][j] = INF;
    DP[0][50000] = 0;
    rep(i, N) rep(j, 100001) {
        if (0 <= j + A[i] and j + A[i] < 100001)
            chmin(DP[i + 1][j + A[i]], DP[i][j]);
        chmin(DP[i + 1][j], DP[i][j] + B[i]);
    }
    ll res = INF;
    inc(i, 50000, 100000) chmin(res, DP[N][i]);
    if (*max_element(A, A + N) < 0)
        cout << -1 << endl;
    else
        cout << (res == INF ? -1 : res) << endl;
}

// -g -D_GLIBCXX_DEBUG -fsanitize=undefined
0