結果
問題 | No.1533 Don't be Negative! |
ユーザー | PCTprobability |
提出日時 | 2021-04-30 01:26:11 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
WA
(最新)
AC
(最初)
|
実行時間 | - |
コード長 | 4,305 bytes |
コンパイル時間 | 7,139 ms |
コンパイル使用メモリ | 318,736 KB |
実行使用メモリ | 37,980 KB |
最終ジャッジ日時 | 2024-11-15 01:04:02 |
合計ジャッジ時間 | 43,340 ms |
ジャッジサーバーID (参考情報) |
judge5 / judge2 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | WA | - |
testcase_01 | WA | - |
testcase_02 | WA | - |
testcase_03 | WA | - |
testcase_04 | WA | - |
testcase_05 | WA | - |
testcase_06 | WA | - |
testcase_07 | WA | - |
testcase_08 | WA | - |
testcase_09 | WA | - |
testcase_10 | WA | - |
testcase_11 | WA | - |
testcase_12 | WA | - |
testcase_13 | WA | - |
testcase_14 | WA | - |
testcase_15 | WA | - |
testcase_16 | WA | - |
testcase_17 | WA | - |
testcase_18 | WA | - |
testcase_19 | WA | - |
testcase_20 | RE | - |
testcase_21 | WA | - |
testcase_22 | RE | - |
testcase_23 | RE | - |
testcase_24 | WA | - |
testcase_25 | WA | - |
testcase_26 | WA | - |
testcase_27 | WA | - |
testcase_28 | WA | - |
testcase_29 | WA | - |
testcase_30 | WA | - |
testcase_31 | WA | - |
testcase_32 | WA | - |
testcase_33 | WA | - |
testcase_34 | WA | - |
testcase_35 | RE | - |
testcase_36 | WA | - |
testcase_37 | WA | - |
testcase_38 | WA | - |
testcase_39 | WA | - |
testcase_40 | WA | - |
testcase_41 | WA | - |
testcase_42 | WA | - |
testcase_43 | WA | - |
testcase_44 | WA | - |
testcase_45 | WA | - |
testcase_46 | WA | - |
testcase_47 | WA | - |
testcase_48 | WA | - |
testcase_49 | WA | - |
testcase_50 | WA | - |
testcase_51 | WA | - |
testcase_52 | WA | - |
testcase_53 | WA | - |
testcase_54 | WA | - |
testcase_55 | WA | - |
testcase_56 | WA | - |
ソースコード
#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; #endif using 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 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 pll 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 = 2000000000000000000ll; 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,class U> void chmax(T& t,const U& u){if(t<u) t=u;} template<class T,class U> void chmin(T& t,const U& u){if(t>u) t=u;} 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 return vector(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; void gbjsmzmfuuvdf(){ ios::sync_with_stdio(false); std::cin.tie(nullptr); cout<< fixed << setprecision(20); } 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;} using mint = modint998244353; int main() { gbjsmzmfuuvdf(); ll n,m; cin>>n>>m; n++; vector<vector<mint>> dp(601); dp[0]={1}; for(int i=1;i<=600;i++){ dp[i].resize(2*m*i+1); for(int j=0;j<dp[i-1].size();j++){ for(int k=0;k<=2*m;k++){ dp[i][j+k]+=dp[i-1][j]; } } } vector<mint> q; for(auto e:dp[600]){ q.pb(e); } vector<vector<mint>> f(60); vector<mint> p={1}; f[0]=p; for(int i=0;i<=52;i++){ p=convolution(p,q); f[i+1]=p; } vector<mint> ans(30003); for(int i=0;i<30003;i++){ ll u=i%600; ll t=i/600; if(t==0){ ans[i]=dp[i][m*i]; } else{ ll s=f[t].size(); for(int j=u*m;j<dp[u].size();j++){ ans[i]+=dp[u][j]*f[t][s/2+j-u*m]; } for(int j=u*m-1;j>=0;j--){ ans[i]+=dp[u][j]*f[t][s/2-u*m+j]; } } } mint answer=0; for(int i=1;i<n;i++){ answer+=(mint(2*m+1).pow(i)-ans[i])/mint(2)*mint(n-i)*mint(2*m+1).pow(n-i-1); } cout<<answer.val()<<endl; }