結果

問題 No.1655 123 Swaps
ユーザー PCTprobabilityPCTprobability
提出日時 2021-08-21 00:07:58
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 467 ms / 2,000 ms
コード長 7,088 bytes
コンパイル時間 7,703 ms
コンパイル使用メモリ 326,868 KB
実行使用メモリ 46,576 KB
最終ジャッジ日時 2024-04-27 03:57:22
合計ジャッジ時間 15,577 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
26,956 KB
testcase_01 AC 25 ms
26,884 KB
testcase_02 AC 26 ms
26,948 KB
testcase_03 AC 26 ms
26,992 KB
testcase_04 AC 26 ms
27,076 KB
testcase_05 AC 25 ms
26,916 KB
testcase_06 AC 26 ms
26,920 KB
testcase_07 AC 26 ms
27,008 KB
testcase_08 AC 25 ms
26,904 KB
testcase_09 AC 26 ms
26,888 KB
testcase_10 AC 26 ms
26,956 KB
testcase_11 AC 25 ms
27,064 KB
testcase_12 AC 26 ms
27,040 KB
testcase_13 AC 26 ms
26,864 KB
testcase_14 AC 25 ms
26,956 KB
testcase_15 AC 452 ms
45,968 KB
testcase_16 AC 455 ms
45,788 KB
testcase_17 AC 452 ms
45,716 KB
testcase_18 AC 467 ms
46,192 KB
testcase_19 AC 453 ms
46,344 KB
testcase_20 AC 464 ms
46,204 KB
testcase_21 AC 456 ms
46,352 KB
testcase_22 AC 458 ms
46,432 KB
testcase_23 AC 453 ms
46,576 KB
testcase_24 AC 460 ms
46,452 KB
testcase_25 AC 459 ms
46,448 KB
testcase_26 AC 232 ms
38,112 KB
testcase_27 AC 237 ms
36,020 KB
testcase_28 AC 442 ms
43,716 KB
testcase_29 AC 426 ms
42,576 KB
testcase_30 AC 235 ms
36,004 KB
testcase_31 AC 238 ms
36,628 KB
testcase_32 AC 27 ms
26,872 KB
testcase_33 AC 24 ms
26,864 KB
testcase_34 AC 24 ms
26,940 KB
testcase_35 AC 65 ms
34,500 KB
testcase_36 AC 26 ms
27,040 KB
testcase_37 AC 70 ms
36,036 KB
testcase_38 AC 82 ms
34,628 KB
testcase_39 AC 452 ms
45,988 KB
testcase_40 AC 72 ms
35,656 KB
testcase_41 AC 27 ms
26,904 KB
testcase_42 AC 26 ms
26,900 KB
testcase_43 AC 26 ms
26,904 KB
testcase_44 AC 25 ms
26,892 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("Ofast")
#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 = unsigned long long;
#define endl "\n"
typedef pair<int, int> Pii;
#define REP3(i, m, n) for (int i = (m); (i) < int(n); ++ (i))
#define FOR(i,a,b) for(ll i=a;i<=(ll)(b);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 PB push_back 
#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 FOR(i,a,b) for(ll i=a;i<=(ll)(b);i++)
#define fi first
#define se second
#define pb push_back
#define P pair<ll,ll>
#define NP next_permutation
//const ll mod = 1000000009;
//const ll mod = 998244353;
const ll mod=924844033;
const ll inf = 9100000000000000000ll;
const ld eps = ld(0.00000000001);
//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,class K>void vcin(vector<T> &n,vector<K> &m){for(int i=0;i<int(n.size());i++) cin>>n[i]>>m[i];}
template<class T>void vcout(vector<T> &n){for(int i=0;i<int(n.size());i++){cout<<n[i]<<" ";}cout<<endl;}
template<class T>void vcin(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cin>>n[i][j];}}}
template<class T>void vcout(vector<vector<T>> &n){for(int i=0;i<int(n.size());i++){for(int j=0;j<int(n[i].size());j++){cout<<n[i][j]<<" ";}cout<<endl;}cout<<endl;}
void yes(bool a){cout<<(a?"yes":"no")<<endl;}
void YES(bool a){cout<<(a?"YES":"NO")<<endl;}
void Yes(bool a){cout<<(a?"Yes":"No")<<endl;}
void possible(bool a){ cout<<(a?"possible":"impossible")<<endl; }
void Possible(bool a){ cout<<(a?"Possible":"Impossible")<<endl; }
void POSSIBLE(bool a){ cout<<(a?"POSSIBLE":"IMPOSSIBLE")<<endl; }
template<class T>auto min(const T& a){ return *min_element(all(a)); }
template<class T>auto max(const T& a){ return *max_element(all(a)); }
template<class T,class F>void print(pair<T,F> a){cout<<a.fi<<" "<<a.se<<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 return vector(arg,make_vector<T>(x,args...));}
ll fastgcd(ll u,ll v){ll shl=0;while(u&&v&&u!=v){bool eu=!(u&1);bool ev=!(v&1);if(eu&&ev){++shl;u>>=1;v>>=1;}else if(eu&&!ev){u>>=1;}else if(!eu&&ev){v>>=1;}else if(u>=v){u=(u-v)>>1;}else{ll tmp=u;u=(v-u)>>1;v=tmp;}}return !u?v<<shl:u<<shl;}
ll modPow(ll a, ll n, ll mod) { if(mod==1) return 0;ll ret = 1; ll p = a % mod; while (n) { if (n & 1) ret = ret * p % mod; p = p * p % mod; n >>= 1; } return ret; }
vector<ll> divisor(ll x){ vector<ll> ans; for(ll i = 1; i * i <= x; i++){ if(x % i == 0) {ans.push_back(i); if(i*i!=x){ ans.push_back(x / ans[i]);}}}sor(ans); return ans; }
ll pop(ll x){return __builtin_popcountll(x);}
ll poplong(ll x){ll y=-1;while(x){x/=2;y++;}return y;}
template<class T>
struct Sum{
  vector<T> data;
  Sum(const vector<T>& v):data(v.size()+1){
    for(ll i=0;i<v.size();i++) data[i+1]=data[i]+v[i];
  }
  T get(ll l,ll r) const {
    return data[r]-data[l];
  }
};
template<class T>
struct Sum2{
  vector<vector<T>> data;
  Sum2(const vector<vector<T>> &v):data(v.size()+1,vector<T>(v[0].size()+1)){
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]=data[i][j+1]+v[i][j];
    for(int i=0;i<v.size();i++) for(int j=0;j<v[i].size();j++) data[i+1][j+1]+=data[i+1][j];
  }
  T get(ll x1,ll y1,ll x2,ll y2) const {
    return data[x2][y2]+data[x1][y1]-data[x1][y2]-data[x2][y1];
  }
};

