提出 #73160341

ソースコード 拡げる

#include <bits/stdc++.h>
using namespace std;
int main()
{
    int N, M, K;
    cin >> N >> M >> K;
    vector<int> A(N), B(N);
    for (int i = 0; i < N; ++i)
        cin >> A[i] >> B[i];
    vector<vector<vector<long long>>> dp(N + 1, vector<vector<long long>>(K, vector<long long>(M + 1, -1e18)));
    for (int i = 0; i < N; ++i)
        dp[i][0][0] = 0;
    for (int i = 0; i < N; ++i)
    {
        for (int j = 0; j <= M; ++j)
        {
            for (int k = 1; k < K; ++k)
                dp[i + 1][k] = dp[i][k - 1];
            if (j + B[i] > M)
                continue;
            for (int k = 0; k < K; ++k)
                dp[i + 1][0][j + B[i]] = max(dp[i][k][j] + A[i], dp[i + 1][0][j + B[i]]);
        }
    }
    long long ans = 0;
    for (int i = 0; i <= N; ++i)
    {
        for (int j = 0; j <= M; ++j)
        {
            for (int k = 0; k < K; ++k)
                ans = max(ans, dp[i][k][j]);
        }
    }
    cout << ans << endl;
    return 0;
}

提出情報

提出日時
問題 D - 街道の商人
ユーザ dice360
言語 C++23 (GCC 15.2.0)
得点 400
コード長 1015 Byte
結果 AC
実行時間 388 ms
メモリ 68060 KiB

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 400 / 400
結果
AC × 3
AC × 69
セット名 テストケース
Sample sample01.txt, sample02.txt, sample03.txt
All sample01.txt, sample02.txt, sample03.txt, in01.txt, in02.txt, in03.txt, in04.txt, in05.txt, in06.txt, in07.txt, in08.txt, in09.txt, in10.txt, in11.txt, in12.txt, in13.txt, in14.txt, in15.txt, in16.txt, in17.txt, in18.txt, in19.txt, in20.txt, in21.txt, in22.txt, in23.txt, in24.txt, in25.txt, in26.txt, in27.txt, in28.txt, in29.txt, in30.txt, in31.txt, in32.txt, in33.txt, in34.txt, in35.txt, in36.txt, in37.txt, in38.txt, in39.txt, in40.txt, in41.txt, in42.txt, in43.txt, in44.txt, in45.txt, in46.txt, in47.txt, in48.txt, in49.txt, in50.txt, in51.txt, in52.txt, in53.txt, in54.txt, in55.txt, in56.txt, in57.txt, in58.txt, in59.txt, in60.txt, in61.txt, in62.txt, in63.txt, in64.txt, in65.txt, in66.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 1 ms 3544 KiB
in02.txt AC 1 ms 3576 KiB
in03.txt AC 1 ms 3368 KiB
in04.txt AC 1 ms 3564 KiB
in05.txt AC 2 ms 3928 KiB
in06.txt AC 386 ms 67988 KiB
in07.txt AC 1 ms 3576 KiB
in08.txt AC 1 ms 3496 KiB
in09.txt AC 1 ms 3448 KiB
in10.txt AC 11 ms 5952 KiB
in11.txt AC 234 ms 42792 KiB
in12.txt AC 2 ms 4236 KiB
in13.txt AC 2 ms 4844 KiB
in14.txt AC 1 ms 3568 KiB
in15.txt AC 3 ms 5684 KiB
in16.txt AC 1 ms 3800 KiB
in17.txt AC 385 ms 68004 KiB
in18.txt AC 1 ms 3532 KiB
in19.txt AC 238 ms 42820 KiB
in20.txt AC 2 ms 4248 KiB
in21.txt AC 388 ms 68024 KiB
in22.txt AC 388 ms 68036 KiB
in23.txt AC 385 ms 68012 KiB
in24.txt AC 377 ms 68008 KiB
in25.txt AC 380 ms 67896 KiB
in26.txt AC 1 ms 3752 KiB
in27.txt AC 193 ms 35652 KiB
in28.txt AC 2 ms 4020 KiB
in29.txt AC 1 ms 3448 KiB
in30.txt AC 1 ms 3576 KiB
in31.txt AC 1 ms 3448 KiB
in32.txt AC 1 ms 3368 KiB
in33.txt AC 1 ms 3520 KiB
in34.txt AC 1 ms 3520 KiB
in35.txt AC 1 ms 3568 KiB
in36.txt AC 1 ms 3368 KiB
in37.txt AC 1 ms 3752 KiB
in38.txt AC 2 ms 4104 KiB
in39.txt AC 1 ms 3380 KiB
in40.txt AC 1 ms 3380 KiB
in41.txt AC 1 ms 3608 KiB
in42.txt AC 1 ms 3576 KiB
in43.txt AC 1 ms 3416 KiB
in44.txt AC 2 ms 4088 KiB
in45.txt AC 388 ms 68024 KiB
in46.txt AC 386 ms 67896 KiB
in47.txt AC 285 ms 51756 KiB
in48.txt AC 1 ms 3832 KiB
in49.txt AC 4 ms 5260 KiB
in50.txt AC 380 ms 68060 KiB
in51.txt AC 385 ms 68024 KiB
in52.txt AC 283 ms 51804 KiB
in53.txt AC 1 ms 3608 KiB
in54.txt AC 1 ms 3600 KiB
in55.txt AC 1 ms 3600 KiB
in56.txt AC 1 ms 3416 KiB
in57.txt AC 1 ms 3416 KiB
in58.txt AC 1 ms 3416 KiB
in59.txt AC 1 ms 3416 KiB
in60.txt AC 1 ms 3448 KiB
in61.txt AC 1 ms 3368 KiB
in62.txt AC 1 ms 3416 KiB
in63.txt AC 1 ms 3532 KiB
in64.txt AC 1 ms 3448 KiB
in65.txt AC 1 ms 3576 KiB
in66.txt AC 1 ms 3380 KiB
sample01.txt AC 1 ms 3628 KiB
sample02.txt AC 1 ms 3600 KiB
sample03.txt AC 1 ms 3640 KiB