#700508 (C++17) No.1683 Robot Guidance

• 問題: No.1683 Robot Guidance
• ユーザー: 沙耶花
• 提出日時: 2021-09-17 22:19:26
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 100 ms / 2,000 ms
• コード長: 1,538 bytes
• コンパイル時間: 4,305 ms
• コンパイル使用メモリ: 266,604 KB
• 実行使用メモリ: 27,904 KB
• 最終ジャッジ日時: 2024-06-29 20:56:04
• 合計ジャッジ時間: 8,469 ms
• ジャッジサーバーID （参考情報）: judge2 / judge3

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	60 ms; 27,776 KB
testcase_01	AC	58 ms; 27,776 KB
testcase_02	AC	60 ms; 27,776 KB
testcase_03	AC	62 ms; 27,776 KB
testcase_04	AC	61 ms; 27,904 KB
testcase_05	AC	64 ms; 27,776 KB
testcase_06	AC	69 ms; 27,904 KB
testcase_07	AC	66 ms; 27,904 KB
testcase_08	AC	96 ms; 27,904 KB
testcase_09	AC	68 ms; 27,904 KB
testcase_10	AC	77 ms; 27,904 KB
testcase_11	AC	78 ms; 27,776 KB
testcase_12	AC	100 ms; 27,776 KB
testcase_13	AC	68 ms; 27,776 KB
testcase_14	AC	88 ms; 27,904 KB
testcase_15	AC	82 ms; 27,776 KB
testcase_16	AC	75 ms; 27,776 KB
testcase_17	AC	61 ms; 27,776 KB
testcase_18	AC	60 ms; 27,776 KB
testcase_19	AC	60 ms; 27,776 KB
testcase_20	AC	60 ms; 27,776 KB
testcase_21	AC	59 ms; 27,776 KB
testcase_22	AC	60 ms; 27,904 KB
testcase_23	AC	75 ms; 27,904 KB
testcase_24	AC	97 ms; 27,904 KB
testcase_25	AC	78 ms; 27,776 KB
testcase_26	AC	79 ms; 27,776 KB
testcase_27	AC	80 ms; 27,776 KB
testcase_28	AC	80 ms; 27,776 KB
testcase_29	AC	78 ms; 27,904 KB
testcase_30	AC	77 ms; 27,776 KB
testcase_31	AC	75 ms; 27,904 KB
testcase_32	AC	74 ms; 27,776 KB
testcase_33	AC	78 ms; 27,904 KB
testcase_34	AC	80 ms; 27,904 KB
testcase_35	AC	77 ms; 27,776 KB
testcase_36	AC	80 ms; 27,904 KB
testcase_37	AC	75 ms; 27,904 KB
testcase_38	AC	72 ms; 27,776 KB
testcase_39	AC	78 ms; 27,776 KB
testcase_40	AC	62 ms; 27,904 KB

ソースコード

#include <stdio.h>
#include <bits/stdc++.h>
#include <atcoder/all>
using namespace atcoder;
using mint = modint1000000007;
using namespace std;
#define rep(i,n) for (int i = 0; i < (n); ++i)
#define Inf 1000000001

struct combi{
	deque<mint> kaijou;
	deque<mint> kaijou_;
	
	combi(int n){
		kaijou.push_back(1);
		for(int i=1;i<=n;i++){
			kaijou.push_back(kaijou[i-1]*i);
		}
		
		mint b=kaijou[n].inv();
		
		kaijou_.push_front(b);
		for(int i=1;i<=n;i++){
			int k=n+1-i;
			kaijou_.push_front(kaijou_[0]*k);
		}
	}
	
	mint combination(int n,int r){
		if(r>n)return 0;
		mint a = kaijou[n]*kaijou_[r];
		a *= kaijou_[n-r];
		return a;
	}
	
	mint junretsu(int a,int b){
		mint x = kaijou_[a]*kaijou_[b];
		x *= kaijou[a+b];
		return x;
	}
	
	mint catalan(int n){
		return combination(2*n,n)/(n+1);
	}
	
};
 
int main(){
	
	int A,B,X,Y;
	cin>>A>>B>>X>>Y;
	
	vector<int> d(4,0);
	rep(i,B){
		d[i%4]++;
	}
	combi C(3000000);
	d[B%4]++;
	mint ans = 0;
	rep(i,A+1){
		
		vector<int> c(4,0);
		c[0] = i;
		c[2] = i - X;
		if(c[2]<0)continue;
		int remain = A - c[0] - c[2];
		remain -= abs(Y);
		if(remain<0)continue;
		if(remain%2==1)continue;
		if(Y>=0){
			c[1] = Y + remain/2;
			c[3] = remain/2;
		}
		else{
			c[3] = abs(Y) + remain/2;
			c[1] = remain/2;
		}
		
		mint temp = 1;
		rep(j,4){
			if(c[j]==0&&d[j]==0)continue;
			if(d[j]==0 && c[j]>0){
				temp = 0;
			}
			else{
				//cout<<c[j]+d[j]-1<<','<<c[j]<<endl;
				temp *= C.combination(c[j]+d[j]-1,c[j]);
			}
		}
		ans += temp;
		
	}
	
	cout<<ans.val()<<endl;
	
	return 0;
}