void cincout(){
  ios::sync_with_stdio(false);
    std::cin.tie(nullptr);
  cout<< fixed << setprecision(10);
}
constexpr ll MAX = 1000000;
ll fac[MAX],finv[MAX],inv[MAX];
void COMinit(){
  fac[0]=fac[1]=1;
  finv[0]=finv[1]=1;
  inv[1]=1;
  for(int i=2;i<MAX;i++){
    fac[i]=fac[i-1]*i%mod;
    inv[i]=mod-inv[mod%i]*(mod/i)%mod;
    finv[i]=finv[i-1]*inv[i]%mod;
  }
}
ll binom(ll n,ll k){
  if(n<k) return 0;
  if(n<0||k<0) return 0;
  return fac[n]*(finv[k]*finv[n-k]%mod)%mod;
}
ll HOM(ll n,ll k){
  if(n+k-1>=n-1&&n-1>=0){
  return binom(n+k-1,n-1);
  }
  else{
    return 0;
  }
}
using mint = modint;
template<class T>
vector<T> NTT(vector<T> a,vector<T> b){
  ll nmod=T::mod();
  int n=a.size();
  int m=b.size();
  vector<int> x1(n);
  vector<int> y1(m);
  for(int i=0;i<n;i++){
    ll tmp1,tmp2,tmp3;
    tmp1=a[i].val();
    x1[i]=tmp1;
  }
  for(int i=0;i<m;i++){
    ll tmp1,tmp2,tmp3;
    tmp1=b[i].val();
    y1[i]=tmp1;
  }
  auto z1=convolution<167772161>(x1,y1);
  auto z2=convolution<469762049>(x1,y1);
  auto z3=convolution<1224736769>(x1,y1);
  vector<T> res(n+m-1);
  ll m1=167772161;
  ll m2=469762049;
  ll m3=1224736769;
  ll m1m2=104391568;
  ll m1m2m3=721017874;
  ll mm12=m1*m2%nmod;
  for(int i=0;i<n+m-1;i++){
    int v1=(z2[i]-z1[i])*m1m2%m2;
    if(v1<0) v1+=m2;
    int v2=(z3[i]-(z1[i]+v1*m1)%m3)*m1m2m3%m3;
    if(v2<0) v2+=m3;
    res[i]=(z1[i]+v1*m1+v2*mm12);
  }
  return res;
}
int main() {
  cincout();
  COMinit();
  mint::set_mod(mod);
  ll a,b,c;
  cin>>a>>b>>c;
  if((a+b+c)%2){
    cout<<0<<endl;
    return 0;
  }
  ll n=a+b+c;
  mint ans=0;
  ll plus=(n+1)/2,minus=n/2;
  vector<ll> X(c+1),Y(2*a+1);
  ll m=minus-plus+2*c-2*a;
  m%=6;
  m+=6;
  m%=6;
  if(m%2){
    cout<<0<<endl;
    return 0;
  }
  m/=2;
  for(int i=0;i<3;i++){
    for(int j=0;j<3;j++){
      if((2*i+j)%3!=m) continue;
      vector<mint> X(c+1),Y(a+1);
      for(int k=0;k<=c;k++){
        if(k%3!=i) continue;
        if(plus-k<0) continue;
        if(minus-c+k<0) continue;
        X[k]=mint(binom(plus,k))*mint(binom(minus,c-k))*mint(fac[plus-k])*mint(fac[minus-c+k]);
      }
      for(int k=0;k<=a;k++){
        if(k%3!=j) continue;
        Y[k]=finv[k]*finv[a-k];
      }
     /* for(auto e:X) cout<<e.val()<<" ";
      cout<<endl;
      for(auto e:Y) cout<<e.val()<<" ";
      cout<<endl;*/
      X=NTT(X,Y);
     /* for(auto e:X) cout<<e.val()<<" ";
      cout<<endl;*/
      for(int k=0;k<X.size();k++){
        if(plus-k<0){
          X[k]=0;
          continue;
        }
        X[k]*=finv[plus-k];
      }
      for(int k=0;k<X.size();k++){
        if(minus-c-a+k<0){
          X[k]=0;
          continue;
        }
        X[k]*=finv[minus-c-a+k];
      }
      for(int k=0;k<X.size();k++) ans+=X[k];
    }
  }
  cout<<ans.val()<<endl;
}
0