Submission #1696097
Source Code Expand
#include<bits/stdc++.h>
using namespace std;
typedef long long LL;
const int maxn=3005;
const int INF=0x3f3f3f3f;
const int MOD=1e9+7;
struct Question{
int l,r;
}q[maxn];
LL C[maxn][maxn],dp[maxn][maxn];
int sum[maxn];
char s[maxn];
int n,m;
void pre_C(){
for(int i=0;i<=n;i++){
C[i][0]=1;
for(int j=1;j<=i;j++){
C[i][j]=(C[i-1][j]+C[i-1][j-1])%MOD;
}
}
}
int main()
{
scanf("%d%d",&n,&m);
scanf("%s",s+1);
pre_C();
for(int i=1;i<=n;i++)sum[i]=sum[i-1]+s[i]-'0';
for(int i=1;i<=m;i++){
scanf("%d%d",&q[i].l,&q[i].r);
if(q[i].r<=q[i-1].r)m--,i--;
}
q[m+1].l=n+1;q[m+1].r=n+1;
sum[n+1]=sum[n];
dp[1][sum[q[1].r]-sum[q[1].l-1]]=1;
for(int i=1;i<=m;i++){
if(q[i].r<q[i+1].l){
int len=q[i].r-q[i].l+1;
for(int j=0;j<=len;j++){
dp[i+1][sum[q[i+1].r]-sum[q[i+1].l-1]]+=dp[i][j]*C[len][j]%MOD,dp[i+1][sum[q[i+1].r]-sum[q[i+1].l-1]]%=MOD;
}
}
else{
int LEN=q[i].r-q[i].l+1;//qujianchang
int len=q[i].r-q[i+1].l+1;//jiaojichang
int pre=q[i+1].l-q[i].l;//qianzhui
for(int j=0;j<=LEN;j++)
for(int k=max(0,j-pre);k<=j&&k<=len;k++){
dp[i+1][sum[q[i+1].r]-sum[q[i].r]+k]+=dp[i][j]*C[pre][j-k]%MOD,dp[i+1][sum[q[i+1].r]-sum[q[i].r]+k]%=MOD;
}
}
}
printf("%lld\n",dp[m+1][0]);
return 0;
}
Submission Info
Submission Time |
|
Task |
F - Shuffling |
User |
vjudge2 |
Language |
C++14 (GCC 5.4.1) |
Score |
900 |
Code Size |
1255 Byte |
Status |
AC |
Exec Time |
32 ms |
Memory |
104832 KB |
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:31: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:32:17: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%s",s+1);
^
./Main.cpp:36:32: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d",&q[i].l,&q[i].r);
^
Judge Result
Set Name |
Sample |
All |
Score / Max Score |
0 / 0 |
900 / 900 |
Status |
|
|
Set Name |
Test Cases |
Sample |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt |
All |
subtask0_0.txt, subtask0_1.txt, subtask0_2.txt, subtask1_0.txt, subtask1_1.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_2.txt, subtask1_20.txt, subtask1_21.txt, subtask1_22.txt, subtask1_23.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name |
Status |
Exec Time |
Memory |
subtask0_0.txt |
AC |
2 ms |
2304 KB |
subtask0_1.txt |
AC |
2 ms |
2304 KB |
subtask0_2.txt |
AC |
2 ms |
2304 KB |
subtask1_0.txt |
AC |
32 ms |
102784 KB |
subtask1_1.txt |
AC |
29 ms |
92544 KB |
subtask1_10.txt |
AC |
29 ms |
90496 KB |
subtask1_11.txt |
AC |
27 ms |
78208 KB |
subtask1_12.txt |
AC |
32 ms |
104832 KB |
subtask1_13.txt |
AC |
29 ms |
90496 KB |
subtask1_14.txt |
AC |
27 ms |
78208 KB |
subtask1_15.txt |
AC |
32 ms |
102784 KB |
subtask1_16.txt |
AC |
29 ms |
90496 KB |
subtask1_17.txt |
AC |
27 ms |
78080 KB |
subtask1_18.txt |
AC |
32 ms |
102784 KB |
subtask1_19.txt |
AC |
30 ms |
92544 KB |
subtask1_2.txt |
AC |
27 ms |
78208 KB |
subtask1_20.txt |
AC |
27 ms |
78080 KB |
subtask1_21.txt |
AC |
32 ms |
102784 KB |
subtask1_22.txt |
AC |
29 ms |
90496 KB |
subtask1_23.txt |
AC |
27 ms |
80256 KB |
subtask1_3.txt |
AC |
32 ms |
102784 KB |
subtask1_4.txt |
AC |
30 ms |
92544 KB |
subtask1_5.txt |
AC |
27 ms |
78080 KB |
subtask1_6.txt |
AC |
32 ms |
102784 KB |
subtask1_7.txt |
AC |
30 ms |
92544 KB |
subtask1_8.txt |
AC |
27 ms |
78208 KB |
subtask1_9.txt |
AC |
32 ms |
102784 KB |