Submission #3417593


Source Code Expand

#include<bits/stdc++.h>
using namespace std;
const long long mo=1e9+7;
int n,x,y,z,hk,sum;
long long ans,dp[45][1<<18];
int main(){
	scanf("%d%d%d%d",&n,&x,&y,&z);
	memset(dp,0,sizeof dp);
	hk=1<<x+y+z-1;
    hk|=1<<y+z-1;
    hk|=1<<z-1;
	sum=(1<<x+y+z)-1;
	dp[0][0]=1; ans=1;
	for(int i=1;i<=n;i++){
		ans=ans*10%mo;
		for(int j=0;j<=sum;j++){
		  if(dp[i-1][j]==0) continue;
		  for(int k=1;k<=10;k++){
		  	int now=(j<<k)|(1<<k-1); 
			now&=sum;// avoid"now"boom
		  	if((now&hk)!=hk) 
			  dp[i][now]=(dp[i][now]+dp[i-1][j])%mo;
		  }
		}
	}
	for(int j=0;j<=sum;j++) ans=(ans-dp[n][j]+mo)%mo;
	printf("%lld\n",ans);
	return 0;
}

Submission Info

Submission Time
Task E - Iroha and Haiku
User luogu_bot5
Language C++ (GCC 5.4.1)
Score 700
Code Size 663 Byte
Status AC
Exec Time 234 ms
Memory 92416 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:7:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
  scanf("%d%d%d%d",&n,&x,&y,&z);
                               ^

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 700 / 700
Status
AC × 4
AC × 35
Set Name Test Cases
Sample subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt
All subtask0_sample_01.txt, subtask0_sample_02.txt, subtask0_sample_03.txt, subtask0_sample_04.txt, subtask1_01.txt, subtask1_02.txt, subtask1_03.txt, subtask1_04.txt, subtask1_05.txt, subtask1_06.txt, subtask1_07.txt, subtask1_08.txt, subtask1_09.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_16.txt, subtask1_17.txt, subtask1_18.txt, subtask1_19.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_24.txt, subtask1_25.txt, subtask1_max1.txt, subtask1_max2.txt, subtask1_max3.txt, subtask1_min1.txt, subtask1_min2.txt, subtask1_min3.txt
Case Name Status Exec Time Memory
subtask0_sample_01.txt AC 25 ms 92416 KB
subtask0_sample_02.txt AC 25 ms 92416 KB
subtask0_sample_03.txt AC 24 ms 92416 KB
subtask0_sample_04.txt AC 234 ms 92416 KB
subtask1_01.txt AC 24 ms 92416 KB
subtask1_02.txt AC 28 ms 92416 KB
subtask1_03.txt AC 24 ms 92416 KB
subtask1_04.txt AC 25 ms 92416 KB
subtask1_05.txt AC 24 ms 92416 KB
subtask1_06.txt AC 24 ms 92416 KB
subtask1_07.txt AC 25 ms 92416 KB
subtask1_08.txt AC 24 ms 92416 KB
subtask1_09.txt AC 24 ms 92416 KB
subtask1_10.txt AC 24 ms 92416 KB
subtask1_11.txt AC 24 ms 92416 KB
subtask1_12.txt AC 32 ms 92416 KB
subtask1_13.txt AC 27 ms 92416 KB
subtask1_14.txt AC 24 ms 92416 KB
subtask1_15.txt AC 33 ms 92416 KB
subtask1_16.txt AC 99 ms 92416 KB
subtask1_17.txt AC 39 ms 92416 KB
subtask1_18.txt AC 62 ms 92416 KB
subtask1_19.txt AC 42 ms 92416 KB
subtask1_20.txt AC 28 ms 92416 KB
subtask1_21.txt AC 59 ms 92416 KB
subtask1_22.txt AC 41 ms 92416 KB
subtask1_23.txt AC 39 ms 92416 KB
subtask1_24.txt AC 32 ms 92416 KB
subtask1_25.txt AC 42 ms 92416 KB
subtask1_max1.txt AC 234 ms 92416 KB
subtask1_max2.txt AC 221 ms 92416 KB
subtask1_max3.txt AC 125 ms 92416 KB
subtask1_min1.txt AC 24 ms 92416 KB
subtask1_min2.txt AC 24 ms 92416 KB
subtask1_min3.txt AC 25 ms 92416 KB