Submission #1216381
Source Code Expand
#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
#include<vector>
#include<queue>
#include<set>
#include<map>
#include<stack>
#include<bitset>
#include<ext/pb_ds/priority_queue.hpp>
using namespace std;
const int maxn = 5005;
const int maxm = 1E4 + 10;
typedef long long LL;
const LL mo = 1000000007;
int n,k,x,tail,Ans = 1,s[maxn],f[maxn][maxm];
inline int Mul(const LL &x,const LL &y) {return x * y % mo;}
inline int Add(const int &x,const int &y) {return x + y < mo ? x + y : x + y - mo;}
inline int Dec(const int &x,const int &y) {return x - y >= 0 ? x - y : x - y + mo;}
int main()
{
#ifdef DMC
freopen("DMC.txt","r",stdin);
#endif
f[0][1] = 1; cin >> n >> k >> x;
for (int i = 0; i < k; i++) scanf("%d",&s[i]);
for (int i = 1; i < k; i++) tail = max(tail,s[i] - s[i - 1]);
for (int i = 1; i <= 2 * x; i++)
{
int sum = 0,Max = i + (i & 1);
for (int j = 1; j <= tail; j++)
{
sum = Add(sum,f[i - 1][j - 1]);
if (j - Max - 1 >= 0) sum = Dec(sum,f[i - 1][j - Max - 1]);
f[i][j] = sum; if (i + 1 >= j) f[i][j] = Add(f[i][j],1);
}
}
for (int i = 1; i < k; i++) Ans = Mul(Ans,f[2 * x - 2 * i + 1][s[i] - s[i - 1]]);
cout << Ans << endl;
return 0;
}
Submission Info
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:33:47: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
for (int i = 0; i < k; i++) scanf("%d",&s[i]);
^
Judge Result
Set Name |
Subtask1 |
Subtask2 |
Subtask3 |
Subtask4 |
Subtask5 |
Score / Max Score |
120 / 120 |
90 / 90 |
260 / 260 |
160 / 160 |
370 / 370 |
Status |
|
|
|
|
|
Set Name |
Test Cases |
Subtask1 |
sub1_in1.txt, sub1_in2.txt, sub1_in3.txt |
Subtask2 |
sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt |
Subtask3 |
sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt |
Subtask4 |
sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt, sub4_in1.txt, sub4_in2.txt, sub4_in3.txt |
Subtask5 |
sub1_in1.txt, sub1_in2.txt, sub1_in3.txt, sub2_in1.txt, sub2_in2.txt, sub2_in3.txt, sub3_in1.txt, sub3_in2.txt, sub3_in3.txt, sub4_in1.txt, sub4_in2.txt, sub4_in3.txt, sub5_in1.txt, sub5_in2.txt, sub5_in3.txt |
Case Name |
Status |
Exec Time |
Memory |
sub1_in1.txt |
AC |
1 ms |
256 KB |
sub1_in2.txt |
AC |
1 ms |
256 KB |
sub1_in3.txt |
AC |
1 ms |
256 KB |
sub2_in1.txt |
AC |
1 ms |
384 KB |
sub2_in2.txt |
AC |
1 ms |
384 KB |
sub2_in3.txt |
AC |
1 ms |
384 KB |
sub3_in1.txt |
AC |
2 ms |
2560 KB |
sub3_in2.txt |
AC |
2 ms |
2560 KB |
sub3_in3.txt |
AC |
2 ms |
2560 KB |
sub4_in1.txt |
AC |
6 ms |
20992 KB |
sub4_in2.txt |
AC |
6 ms |
20992 KB |
sub4_in3.txt |
AC |
6 ms |
20992 KB |
sub5_in1.txt |
AC |
309 ms |
195712 KB |
sub5_in2.txt |
AC |
309 ms |
195712 KB |
sub5_in3.txt |
AC |
309 ms |
195712 KB |