提出 #73249016

ソースコード 拡げる

#include <algorithm>
//#include <atcoder/all>
//#include <array>
//#include <bitset>
//#include <cmath>
//#include <deque>
#include <iostream>
#include <map>
//#include <numeric>
#include <queue>
//#include <ranges>
#include <set>
#include <unordered_map>
#include <unordered_set>
#include <vector>
#define pb push_back
#define fr first
#define sc second
#define sor(v) sort(v.begin(), v.end())
#define rev(v) reverse(v.begin(), v.end())
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
using namespace std;
using ll = long long;
using pint = pair<int,int>;
//using pll = pair<ll,ll>;
//using pqdec = priority_queue<int,vector<int>,greater<int>>;
//using pqdecl = priority_queue<ll,vector<ll>,greater<ll>>;
template <typename T>
using graph = vector<vector<T>>;
const ll LLMAX = 9223372*1e10;
const int IMAX = 214*1e7;
/*--------考察--------------------
----------CODING----------------*/
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m; cin >> n >> m;
    vector<int> w(n), c(m);
    rep(i,n) cin >> w[i];
    rep(i,m) cin >> c[i];
    graph<bool> dp(m+1,vector<bool>((1LL<<n),false));
    vector<ll> mw(1LL<<n,0);
    for(int i = 1; i < (1LL<<n); i++){
        rep(j,n) if(i & (1LL<<j)) mw[i] += w[j];
    }
    dp[0][0] = true;
    ll full = (1LL<<n)-1;
    rep(i,m){
        for(ll mask = 0; mask < (1LL<<n); mask++){
            if(!dp[i][mask]) continue;
            dp[i+1][mask] = true;
            ll rem = full ^ mask;
            ll sub = rem;
            while(sub > 0){
                if(mw[sub] <= c[i]) dp[i+1][mask | sub] = true;
                sub = (sub-1) & rem;
            }
        }
    }
    cout << ((dp[m][full]) ? "Yes\n" : "No\n");
}

提出情報

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

ジャッジ結果

セット名 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 1 ms 3588 KiB
in02.txt AC 1 ms 3616 KiB
in03.txt AC 1 ms 3600 KiB
in04.txt AC 1 ms 3584 KiB
in05.txt AC 1 ms 3644 KiB
in06.txt AC 1 ms 3624 KiB
in07.txt AC 136 ms 3696 KiB
in08.txt AC 3 ms 3700 KiB
in09.txt AC 1 ms 3588 KiB
in10.txt AC 210 ms 3864 KiB
in11.txt AC 21 ms 3672 KiB
in12.txt AC 3 ms 3740 KiB
in13.txt AC 3 ms 3644 KiB
in14.txt AC 91 ms 3692 KiB
in15.txt AC 187 ms 3672 KiB
in16.txt AC 64 ms 3672 KiB
in17.txt AC 1 ms 3584 KiB
in18.txt AC 90 ms 3836 KiB
in19.txt AC 91 ms 3672 KiB
in20.txt AC 11 ms 3824 KiB
in21.txt AC 82 ms 3672 KiB
in22.txt AC 92 ms 3824 KiB
in23.txt AC 133 ms 3728 KiB
in24.txt AC 6 ms 3680 KiB
in25.txt AC 9 ms 3768 KiB
in26.txt AC 189 ms 3864 KiB
in27.txt AC 1 ms 3572 KiB
in28.txt AC 1 ms 3644 KiB
in29.txt AC 1 ms 3616 KiB
in30.txt AC 1 ms 3656 KiB
in31.txt AC 3 ms 3760 KiB
in32.txt AC 96 ms 3832 KiB
in33.txt AC 68 ms 3828 KiB
in34.txt AC 1 ms 3648 KiB
in35.txt AC 1 ms 3500 KiB
in36.txt AC 1 ms 3648 KiB
in37.txt AC 1 ms 3616 KiB
in38.txt AC 1 ms 3492 KiB
in39.txt AC 1 ms 3516 KiB
in40.txt AC 1 ms 3460 KiB
in41.txt AC 1 ms 3460 KiB
in42.txt AC 1 ms 3548 KiB
in43.txt AC 1 ms 3648 KiB
in44.txt AC 189 ms 3828 KiB
in45.txt AC 106 ms 3788 KiB
in46.txt AC 52 ms 3708 KiB
in47.txt AC 91 ms 3788 KiB
in48.txt AC 90 ms 3708 KiB
in49.txt AC 60 ms 3812 KiB
in50.txt AC 60 ms 3700 KiB
in51.txt AC 5 ms 3868 KiB
in52.txt AC 121 ms 3672 KiB
in53.txt AC 95 ms 3704 KiB
in54.txt AC 126 ms 3872 KiB
in55.txt AC 91 ms 3672 KiB
in56.txt AC 14 ms 3732 KiB
in57.txt AC 91 ms 3828 KiB
in58.txt AC 91 ms 3796 KiB
in59.txt AC 119 ms 3832 KiB
in60.txt AC 1 ms 3460 KiB
in61.txt AC 1 ms 3492 KiB
in62.txt AC 32 ms 3800 KiB
in63.txt AC 32 ms 3656 KiB
in64.txt AC 90 ms 3796 KiB
in65.txt AC 63 ms 3700 KiB
in66.txt AC 1 ms 3516 KiB
in67.txt AC 1 ms 3636 KiB
in68.txt AC 1 ms 3492 KiB
in69.txt AC 1 ms 3584 KiB
in70.txt AC 1 ms 3644 KiB
in71.txt AC 1 ms 3600 KiB
in72.txt AC 1 ms 3616 KiB
in73.txt AC 1 ms 3492 KiB
in74.txt AC 72 ms 3708 KiB
in75.txt AC 55 ms 3796 KiB
in76.txt AC 1 ms 3648 KiB
in77.txt AC 1 ms 3616 KiB
sample01.txt AC 1 ms 3648 KiB
sample02.txt AC 1 ms 3460 KiB
sample03.txt AC 1 ms 3516 KiB