結果
問題 | No.1701 half price |
ユーザー |
![]() |
提出日時 | 2021-10-08 22:05:18 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 13 ms / 3,000 ms |
コード長 | 2,026 bytes |
コンパイル時間 | 1,898 ms |
コンパイル使用メモリ | 190,744 KB |
最終ジャッジ日時 | 2025-01-24 22:10:47 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
コンパイルメッセージ
main.cpp: In function ‘int main()’: main.cpp:98:10: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 98 | scanf("%d%d", &n, &w); | ~~~~~^~~~~~~~~~~~~~~~ main.cpp:99:20: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 99 | rep(i, n) scanf("%lld", &a[i]); | ~~~~~^~~~~~~~~~~~~~~
ソースコード
#include <bits/stdc++.h>#include <algorithm>#include <cassert>#include <vector>template <class T>bool chmax(T &a, const T &b) {if (a < b) {a = b;return true;}return false;}template <class T>bool chmin(T &a, const T &b) {if (a > b) {a = b;return true;}return false;}template <class T>T div_floor(T a, T b) {if (b < 0) a *= -1, b *= -1;return a >= 0 ? a / b : (a + 1) / b - 1;}template <class T>T div_ceil(T a, T b) {if (b < 0) a *= -1, b *= -1;return a > 0 ? (a - 1) / b + 1 : a / b;}template <typename T>struct CoordComp {std::vector<T> v;bool sorted;CoordComp() : sorted(false) {}int size() { return v.size(); }void add(T x) { v.push_back(x); }void build() {std::sort(v.begin(), v.end());v.erase(std::unique(v.begin(), v.end()), v.end());sorted = true;}int get_idx(T x) {assert(sorted);return lower_bound(v.begin(), v.end(), x) - v.begin();}T &operator[](int i) { return v[i]; }};#define For(i, a, b) for (int i = (int)(a); (i) < (int)(b); ++(i))#define rFor(i, a, b) for (int i = (int)(a)-1; (i) >= (int)(b); --(i))#define rep(i, n) For(i, 0, n)#define rrep(i, n) rFor(i, n, 0)#define fi first#define se secondusing namespace std;using lint = long long;using pii = pair<int, int>;using pll = pair<lint, lint>;int n, w, ans[1 << 15];bool used[15];lint a[15];void dfs(int cur, lint sum) {if (cur == n) {if (sum != w) return;int S = 0;rep(i, n) if (used[i]) S += (1 << i);ans[S] = 1;return;}dfs(cur + 1, sum);used[cur] = true;dfs(cur + 1, sum + a[cur]);dfs(cur + 1, sum + a[cur] / 2);used[cur] = false;}int main() {scanf("%d%d", &n, &w);rep(i, n) scanf("%lld", &a[i]);dfs(0, 0);int tmp = 0;rep(i, 1 << n) if (ans[i])++ tmp;printf("%d\n", accumulate(ans + 1, ans + (1 << n), 0));}