oj.uz

Submission #19656

# Submission time Handle Problem Language Result Execution time Memory
19656 2016-02-25T04:14:20 Z yukariko 괄호 (kriii4_R) C++14
0 / 100
 4 ms 31416 KB 
#include <bits/stdc++.h>

using namespace std;

const int MOD = 1000000007;

int N, M;

long long cache[2000001];

long long solve(int pos)
{
	if(pos > 2 * N)
		return 0;
	if(pos == 2 * N)
		return 1;

	long long& ans = cache[pos];
	if(ans != -1)
		return ans;

	ans = (solve(pos + 2) * M) % MOD;
	ans = (ans + solve(pos + 4) * M) % MOD;
	return ans;
}


int main()
{
	memset(cache, -1, sizeof(cache));
	scanf("%d%d", &N, &M);
	printf("%lld", solve(0));
	return 0;
}

Subtask #1
0.0 / 8.0

# Verdict Execution time Memory Grader output
1 Incorrect 4 ms 31416 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #2
0.0 / 92.0

# Verdict Execution time Memory Grader output
1 Halted 0 ms 0 KB -