提出 #35638627

---

ソースコード 拡げる

#include<iostream>
#include<atcoder/modint>
using namespace std;
using mint=atcoder::modint1000000007;
int N,A,B;
mint dp[5002][2][2][5002];
mint tp1[5002][2],tp2[5002][2][5002];
main()
{
	cin>>N>>A>>B;
	if(A<B)swap(A,B);
	//if 0 ga A ko rennzoku -> ok
	//else
	//  if 1 ga B ko rennzoku
	//    if 1 ga B ko ijou rennzoku wo 0 ni site 0 ga A ko rennzoku -> ok
	//    else -> ng
	//  else -> ng
	dp[0][0][0][0]=1;
	for(int i=0;i<=N;i++)
	{
		tp1[i+1][0]+=tp1[i][0];
		tp1[i+1][1]+=tp1[i][1];
		dp[i][0][1][0]+=tp1[i][0];
		dp[i][1][1][0]+=tp1[i][1];
		for(int k=0;k<2;k++)
		{
			for(int j=0;j<=i;j++)
			{
				tp2[i+1][k][j+1]+=tp2[i][k][j];
				dp[i][k][1][j]+=tp2[i][k][j];
				//A->A
				dp[i+1][k][0][j+1]+=dp[i][k][0][j];
				dp[i+1][k][0][j+1]+=dp[i][k][1][j];
				//A->B
				/*tp1
				dp[i+1][k|j>=A][1][0]+=dp[i][k][0][j];
				...
				dp[i+B-1][k|j>=A][1][0]+=dp[i][k][0][j];
				*/
				tp1[i+1][k|j>=A]+=dp[i][k][0][j];
				if(i+B<=N)tp1[i+B][k|j>=A]-=dp[i][k][0][j];
				/*tp2
				dp[i+B][k][1][j+B]+=dp[i][k][0][j];
				...
				dp[i+(N-i)][k][1][j+(N-i)]+=dp[i][k][0][j];
				*/
				if(i+B<=N)
				{
					tp2[i+B][k][j+B]+=dp[i][k][0][j];
					tp2[i+(N-i)+1][k][j+(N-i)+1]-=dp[i][k][0][j];
				}
			}
		}
	}
	mint ans=0;
	for(int k=0;k<2;k++)for(int j=0;j<=N;j++)
	{
		if(k==1||j>=A)ans+=dp[N][k][0][j]+dp[N][k][1][j];
	}
	cout<<ans.val()<<endl;
}

提出情報

コンパイルエラー

./Main.cpp:8:6: warning: ISO C++ forbids declaration of ‘main’ with no type [-Wreturn-type]
    8 | main()
      |      ^
./Main.cpp: In function ‘int main()’:
./Main.cpp:40:17: warning: suggest parentheses around comparison in operand of ‘|’ [-Wparentheses]
   40 |     tp1[i+1][k|j>=A]+=dp[i][k][0][j];
      |                ~^~~
./Main.cpp:41:27: warning: suggest parentheses around comparison in operand of ‘|’ [-Wparentheses]
   41 |     if(i+B<=N)tp1[i+B][k|j>=A]-=dp[i][k][0][j];
      |                          ~^~~

ジャッジ結果