結果

問題 No.1533 Don't be Negative!
ユーザー 👑 PCTprobabilityPCTprobability
提出日時 2021-05-23 01:48:45
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 1,151 ms / 8,000 ms
コード長 4,382 bytes
コンパイル時間 5,964 ms
コンパイル使用メモリ 320,376 KB
実行使用メモリ 57,404 KB
最終ジャッジ日時 2024-04-27 03:51:37
合計ジャッジ時間 53,495 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge2
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 259 ms
16,644 KB
testcase_01 AC 790 ms
41,932 KB
testcase_02 AC 1,133 ms
57,216 KB
testcase_03 AC 1,118 ms
56,964 KB
testcase_04 AC 541 ms
30,212 KB
testcase_05 AC 763 ms
41,928 KB
testcase_06 AC 763 ms
42,060 KB
testcase_07 AC 535 ms
30,208 KB
testcase_08 AC 531 ms
30,080 KB
testcase_09 AC 1,116 ms
56,968 KB
testcase_10 AC 899 ms
42,056 KB
testcase_11 AC 1,139 ms
57,092 KB
testcase_12 AC 540 ms
30,216 KB
testcase_13 AC 262 ms
16,644 KB
testcase_14 AC 268 ms
16,644 KB
testcase_15 AC 541 ms
30,208 KB
testcase_16 AC 770 ms
42,056 KB
testcase_17 AC 260 ms
16,772 KB
testcase_18 AC 773 ms
42,056 KB
testcase_19 AC 772 ms
41,928 KB
testcase_20 AC 542 ms
30,212 KB
testcase_21 AC 770 ms
41,928 KB
testcase_22 AC 546 ms
30,084 KB
testcase_23 AC 267 ms
16,776 KB
testcase_24 AC 540 ms
30,216 KB
testcase_25 AC 1,127 ms
57,216 KB
testcase_26 AC 1,120 ms
57,220 KB
testcase_27 AC 545 ms
30,212 KB
testcase_28 AC 775 ms
42,056 KB
testcase_29 AC 773 ms
41,928 KB
testcase_30 AC 1,124 ms
57,096 KB
testcase_31 AC 763 ms
42,056 KB
testcase_32 AC 776 ms
42,056 KB
testcase_33 AC 1,134 ms
56,964 KB
testcase_34 AC 538 ms
30,208 KB
testcase_35 AC 270 ms
16,768 KB
testcase_36 AC 1,135 ms
57,100 KB
testcase_37 AC 1,142 ms
57,404 KB
testcase_38 AC 1,135 ms
57,220 KB
testcase_39 AC 789 ms
42,052 KB
testcase_40 AC 772 ms
42,056 KB
testcase_41 AC 771 ms
42,056 KB
testcase_42 AC 1,123 ms
57,088 KB
testcase_43 AC 774 ms
41,908 KB
testcase_44 AC 770 ms
42,060 KB
testcase_45 AC 778 ms
42,056 KB
testcase_46 AC 782 ms
41,932 KB
testcase_47 AC 1,137 ms
57,216 KB
testcase_48 AC 771 ms
42,056 KB
testcase_49 AC 776 ms
42,180 KB
testcase_50 AC 1,151 ms
56,964 KB
testcase_51 AC 1,128 ms
57,220 KB
testcase_52 AC 1,132 ms
57,088 KB
testcase_53 AC 1,132 ms
57,096 KB
testcase_54 AC 1,130 ms
57,088 KB
testcase_55 AC 1,137 ms
57,092 KB
testcase_56 AC 1,129 ms
56,964 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#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,x;
  cin>>n>>m>>x;
  n++;
  vector<vector<mint>> dp(651);
  dp[0]={1};
  for(int i=1;i<=650;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++){
        if(abs(k-m)==x) continue;
        dp[i][j+k]+=dp[i-1][j];
      }
    }
  }
  vector<mint> q;
  for(auto e:dp[650]){
    q.pb(e);
  }
  vector<vector<mint>> f(65);
  vector<mint> p={1};
  f[0]=p;
  for(int i=0;i<=63;i++){
    p=convolution(p,q);
    f[i+1]=p;
  }
  vector<mint> ans(40003);
  for(int i=0;i<40003;i++){
    ll u=i%650;
    ll t=i/650;
    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;
  ll tmp=2;
  if(x==0) tmp=1;
  for(int i=1;i<n;i++){
    answer+=(mint(2*m+1-tmp).pow(i)-ans[i])/mint(2)*mint(n-i)*mint(2*m+1-tmp).pow(n-i-1);
  }
  cout<<answer.val()<<endl;
}
0