Submission #1695250
Source Code Expand
#include <bits/stdc++.h>
#define For(i, j, k) for(int i = j; i <= k; i++)
using namespace std;
const int N = 3010;
int Mod;
void add(int &x, int y){
x += y;
if(x >= Mod) x -= Mod;
}
int dp[N][N][2], n, m;
int main(){
scanf("%d%d%d", &n, &m, &Mod);
For(i, 0, n) dp[0][i][i == 0] = 1;
For(i, 0, m - 1) For(j, 0, n) For(v, 0, 1){
int val = dp[i][j][v];
if(j){
add(dp[i + 1][j][v | (j == 1)], val);
add(dp[i + 1][j - 1][v | (j == 1)], val);
}
if(n - j){
add(dp[i + 1][j][v], val);
add(dp[i + 1][j + 1][v], val);
}
}
int ans = 0;
For(i, 0, n) add(ans, dp[m][i][1]);
printf("%d\n", ans);
return 0;
}
Submission Info
Submission Time
2017-10-20 20:27:16+0900
Task
D - Piling Up
User
dy0607
Language
C++14 (GCC 5.4.1)
Score
0
Code Size
673 Byte
Status
WA
Exec Time
291 ms
Memory
70784 KB
Compile Error
./Main.cpp: In function ‘int main()’:
./Main.cpp:18:31: warning: ignoring return value of ‘int scanf(const char*, ...)’, declared with attribute warn_unused_result [-Wunused-result]
scanf("%d%d%d", &n, &m, &Mod);
^
Judge Result
Set Name
Sample
All
Score / Max Score
0 / 0
0 / 900
Status
Set Name
Test Cases
Sample
sample_01.txt, sample_02.txt, sample_03.txt
All
sample_01.txt, sample_02.txt, sample_03.txt, sample_01.txt, sample_02.txt, sample_03.txt, subtask_1_01.txt, subtask_1_02.txt, subtask_1_03.txt, subtask_1_04.txt, subtask_1_05.txt, subtask_1_06.txt, subtask_1_07.txt, subtask_1_08.txt, subtask_1_09.txt, subtask_1_10.txt, subtask_1_11.txt, subtask_1_12.txt, subtask_1_13.txt, subtask_1_14.txt, subtask_1_15.txt, subtask_1_16.txt, subtask_1_17.txt, subtask_1_18.txt, subtask_1_19.txt, subtask_1_20.txt, subtask_1_21.txt, subtask_1_22.txt, subtask_1_23.txt, subtask_1_24.txt, subtask_1_25.txt, subtask_1_26.txt, subtask_1_27.txt
Case Name
Status
Exec Time
Memory
sample_01.txt
AC
1 ms
256 KB
sample_02.txt
AC
1 ms
384 KB
sample_03.txt
WA
131 ms
69376 KB
subtask_1_01.txt
WA
28 ms
14592 KB
subtask_1_02.txt
WA
26 ms
27520 KB
subtask_1_03.txt
WA
106 ms
69120 KB
subtask_1_04.txt
WA
83 ms
38400 KB
subtask_1_05.txt
WA
210 ms
61696 KB
subtask_1_06.txt
WA
106 ms
69120 KB
subtask_1_07.txt
WA
123 ms
64768 KB
subtask_1_08.txt
WA
43 ms
45952 KB
subtask_1_09.txt
WA
218 ms
70272 KB
subtask_1_10.txt
WA
291 ms
70784 KB
subtask_1_11.txt
WA
105 ms
64640 KB
subtask_1_12.txt
WA
67 ms
40064 KB
subtask_1_13.txt
WA
96 ms
68992 KB
subtask_1_14.txt
WA
49 ms
60160 KB
subtask_1_15.txt
WA
31 ms
21632 KB
subtask_1_16.txt
WA
128 ms
69248 KB
subtask_1_17.txt
WA
41 ms
33792 KB
subtask_1_18.txt
WA
48 ms
29952 KB
subtask_1_19.txt
WA
59 ms
68736 KB
subtask_1_20.txt
WA
130 ms
69376 KB
subtask_1_21.txt
WA
7 ms
27264 KB
subtask_1_22.txt
WA
16 ms
68352 KB
subtask_1_23.txt
WA
9 ms
35456 KB
subtask_1_24.txt
WA
16 ms
68352 KB
subtask_1_25.txt
WA
1 ms
384 KB
subtask_1_26.txt
WA
16 ms
68352 KB
subtask_1_27.txt
AC
1 ms
256 KB