提出 #73216754


ソースコード 拡げる

#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>

using namespace std;

using i64 = long long;

int memo[21][1 << 18];
i64 f[1 << 18];
int a[20], b[20];
i64 suf_b[21];
int n, m;

bool dfs(int i, int mask) {
    if (mask == 0) return true;
    if (i >= m) return false;
    if (memo[i][mask] != -1) return memo[i][mask];
    if (f[mask] > suf_b[i]) return memo[i][mask] = 0;

    int sub = mask;
    while (sub > 0) {
        if (f[sub] <= b[i]) {
            if (dfs(i + 1, mask ^ sub)) {
                return memo[i][mask] = 1;
            }
        }
        sub = (sub - 1) & mask;
    }

    return memo[i][mask] = dfs(i + 1, mask);
}

void solve() {
    if (!(cin >> n >> m)) return;
    for (int i = 0; i < n; ++i) cin >> a[i];
    for (int i = 0; i < m; ++i) cin >> b[i];

    sort(a, a + n, greater<int>());
    sort(b, b + m, greater<int>());

    f[0] = 0;
    for (int i = 1; i < (1 << n); ++i) {
        int j = __builtin_ctz(i);
        f[i] = f[i ^ (1 << j)] + a[j];
    }

    suf_b[m] = 0;
    for (int i = m - 1; i >= 0; --i) {
        suf_b[i] = suf_b[i + 1] + b[i];
    }

    memset(memo, -1, sizeof(memo));
    if (dfs(0, (1 << n) - 1)) {
        cout << "Yes" << endl;
    } else {
        cout << "No" << endl;
    }
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

提出情報

提出日時
問題 E - 荷物の配送トラック
ユーザ xiaoe
言語 C++23 (GCC 15.2.0)
得点 433
コード長 1436 Byte
結果 AC
実行時間 151 ms
メモリ 25500 KiB

コンパイルエラー

./Main.cpp: In function 'bool dfs(int, int)':
./Main.cpp:20:50: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   20 |     if (f[mask] > suf_b[i]) return memo[i][mask] = 0;
      |                                    ~~~~~~~~~~~~~~^~~
./Main.cpp:26:38: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   26 |                 return memo[i][mask] = 1;
      |                        ~~~~~~~~~~~~~~^~~
./Main.cpp:32:26: warning: suggest parentheses around assignment used as truth value [-Wparentheses]
   32 |     return memo[i][mask] = dfs(i + 1, mask);
      |            ~~~~~~~~~~~~~~^~~~~~~~~~~~~~~~~~

ジャッジ結果

セット名 Sample All
得点 / 配点 0 / 0 433 / 433
結果
AC × 3
AC × 80
セット名 テストケース
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, in67.txt, in68.txt, in69.txt, in70.txt, in71.txt, in72.txt, in73.txt, in74.txt, in75.txt, in76.txt, in77.txt
ケース名 結果 実行時間 メモリ
in01.txt AC 10 ms 25060 KiB
in02.txt AC 10 ms 24992 KiB
in03.txt AC 9 ms 25196 KiB
in04.txt AC 9 ms 25028 KiB
in05.txt AC 9 ms 25196 KiB
in06.txt AC 10 ms 25028 KiB
in07.txt AC 9 ms 25204 KiB
in08.txt AC 10 ms 25244 KiB
in09.txt AC 10 ms 25244 KiB
in10.txt AC 10 ms 25392 KiB
in11.txt AC 10 ms 25344 KiB
in12.txt AC 10 ms 25420 KiB
in13.txt AC 10 ms 25320 KiB
in14.txt AC 10 ms 25316 KiB
in15.txt AC 10 ms 25244 KiB
in16.txt AC 10 ms 25244 KiB
in17.txt AC 10 ms 25116 KiB
in18.txt AC 151 ms 25316 KiB
in19.txt AC 10 ms 25388 KiB
in20.txt AC 11 ms 25420 KiB
in21.txt AC 10 ms 25500 KiB
in22.txt AC 19 ms 25248 KiB
in23.txt AC 9 ms 25244 KiB
in24.txt AC 10 ms 25248 KiB
in25.txt AC 10 ms 25500 KiB
in26.txt AC 10 ms 25320 KiB
in27.txt AC 9 ms 25244 KiB
in28.txt AC 9 ms 25088 KiB
in29.txt AC 9 ms 25060 KiB
in30.txt AC 10 ms 25132 KiB
in31.txt AC 10 ms 25452 KiB
in32.txt AC 10 ms 25340 KiB
in33.txt AC 10 ms 25284 KiB
in34.txt AC 10 ms 25064 KiB
in35.txt AC 10 ms 25088 KiB
in36.txt AC 10 ms 25060 KiB
in37.txt AC 10 ms 25076 KiB
in38.txt AC 10 ms 24992 KiB
in39.txt AC 10 ms 25116 KiB
in40.txt AC 10 ms 25116 KiB
in41.txt AC 9 ms 25064 KiB
in42.txt AC 10 ms 25028 KiB
in43.txt AC 9 ms 25192 KiB
in44.txt AC 10 ms 25392 KiB
in45.txt AC 139 ms 25376 KiB
in46.txt AC 10 ms 25500 KiB
in47.txt AC 10 ms 25284 KiB
in48.txt AC 10 ms 25420 KiB
in49.txt AC 10 ms 25284 KiB
in50.txt AC 10 ms 25500 KiB
in51.txt AC 9 ms 25316 KiB
in52.txt AC 10 ms 25316 KiB
in53.txt AC 10 ms 25392 KiB
in54.txt AC 10 ms 25248 KiB
in55.txt AC 10 ms 25372 KiB
in56.txt AC 13 ms 25500 KiB
in57.txt AC 10 ms 25328 KiB
in58.txt AC 10 ms 25296 KiB
in59.txt AC 10 ms 25420 KiB
in60.txt AC 9 ms 25164 KiB
in61.txt AC 10 ms 24964 KiB
in62.txt AC 10 ms 25376 KiB
in63.txt AC 10 ms 25344 KiB
in64.txt AC 10 ms 25240 KiB
in65.txt AC 10 ms 25320 KiB
in66.txt AC 10 ms 25060 KiB
in67.txt AC 10 ms 24988 KiB
in68.txt AC 10 ms 25084 KiB
in69.txt AC 10 ms 25136 KiB
in70.txt AC 10 ms 24964 KiB
in71.txt AC 10 ms 25088 KiB
in72.txt AC 10 ms 25064 KiB
in73.txt AC 10 ms 25116 KiB
in74.txt AC 10 ms 25316 KiB
in75.txt AC 10 ms 25392 KiB
in76.txt AC 10 ms 25052 KiB
in77.txt AC 10 ms 25060 KiB
sample01.txt AC 10 ms 25064 KiB
sample02.txt AC 10 ms 25196 KiB
sample03.txt AC 10 ms 24992 KiB