結果
問題 | No.1701 half price |
ユーザー |
|
提出日時 | 2021-10-11 05:35:45 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 6 ms / 3,000 ms |
コード長 | 2,842 bytes |
コンパイル時間 | 2,361 ms |
コンパイル使用メモリ | 182,032 KB |
実行使用メモリ | 6,944 KB |
最終ジャッジ日時 | 2024-09-15 02:19:11 |
合計ジャッジ時間 | 3,076 ms |
ジャッジサーバーID (参考情報) |
judge6 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 2 |
other | AC * 20 |
ソースコード
#pragma GCC optimize ("Ofast")#include<bits/stdc++.h>using namespace std;inline int my_getchar(){static char buf[1048576];static int s = 1048576;static int e = 1048576;if(s == e && e == 1048576){e = fread(buf, 1, 1048576, stdin);s = 0;}if(s == e){return EOF;}return buf[s++];}inline void rd(int &x){int k;int m=0;x=0;for(;;){k = my_getchar();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = my_getchar();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}inline void rd(long long &x){int k;int m=0;x=0;for(;;){k = my_getchar();if(k=='-'){m=1;break;}if('0'<=k&&k<='9'){x=k-'0';break;}}for(;;){k = my_getchar();if(k<'0'||k>'9'){break;}x=x*10+k-'0';}if(m){x=-x;}}struct MY_WRITER{char buf[1048576];int s;int e;MY_WRITER(){s = 0;e = 1048576;}~MY_WRITER(){if(s){fwrite(buf, 1, s, stdout);}}};MY_WRITER MY_WRITER_VAR;void my_putchar(int a){if(MY_WRITER_VAR.s == MY_WRITER_VAR.e){fwrite(MY_WRITER_VAR.buf, 1, MY_WRITER_VAR.s, stdout);MY_WRITER_VAR.s = 0;}MY_WRITER_VAR.buf[MY_WRITER_VAR.s++] = a;}inline void wt_L(char a){my_putchar(a);}inline void wt_L(long long x){int s=0;int m=0;char f[20];if(x<0){m=1;x=-x;}while(x){f[s++]=x%10;x/=10;}if(!s){f[s++]=0;}if(m){my_putchar('-');}while(s--){my_putchar(f[s]+'0');}}int N;long long W;long long a[13+10];int f[1<<16];void dfs(int x, long long S, long long sx){if(x == N){if(sx == W){f[S] = 1;}return;}dfs(x+1, S , sx);dfs(x+1, S + (1<<x) , sx+ a[x]/2);dfs(x+1, S + (1<<x) , sx + a[x]);}int main(){rd(N);rd(W);{int PiIOrLma;for(PiIOrLma=(0);PiIOrLma<(N);PiIOrLma++){rd(a[PiIOrLma]);}}dfs(0, 0, 0);int* xx = &f[1];int GIHf_YD2;int djQeACzd;if(1<<N==0){djQeACzd = 0;}else{djQeACzd = xx[0];for(GIHf_YD2=(1);GIHf_YD2<(1<<N);GIHf_YD2++){djQeACzd += xx[GIHf_YD2];}}long long u = djQeACzd;wt_L(u);wt_L('\n');return 0;}// cLay version 20210405-1// --- original code ---// //no-unlocked// int N;// ll W;// ll a[13+10];// int f[1<<16];// void dfs(int x, ll S, ll sx){// if(x == N){// if(sx == W){// f[S] = 1;// }// return;// }// dfs(x+1, S , sx);// dfs(x+1, S + (1<<x) , sx+ a[x]/2);// dfs(x+1, S + (1<<x) , sx + a[x]);// }//// {// rd(N, W, a(N));// dfs(0, 0, 0);// int * xx = &f[1];// ll u = sum(xx(1<<N));// wt(u);// }