Submission #19672

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
19672	2016-02-25T04:25:52 Z	yukariko	괄호 (kriii4_R)	C++14	0 / 100	6 ms	19300 KB

R

#include <bits/stdc++.h>

using namespace std;

const int MOD = 1000000007;

int N, M;

long long cache[2000001];
char res[2000001];

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

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

	res[pos / 2] = '(';
	res[2 * N - (pos / 2) - 1] = ')';
	ans = (solve(pos + 2) * M) % MOD;
	res[pos / 2 + 1] = ')';
	res[2 * N - (pos / 2) - 2] = '(';
	ans = (ans + solve(pos + 4) * M) % MOD;
	return ans;
}


int main()
{
	memset(cache, -1, sizeof(cache));
	scanf("%d%d", &N, &M);

	cache[0] = cache[1] = 1;
	for(int i=2; i <= N; i++)
		cache[i] = (cache[i-1] * M + cache[i-2] * M) % MOD;

	printf("%lld", cache[N]);
	return 0;
}

Subtask #1

0.0 / 8.0

#	Verdict	Execution time	Memory	Grader output
1	Incorrect	6 ms	19300 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	-