結果

問題 No.50 おもちゃ箱
コンテスト
ユーザー akusyounin2412
提出日時 2019-03-25 19:16:05
言語 C++14
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 39 ms / 5,000 ms
コード長 2,641 bytes
コンパイル時間 1,474 ms
コンパイル使用メモリ 131,864 KB
実行使用メモリ 5,248 KB
最終ジャッジ日時 2024-10-09 02:47:53
合計ジャッジ時間 3,398 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample AC * 4
other AC * 38
権限があれば一括ダウンロードができます

ソースコード

diff # 

# include <iostream>
# include <algorithm>
#include <array>
# include <cassert>
#include <cctype>
#include <climits>
#include <numeric>
# include <vector>
# include <string>
# include <set>
# include <map>
# include <cmath>
# include <iomanip>
# include <functional>
# include <tuple>
# include <utility>
# include <stack>
# include <queue>
# include <list>
# include <bitset>
# include <complex>
# include <chrono>
# include <random>
# include <limits.h>
# include <unordered_map>
# include <unordered_set>
# include <deque>
# include <cstdio>
# include <cstring>
#include <stdio.h>
#include<time.h>
#include <stdlib.h>
#include <cstdint>
#include <cfenv>
#include<fstream>
//#include <bits/stdc++.h>
using namespace std;
using LL = long long;
using ULL = unsigned long long;
const long long MOD = 1000000000 + 7;//1000000000 + 7 998244353 924844033 1000000000 + 9;
constexpr long long INF = 1LL << 60;//numeric_limits<LL>::max();
const double PI = acos(-1);
#define fir first
#define sec second
#define thi third
#define debug(x) cerr<<#x<<": "<<x<<'\n'
typedef pair<LL, LL> Pll;
typedef pair<double, double> Dll;
typedef pair<LL, pair<LL, LL>> Ppll;
typedef pair<LL, pair<LL, bitset<100001>>> Pbll;
typedef pair<LL, pair<LL, vector<LL>>> Pvll;
typedef pair<LL, LL> Vec2;
struct Tll { LL first, second, third; };
struct Fll { LL first, second, third, fourth; };
typedef pair<LL, Tll> Ptll;
#define rep(i,rept) for(LL i=0;i<rept;i++)
#define Rrep(i,mf) for(LL i=mf-1;i>=0;i--)
void YN(bool f) {
	if (f)
		cout << "YES" << endl;
	else
		cout << "NO" << endl;
}
void yn(bool f) {
	if (f)
		cout << "Yes" << endl;
	else
		cout << "No" << endl;
}
struct Edge { LL to, cost; };
struct edge {
	LL from, to, cost;
};
vector<vector<Edge>>g;
vector<edge>ed;
vector<Pll>pv;
set<LL>st;
map<Pll, LL>ma;
int di[4][2] = { { 0,1 },{ 1,0 },{ 0,-1 },{ -1,0 } };
string str, ss;
bool f[200000];
LL n, m, s, t, h, w, k, q, p, ans, sum, cnt, a[20], b[20], dp[20][1 << 10];
int main() {
	cin >> n;
	rep(i, n) {
		cin >> a[i];
	}
	cin >> m;
	rep(i, m) {
		cin >> b[i];
	}
	sort(a, a + n, [](LL x, LL y) {return x > y; });
	sort(b, b + m, [](LL x, LL y) {return x > y; });
	dp[0][0] = 1;
	for (int i = 0; i < m; i++) {
		for (int mask = 0; mask < (1 << n); mask++) {
			for (int get = 0; get < (1 << n); get++) {
				if ((get&mask) != 0)continue;
				int sum = 0;
				rep(j, n)if (get&(1 << j))sum += a[j];
				if (sum <= b[i])
					dp[i + 1][mask | get] = (dp[i][mask] | dp[i + 1][mask | get]);
			}
			dp[i + 1][mask] |= dp[i][mask];
		}
	}
	rep(i, m+1) {
		if (dp[i][(1 << n) - 1]) {
			cout << i << endl;
			return 0;
		}
	}
	cout << -1 << endl;
	return 0;
}
0