#309830 (C++14) No.783 門松計画

提出ソース

結果

問題	No.783 門松計画
ユーザー	Shuz*
提出日時	2019-01-11 22:47:50
言語	C++14 (gcc 12.3.0 + boost 1.83.0)
結果	WA
実行時間	-
コード長	7,607 bytes
コンパイル時間	1,902 ms
コンパイル使用メモリ	174,468 KB
実行使用メモリ	69,760 KB
最終ジャッジ日時	2024-05-07 18:25:55
合計ジャッジ時間	7,764 ms
ジャッジサーバーID （参考情報）	judge1 / judge2

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	3 ms 5,376 KB
testcase_02	AC	3 ms 5,376 KB
testcase_03	AC	2 ms 5,376 KB
testcase_04	WA	-
testcase_05	AC	2 ms 5,376 KB
testcase_06	WA	-
testcase_07	AC	2 ms 5,376 KB
testcase_08	AC	2 ms 5,376 KB
testcase_09	WA	-
testcase_10	AC	1,075 ms 11,264 KB
testcase_11	AC	984 ms 69,760 KB
testcase_12	AC	1,026 ms 27,648 KB
testcase_13	AC	42 ms 11,776 KB
testcase_14	AC	403 ms 11,136 KB
testcase_15	AC	270 ms 5,632 KB
testcase_16	AC	24 ms 5,376 KB
testcase_17	AC	59 ms 5,376 KB
testcase_18	AC	4 ms 5,376 KB
testcase_19	AC	424 ms 6,272 KB
testcase_20	AC	2 ms 5,376 KB
testcase_21	AC	17 ms 5,376 KB
testcase_22	AC	38 ms 5,376 KB
testcase_23	AC	2 ms 5,376 KB
testcase_24	WA	-
testcase_25	AC	95 ms 5,376 KB
testcase_26	AC	116 ms 5,376 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

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

/*
#include <boost/multiprecision/cpp_int.hpp>
using namespace boost::multiprecision;
using cint = cpp_int;
*/

/*
#pragma GCC optimize("", on)
#pragma GCC optimization_level 3
#define min(...) min({...})
#define max(...) max({...})
#define x first
#define y second
*/

// Define
using ll = long long;
using ull = unsigned long long;
using ld = long double;
const ll dx[4] = {1, 0, -1, 0};
const ll dy[4] = {0, 1, 0, -1};
const ll MOD = 1e9 + 7;
const ll inf = 1 << 30;
// const ll INF = LONG_MAX;
const ll INF = 1LL << 60;
const ull MAX = ULONG_MAX;
#define mp make_pair
#define pb push_back
#define eb emplace_back
#define endl '\n'
#define space ' '
#define def inline auto
#define func inline constexpr ll
#define run __attribute__((constructor)) def _
#define all(v) begin(v), end(v)
#define input(a) scanf("%lld", &(a))
#define print(a) printf("%lld\n", (a))
#define ok(a, b) (0 <= (a) && (a) < (b))
// #define at(pos) pos.x][pos.y
template <class T> using vvector = vector<vector<T>>;
template <class T>
using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;

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

#define dump(a, h, w)                                                          \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [" << endl;                      \
        rep(__i, h) {                                                          \
            rep(__j, w) cerr << a[__i][__j] << space;                          \
            cerr << endl;                                                      \
        }                                                                      \
        cerr << "]" << endl;                                                   \
    }

#define vdump(a, n)                                                            \
    {                                                                          \
        cerr << __LINE__ << ": " << #a << " = [";                              \
        rep(__i, n) if (__i) cerr << space << a[__i];                          \
        else cerr << a[__i];                                                   \
        cerr << "]" << endl;                                                   \
    }

struct edge {
    ll to, cost;
    edge(ll a, ll b) : to(a), cost(b) {}
};

struct position {
    ll x, y;
    position() {}
    position(ll a, ll b) : x(a), y(b) {}
    position next(ll k) { return {x + dx[k], y + dy[k]}; }
    ll mdist() { return abs(x) + abs(y); }
    double dist() { return sqrt(x * x + y * y); }
    double norm(ll d) {
        if (d == inf) return max(x, y);
        if (d == 1) return mdist();
        if (d == 2) return dist();
        return 0;
    }
    ll num(ll width) { return abs(x) * width + abs(y); }

