Submission #1870015


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
#define X first
#define Y second

const int mo=1e9+7;

int n,m,dp[305][305][305],lim[305][2];
bool vis[305][305][305];

int main()
{
#ifdef h10
	freopen("E.in","r",stdin);
	freopen("E.out","w",stdout);
#endif
	int i,j,k,l,r,x;
	scanf("%d%d",&n,&m);
	memset(vis,1,sizeof(vis));
	for (i=1;i<=m;i++)
	{
		scanf("%d%d%d",&l,&r,&x);
		if (x==1)
		{
			for (j=0;j<=n;j++)
			for (k=0;k<=n;k++)
				vis[r][j][k]&=j<l;
		}
		if (x==2)
		{
			for (j=0;j<=n;j++)
			for (k=0;k<=n;k++)
				vis[r][j][k]&=j>=l&&k<l;
		}
		if (x==3)
		{
			for (j=0;j<=n;j++)
			for (k=0;k<=n;k++)
				vis[r][j][k]&=k>=l;
		}
	}
	dp[0][0][0]=1;
	for (i=0;i<n;i++)
	for (j=0;j<=i;j++)
	for (k=0;k<=j;k++)
	{
		if (dp[i][j][k]&&vis[i][j][k])
		{
			(dp[i+1][j][k]+=dp[i][j][k])%=mo;
			(dp[i+1][i][j]+=dp[i][j][k])%=mo;
			(dp[i+1][i][k]+=dp[i][j][k])%=mo;
		}
	}
	int Ans=0;
	for (j=0;j<=n;j++)
	for (k=0;k<=j;k++)
		if (vis[n][j][k]) (Ans+=dp[n][j][k])%=mo;
	printf("%d\n",Ans);
}

Submission Info

Submission Time
Task E - RGB Sequence
User h10
Language C++14 (GCC 5.4.1)
Score 800
Code Size 1055 Byte
Status AC
Exec Time 78 ms
Memory 135424 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:18:21: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d",&n,&m);
                     ^
./Main.cpp:22:27: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
   scanf("%d%d%d",&l,&r,&x);
                           ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 800 / 800
Status
AC × 4
AC × 47
Set Name Test Cases
Sample 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt
All 0_00.txt, 0_01.txt, 0_02.txt, 0_03.txt, 1_00.txt, 1_01.txt, 1_02.txt, 1_03.txt, 1_04.txt, 1_05.txt, 1_06.txt, 1_07.txt, 1_08.txt, 1_09.txt, 1_10.txt, 1_11.txt, 1_12.txt, 1_13.txt, 1_14.txt, 1_15.txt, 1_16.txt, 1_17.txt, 1_18.txt, 1_19.txt, 1_20.txt, 1_21.txt, 1_22.txt, 1_23.txt, 1_24.txt, 1_25.txt, 1_26.txt, 1_27.txt, 1_28.txt, 1_29.txt, 1_30.txt, 1_31.txt, 1_32.txt, 1_33.txt, 1_34.txt, 1_35.txt, 1_36.txt, 1_37.txt, 1_38.txt, 1_39.txt, 1_40.txt, 1_41.txt, 1_42.txt
Case Name Status Exec Time Memory
0_00.txt AC 9 ms 30976 KB
0_01.txt AC 9 ms 30976 KB
0_02.txt AC 8 ms 28928 KB
0_03.txt AC 9 ms 30976 KB
1_00.txt AC 60 ms 118016 KB
1_01.txt AC 52 ms 117632 KB
1_02.txt AC 50 ms 115456 KB
1_03.txt AC 48 ms 102656 KB
1_04.txt AC 52 ms 116480 KB
1_05.txt AC 52 ms 117760 KB
1_06.txt AC 51 ms 117504 KB
1_07.txt AC 41 ms 55552 KB
1_08.txt AC 53 ms 118400 KB
1_09.txt AC 56 ms 117760 KB
1_10.txt AC 51 ms 117504 KB
1_11.txt AC 41 ms 47360 KB
1_12.txt AC 55 ms 118272 KB
1_13.txt AC 56 ms 117632 KB
1_14.txt AC 52 ms 117504 KB
1_15.txt AC 53 ms 117248 KB
1_16.txt AC 53 ms 118912 KB
1_17.txt AC 52 ms 117760 KB
1_18.txt AC 48 ms 117632 KB
1_19.txt AC 45 ms 98560 KB
1_20.txt AC 55 ms 119168 KB
1_21.txt AC 53 ms 117760 KB
1_22.txt AC 48 ms 115712 KB
1_23.txt AC 54 ms 117120 KB
1_24.txt AC 56 ms 116736 KB
1_25.txt AC 53 ms 115968 KB
1_26.txt AC 47 ms 115712 KB
1_27.txt AC 37 ms 63744 KB
1_28.txt AC 51 ms 115712 KB
1_29.txt AC 49 ms 115584 KB
1_30.txt AC 46 ms 115840 KB
1_31.txt AC 50 ms 115584 KB
1_32.txt AC 50 ms 118016 KB
1_33.txt AC 48 ms 117632 KB
1_34.txt AC 45 ms 117760 KB
1_35.txt AC 46 ms 117760 KB
1_36.txt AC 44 ms 117376 KB
1_37.txt AC 45 ms 117376 KB
1_38.txt AC 47 ms 119552 KB
1_39.txt AC 43 ms 102656 KB
1_40.txt AC 78 ms 135424 KB
1_41.txt AC 57 ms 117376 KB
1_42.txt AC 52 ms 117248 KB