Submission #993050


Source Code Expand

#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <algorithm>
using namespace std;

typedef long long ll;
const ll MOD = (ll)1e9 + 7;
ll add(ll x, ll y)
{
	x += y;
	if (x >= MOD) return x - MOD;
	return x;
}
ll sub(ll x, ll y)
{
	x -= y;
	if (x < 0) return x + MOD;
	return x;
}
ll mult(ll x, ll y)
{
	return (x * y) % MOD;
}

const int N = 304;
int n, m;
ll dp[2][N][N];

int main()
{
//	freopen("input.txt", "r", stdin);
//	freopen("output.txt", "w", stdout);

	scanf("%d%d", &n, &m);
	dp[0][1][0] = 1;
	while(m--)
	{
		for (int i = 0; i <= n; i++)
			for (int j = 0; j <= n; j++)
				dp[1][i][j] = 0;
		for (int i = 0; i <= n; i++)
			for (int j = 0; i + j <= n; j++)
			{
				if (dp[0][i][j] == 0) continue;
				dp[1][i + j][0] = add(dp[1][i + j][0], mult(dp[0][i][j], i));
				dp[1][i][j] = add(dp[1][i][j], mult(dp[0][i][j], j));
				dp[1][i][j + 1] = add(dp[1][i][j + 1], mult(dp[0][i][j], n - i - j));
			}
		for (int i = 0; i <= n; i++)
			for (int j = 0; j <= n; j++)
				dp[0][i][j] = dp[1][i][j];
	}
	printf("%lld\n", dp[0][n][0]);

	return 0;
}

Submission Info

Submission Time
Task F - Road of the King
User Um_nik
Language C++14 (GCC 5.4.1)
Score 1000
Code Size 1129 Byte
Status AC
Exec Time 81 ms
Memory 1664 KB

Compile Error

./Main.cpp: In function ‘int main()’:
./Main.cpp:35: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 1000 / 1000
Status
AC × 3
AC × 13
Set Name Test Cases
sample sample-01.txt, sample-02.txt, sample-03.txt
all sample-01.txt, sample-02.txt, sample-03.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt
Case Name Status Exec Time Memory
01-01.txt AC 3 ms 256 KB
01-02.txt AC 3 ms 256 KB
01-03.txt AC 3 ms 256 KB
01-04.txt AC 5 ms 1664 KB
01-05.txt AC 3 ms 256 KB
01-06.txt AC 15 ms 640 KB
01-07.txt AC 78 ms 1664 KB
01-08.txt AC 81 ms 1664 KB
01-09.txt AC 81 ms 1664 KB
01-10.txt AC 81 ms 1664 KB
sample-01.txt AC 3 ms 256 KB
sample-02.txt AC 32 ms 896 KB
sample-03.txt AC 30 ms 1664 KB