Submission #19019917

---

Source Code Expand

#include <bits/stdc++.h>
using namespace std;
typedef signed long long ll;

#define _P(...) (void)printf(__VA_ARGS__)
#define FOR(x,to) for(x=0;x<(to);x++)
#define FORR(x,arr) for(auto& x:arr)
#define FORR2(x,y,arr) for(auto& [x,y]:arr)
#define ALL(a) (a.begin()),(a.end())
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,0xff,sizeof(a))
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(a>b){a=b;return 1;}return 0;}
//-------------------------------------------------------

int A,B,C,D;
const ll mo=998244353;

ll comb(ll N_, ll C_) {
	const int NUM_=1400001;
	static ll fact[NUM_+1],factr[NUM_+1],inv[NUM_+1];
	if (fact[0]==0) {
		inv[1]=fact[0]=factr[0]=1;
		for (int i=2;i<=NUM_;++i) inv[i] = inv[mo % i] * (mo - mo / i) % mo;
		for (int i=1;i<=NUM_;++i) fact[i]=fact[i-1]*i%mo, factr[i]=factr[i-1]*inv[i]%mo;
	}
	if(C_<0 || C_>N_) return 0;
	return factr[C_]*fact[N_]%mo*factr[N_-C_]%mo;
}
ll hcomb(int P_,int Q_) { return (P_==0&&Q_==0)?1:comb(P_+Q_-1,Q_);}

ll modpow(ll a, ll n = mo-2) {
	ll r=1;a%=mo;
	while(n) r=r*((n%2)?a:1)%mo,a=a*a%mo,n>>=1;
	return r;
}
ll rr;

ll dp[4][11][11][11][11];

ll go(int cur,int A,int B,int C,int D) {
	if(A+B+C+D==0) {
		return cur==0;
	}
	if(dp[cur][A][B][C][D]>=0) return dp[cur][A][B][C][D];
	ll ret=0;
	if(cur==0) {
		if(D) ret+=go(3,A,B,C,D-1);
		if(A) ret+=go(1,A-1,B,C,D);
	}
	if(cur==1) {
		if(A) ret+=go(0,A-1,B,C,D);
		if(B) ret+=go(2,A,B-1,C,D);
	}
	if(cur==2) {
		if(B) ret+=go(1,A,B-1,C,D);
		if(C) ret+=go(3,A,B,C-1,D);
	}
	if(cur==3) {
		if(C) ret+=go(2,A,B,C-1,D);
		if(D) ret+=go(0,A,B,C,D-1);
	}
	return dp[cur][A][B][C][D]=ret%mo;
	
}

void solve() {
	int i,j,k,l,r,x,y; string s;
	
	cin>>A>>B>>C>>D;
	MINUS(dp);
	//cout<<go(0,A,B,C,D)<<endl;
	
	ll ret=0;
	for(int L=0;L<=500000;L++) {
		int X[4]={A-L,B-L,C-L,D-L};
		FOR(i,4) {
			if(X[i]<0) break;
			if(X[i]%2) break;
			X[i]/=2;
		}
		if(i<4) continue;
		ll pat=comb(L+X[0]+X[3],L)*comb(X[0]+X[3],X[3])%mo*modpow(2,L)%mo;
		
		/*
		//cout<<L<<" "<<pat<<"!"<<ret<<endl;
		// T->U
		for(x=0;x<=X[1];x++) {
			// V->U
			for(y=0;y<=X[2];y++) {
				ll pat2=hcomb(L+X[0],x)*hcomb(L+x,X[2]-y)%mo*hcomb(X[3],y)*hcomb(y,X[1]-x)%mo;
				//ret+=pat*pat2%mo;
			}
		}
		*/
		ll pat2=hcomb(2*L+X[0]+X[3],X[1]+X[2])%mo;
		ret+=pat*pat2%mo;
		
	}
	
	cout<<ret%mo<<endl;
}


int main(int argc,char** argv){
	string s;int i;
	if(argc==1) ios::sync_with_stdio(false), cin.tie(0);
	FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
	cout.tie(0); solve(); return 0;
}

Submission Info

Compile Error

./Main.cpp: In function ‘void solve()’:
./Main.cpp:68:8: warning: unused variable ‘j’ [-Wunused-variable]
   68 |  int i,j,k,l,r,x,y; string s;
      |        ^
./Main.cpp:68:10: warning: unused variable ‘k’ [-Wunused-variable]
   68 |  int i,j,k,l,r,x,y; string s;
      |          ^
./Main.cpp:68:12: warning: unused variable ‘l’ [-Wunused-variable]
   68 |  int i,j,k,l,r,x,y; string s;
      |            ^
./Main.cpp:68:14: warning: unused variable ‘r’ [-Wunused-variable]
   68 |  int i,j,k,l,r,x,y; string s;
      |              ^
./Main.cpp:68:16: warning: unused variable ‘x’ [-Wunused-variable]
   68 |  int i,j,k,l,r,x,y; string s;
      |                ^
./Main.cpp:68:18: warning: unused variable ‘y’ [-Wunused-variable]
   68 |  int i,j,k,l,r,x,y; string s;
      |                  ^
./Main.cpp: In function ‘int main(int, char**)’:
./Main.cpp:6:28: warning: comparison of integer expressions of different signedness: ‘int’ and ‘std::__cxx11::basic_string<char>::size_type’ {aka ‘long unsigned int’} [-Wsign-compare]
    6 | #define FOR(x,to) for(x=0;x<(to);x++)
      |                            ^
./Main.cpp:108:38: note: in expansion of macro ‘FOR’
  108 |  FOR(i,argc-1) s+=argv[i+1],s+='\n'; FOR(i,s.size()) ungetc(s[s.size()-1-i],stdin);
      |                                      ^~~

Judge Result