Submission #1690986
Source Code Expand
#pragma GCC optimize ("O3")
#pragma GCC target ("avx")
#include "bits/stdc++.h" // define macro "/D__MAI"
using namespace std;
typedef long long int ll;
#define xprintf(fmt,...) fprintf(stderr,fmt,__VA_ARGS__)
#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}
#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}
#define ALL(v) (v).begin(),(v).end()
#define repeat(cnt,l) for(auto cnt=0ll;(cnt)<(l);++(cnt))
#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))
#define MD 1000000007ll
#define PI 3.1415926535897932384626433832795
#define EPS 1e-12
template<typename T1, typename T2> ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << "(" << p.first << ":" << p.second << ")"; return o; }
template<typename iterator> inline size_t argmin(iterator begin, iterator end) { return distance(begin, min_element(begin, end)); }
template<typename iterator> inline size_t argmax(iterator begin, iterator end) { return distance(begin, max_element(begin, end)); }
template<typename T> T& maxset(T& to, const T& val) { return to = max(to, val); }
template<typename T> T& minset(T& to, const T& val) { return to = min(to, val); }
mt19937_64 randdev(8901016);
inline ll rand_range(ll l, ll h) {
return uniform_int_distribution<ll>(l, h)(randdev);
}
#ifdef __MAI
#define getchar_unlocked getchar
#define putchar_unlocked putchar
#endif
#ifdef __VSCC
#define getchar_unlocked _getchar_nolock
#define putchar_unlocked _putchar_nolock
#endif
namespace {
#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)
class MaiScanner {
public:
template<typename T> void input_integer(T& var) {
var = 0;
T sign = 1;
int cc = getchar_unlocked();
for (; cc<'0' || '9'<cc; cc = getchar_unlocked())
if (cc == '-') sign = -1;
for (; '0' <= cc&&cc <= '9'; cc = getchar_unlocked())
var = (var << 3) + (var << 1) + cc - '0';
var = var*sign;
}
inline int c() { return getchar_unlocked(); }
inline MaiScanner& operator>>(int& var) {
input_integer<int>(var);
return *this;
}
inline MaiScanner& operator>>(long long& var) {
input_integer<long long>(var);
return *this;
}
inline MaiScanner& operator>>(string& var) {
int cc = getchar_unlocked();
for (; !isvisiblechar(cc); cc = getchar_unlocked());
for (; isvisiblechar(cc); cc = getchar_unlocked())
var.push_back(cc);
return *this;
}
template<typename IT> void in(IT begin, IT end) {
for (auto it = begin; it != end; ++it) *this >> *it;
}
};
}
MaiScanner scanner;
ll m, n, kei;
ll ww[50];
void guchoku() {
ll cnt = 0;
repeat(b, 1 << n) {
bitset<20> bit = b;
ll w = 0;
repeat(i, n) {
if (bit[i])
w += ww[i];
}
cnt += (w == kei);
}
cout << cnt << endl;
}
void hanbun() {
ll cnt = 0;
map<ll, ll> left;
{
repeat(b, 1 << 16) {
bitset<20> bit = b;
ll w = 0;
repeat(i, 16) {
if (bit[i])
w += ww[i];
}
if (w <= kei)
left[w] ++;
}
}
{
ll m = n - 16;
repeat(b, 1 << m) {
bitset<20> bit = b;
ll w = 0;
repeat(i, m) {
if (bit[i])
w += ww[16+i];
}
if (w <= kei && left.count(kei - w))
cnt += left[kei - w];
}
}
cout << cnt << endl;
}
int main() {
scanner >> n >> kei;
scanner.in(ww, ww + n);
if (n < 18) {
guchoku();
}
else {
hanbun();
}
return 0;
}
Submission Info
Submission Time |
|
Task |
C - 無駄なものが嫌いな人 |
User |
m_buyoh |
Language |
C++14 (GCC 5.4.1) |
Score |
100 |
Code Size |
4200 Byte |
Status |
AC |
Exec Time |
39 ms |
Memory |
4352 KB |
Judge Result
Set Name |
All |
Score / Max Score |
100 / 100 |
Status |
|
Set Name |
Test Cases |
All |
max_1.txt, max_2.txt, max_3.txt, max_4.txt, pair_1.txt, pair_2.txt, power2_1.txt, power2_2.txt, power2_3.txt, power2_4.txt, power2_5.txt, random_1.txt, random_2.txt, random_3.txt, random_4.txt, random_5.txt, random_6.txt, random_7.txt, random_8.txt, random_9.txt, sample_1.txt, sample_2.txt, sample_3.txt, sample_4.txt, small_1.txt, small_2.txt, small_3.txt, small_4.txt |
Case Name |
Status |
Exec Time |
Memory |
max_1.txt |
AC |
8 ms |
256 KB |
max_2.txt |
AC |
11 ms |
256 KB |
max_3.txt |
AC |
8 ms |
256 KB |
max_4.txt |
AC |
10 ms |
256 KB |
pair_1.txt |
AC |
25 ms |
1792 KB |
pair_2.txt |
AC |
14 ms |
256 KB |
power2_1.txt |
AC |
10 ms |
640 KB |
power2_2.txt |
AC |
11 ms |
384 KB |
power2_3.txt |
AC |
11 ms |
256 KB |
power2_4.txt |
AC |
10 ms |
256 KB |
power2_5.txt |
AC |
18 ms |
4352 KB |
random_1.txt |
AC |
29 ms |
4352 KB |
random_2.txt |
AC |
33 ms |
4352 KB |
random_3.txt |
AC |
7 ms |
512 KB |
random_4.txt |
AC |
39 ms |
4352 KB |
random_5.txt |
AC |
10 ms |
256 KB |
random_6.txt |
AC |
10 ms |
256 KB |
random_7.txt |
AC |
16 ms |
384 KB |
random_8.txt |
AC |
21 ms |
1408 KB |
random_9.txt |
AC |
16 ms |
2944 KB |
sample_1.txt |
AC |
1 ms |
256 KB |
sample_2.txt |
AC |
1 ms |
256 KB |
sample_3.txt |
AC |
3 ms |
384 KB |
sample_4.txt |
AC |
5 ms |
256 KB |
small_1.txt |
AC |
1 ms |
256 KB |
small_2.txt |
AC |
1 ms |
256 KB |
small_3.txt |
AC |
1 ms |
256 KB |
small_4.txt |
AC |
1 ms |
256 KB |