    bool operator==(position a) { return x == a.x && y == a.y; }
    bool operator!=(position a) { return x != a.x || y != a.y; }
    bool operator<(position a) { return x < a.x && y < a.y; }
    bool operator>(position a) { return x > a.x && y > a.y; }
    bool operator<=(position a) { return x <= a.x && y <= a.y; }
    bool operator>=(position a) { return x >= a.x && y >= a.y; }
    position operator+(position a) { return position(x + a.x, y + a.y); }
    position operator-(position a) { return position(x - a.x, y - a.y); }
    position operator*(position a) { return position(x * a.x, y * a.y); }
    position operator/(position a) { return position(x / a.x, y / a.y); }
    position operator%(position a) { return position(x % a.x, y % a.y); }
    position complex(position a) {
        return position(x * a.x - y * a.y, x * a.y + y * a.x);
    }
    /*
        // for sort:
        bool operator<(position a) { return x ^ a.x ? x < a.x : y < a.y; }
        bool operator>(position a) { return x ^ a.x ? x > a.x : y > a.y; }
        bool operator<=(position a) { return x ^ a.x ? x < a.x : y <= a.y; }
        bool operator>=(position a) { return x ^ a.x ? x > a.x : y >= a.y; }
    */
};
position Origin = position(0, 0);
using pos = position;
using vec = position;

struct Range {
    ll left, right;
    Range() {}
    Range(ll l, ll r) : left(l), right(r) {}
    ll length() { return right - left; }
    bool operator==(Range A) { return left == A.left && right == A.right; }
    bool operator!=(Range A) { return !(Range(left, right) == A); }
    bool operator>(Range A) { return left < A.left && right > A.right; }
    bool operator<(Range A) { return left > A.left && right < A.right; }
    bool operator>=(Range A) { return left <= A.left && right >= A.right; }
    bool operator<=(Range A) { return left >= A.left && right <= A.right; }
};

// 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)
#define loop() for (;;)

// Stream
#define fout(n) cout << fixed << setprecision(n)
#define fasten cin.tie(0), ios::sync_with_stdio(0)

// Speed
run() { fasten, fout(10); }
#pragma GCC optimize("O3")
#pragma GCC target("avx")

// Math
//#define gcd __gcd
func gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
func lcm(ll a, ll b) { return a * b / gcd(a, b); }
func sign(ll a) { return a ? abs(a) / a : 0; }

template <class T> def in() {
    T A;
    cin >> A;
    return A;
}

template <class T>
def out(vector<vector<T>> A, ll H, ll W, char divc = space, char endc = endl) {
    rep(i, H) {
        rep(j, W) {
            if (j)
                cout << divc << A[i][j];
            else
                cout << A[i][j];
        }
        cout << endc;
    }
}

#define fi first
#define se second

ll N, C, DP1[51][51][51][51], DP2[51][51][51][51], L[51], W[51], res;
signed main() {
    cin >> N >> C;
    rep(i, N) cin >> L[i];
    rep(i, N) cin >> W[i];
    rep(j, N) rep(q, N) DP1[0][q][j][C - W[q]] = L[q];
    rep(j, N) rep(q, N) DP2[0][q][j][C - W[q]] = L[q];
    rep(i, 50) rep(j, N) rep(q, N) rep(k, C) {
        rep(p, N) {
            if (i & 1) {
                if (L[p] >= L[q]) continue;
            } else {
                if (L[p] <= L[q]) continue;
            }
            if (i && L[p] == L[j]) continue;
            if (k - W[p] >= 0 && DP1[i][q][j][k]) {
                DP1[i + 1][p][q][k - W[p]] =
                    max(DP1[i + 1][p][q][k - W[p]], DP1[i][q][j][k] + L[p]);
            }
        }
    }
    rep(i, 50) rep(j, N) rep(q, N) rep(k, C) {
        rep(p, N) {
            if (i & 1) {
                if (L[p] <= L[q]) continue;
            } else {
                if (L[p] >= L[q]) continue;
            }
            if (i && L[p] == L[j]) continue;
            if (k - W[p] >= 0 && DP2[i][q][j][k]) {
                DP2[i + 1][p][q][k - W[p]] =
                    max(DP2[i + 1][p][q][k - W[p]], DP2[i][q][j][k] + L[p]);
            }
        }
    }
    inc(i, 3, 50) rep(j, N) rep(q, N) rep(k, C + 1) res =
        max(res, DP1[i][j][q][k]);
    inc(i, 3, 50) rep(j, N) rep(q, N) rep(k, C + 1) res =
        max(res, DP2[i][j][q][k]);
    cout << res << endl;
}

// for compilation: g++ -Ofast -march=native -o _ _.cpp -std=c++17

yukicoder

結果

テストケース

ソースコード