Submission #1695255


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;
const int Mod = 1e9 + 7;

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", &n, &m);

	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
Task D - Piling Up
User dy0607
Language C++14 (GCC 5.4.1)
Score 900
Code Size 681 Byte
Status AC
Exec Time 198 ms
Memory 70784 KB

Compile Error

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

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 900 / 900
Status
AC × 3
AC × 33
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 AC 90 ms 69376 KB
subtask_1_01.txt AC 23 ms 14592 KB
subtask_1_02.txt AC 20 ms 27520 KB
subtask_1_03.txt AC 75 ms 69120 KB
subtask_1_04.txt AC 59 ms 38400 KB
subtask_1_05.txt AC 144 ms 61696 KB
subtask_1_06.txt AC 75 ms 69120 KB
subtask_1_07.txt AC 82 ms 64768 KB
subtask_1_08.txt AC 32 ms 45952 KB
subtask_1_09.txt AC 147 ms 70272 KB
subtask_1_10.txt AC 198 ms 70784 KB
subtask_1_11.txt AC 73 ms 64640 KB
subtask_1_12.txt AC 48 ms 40064 KB
subtask_1_13.txt AC 68 ms 68992 KB
subtask_1_14.txt AC 37 ms 60160 KB
subtask_1_15.txt AC 22 ms 21632 KB
subtask_1_16.txt AC 86 ms 69248 KB
subtask_1_17.txt AC 30 ms 33792 KB
subtask_1_18.txt AC 34 ms 29952 KB
subtask_1_19.txt AC 45 ms 68736 KB
subtask_1_20.txt AC 90 ms 69376 KB
subtask_1_21.txt AC 7 ms 27264 KB
subtask_1_22.txt AC 17 ms 68352 KB
subtask_1_23.txt AC 9 ms 35456 KB
subtask_1_24.txt AC 17 ms 68352 KB
subtask_1_25.txt AC 1 ms 384 KB
subtask_1_26.txt AC 17 ms 68352 KB
subtask_1_27.txt AC 1 ms 256 KB