結果
| 問題 | No.1531 く2 |
| ユーザー |
 PCTprobability
|
| 提出日時 | 2021-05-08 20:37:59 |
| 言語 | C++17(gcc12) (gcc 12.3.0 + boost 1.87.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 4,070 bytes |
| コンパイル時間 | 22,448 ms |
| コンパイル使用メモリ | 359,520 KB |
| 最終ジャッジ日時 | 2025-01-21 09:25:56 |
|
ジャッジサーバーID （参考情報） |
judge1 / judge1 |
（要ログイン）
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 1 WA * 2 RE * 1 |
| other | AC * 3 WA * 6 RE * 35 |
ソースコード
#pragma GCC target("avx2")#pragma GCC optimize("O3")#pragma GCC optimize("unroll-loops")#include <bits/stdc++.h>#include <unistd.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endifusing ll = long long;using ld = long double;using ull = long long;#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))#define rep(i,a,b) for(int i=(int)(a);i<(int)(b);i++)#define ALL(x) begin(x), end(x)#define all(s) (s).begin(),(s).end()//#define rep2(i, m, n) for (int i = (m); i < (n); ++i)//#define rep(i, n) rep2(i, 0, n)#define drep2(i, m, n) for (int i = (m)-1; i >= (n); --i)#define drep(i, n) drep2(i, n, 0)#define rever(vec) reverse(vec.begin(), vec.end())#define sor(vec) sort(vec.begin(), vec.end())#define fi first#define se second#define pb push_back#define P pair<ll,ll>#define REP(i, n) for (int i = 0; i < (n); ++i)#define in scanner.read_int()//const ll mod = 998244353;const ll mod = 1000000007;const ll inf = 4500000000000000000ll;static const long double pi = 3.141592653589793;template<class T>void vcin(vector<T> &n){for(int i=0;i<int(n.size());i++) cin>>n[i];}template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}void YesNo(bool a){if(a){cout<<"Yes"<<endl;}else{cout<<"No"<<endl;}}void YESNO(bool a){if(a){cout<<"YES"<<endl;}else{cout<<"NO"<<endl;}}template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0;}template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0;}template<class T> void ifmin(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}template<class T> void ifmax(T t,T u){if(t>u){cout<<-1<<endl;}else{cout<<t<<endl;}}template<typename T,typename ...Args>auto make_vector(T x,int arg,Args ...args){if constexpr(sizeof...(args)==0)return vector<T>(arg,x);else returnvector(arg,make_vector<T>(x,args...));}ll modPow(ll a, ll n, ll mod) { ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }const ll t0=1,t1=10,t2=100,t3=1000,t4=10000,t5=100000,t6=1000000,t7=10000000,t8=t7*10,t9=t8*10,t10=t9*10,t11=t10*10,t12=t11*10,t13=t12*10,t14=t13*10,t15=t14*10,t16=t15*10,t17=t16*10,t18=t17*10;class Scanner {vector<char> buffer;ssize_t n_written;ssize_t n_read;public:Scanner(): buffer(1024*1024) { do_read(); }int64_t read_int() {int64_t ret = 0, sgn = 1;int ch = current_char();while (isspace(ch)) { ch = next_char(); }if (ch == '-') { sgn = -1; ch = next_char(); }for (; isdigit(ch); ch = next_char())ret = (ret * 10) + (ch - '0');return sgn * ret;}private:void do_read() {ssize_t r = read(0, &buffer[0], buffer.size());if (r < 0) {throw runtime_error(strerror(errno));}n_written = r;n_read = 0;}inline int next_char() {++n_read;if (n_read == n_written) { do_read(); }return current_char();}inline int current_char() {return (n_read == n_written) ? EOF : buffer[n_read];}};//Scanner scanner;//void vin(vector<ll> &n){for(int i=0;i<int(n.size());i++) n[i]=in;}void cincout(){ios::sync_with_stdio(false);std::cin.tie(nullptr);cout<< fixed << setprecision(20);}ll pop(ll a){ll ans=0;while(a>0){ans+=a%2;a/=2;}return ans;}int main() {cincout();ll n,k;cin>>n>>k;assert(0<=n&&n<=30&&0<=k&&k<=30);vector<vector<ll>> t(100,vector<ll>(100));for(int i=0;i<=n;i++){if(((i)&(n))==i){t[50+2*i][50]=1;}}for(int i=0;i<k;i++){vector<vector<ll>> t2(100,vector<ll>(100));for(int j=1;j<99;j++){for(int h=1;h<99;h++){t2[j][h]=t[j][h+1]+t[j-1][h-1]+t[j+1][h-1];}}t=t2;}ll ans=0;for(int i=0;i<100;i++){for(int j=0;j<100;j++){ans+=t[i][j]%2;if(t[i][j]%2){// cout<<i<<" "<<j<<endl;}}}cout<<ans<<endl;}