Submission #3559729
Source Code Expand
#include<cstdio> #include<iostream> #include<cstring> #define RG register #define LL long long using namespace std; const LL mod=1e9+7; int n,m; LL dp[305][305][305]; inline int read(){ char ch=getchar(); int x=0, f=1; while(ch<'0' || ch>'9'){if(ch=='-') f=-1; ch=getchar(); } while(ch>='0' && ch<='9'){x=x*10+ch-'0'; ch=getchar(); } return x*f;} int main() { // freopen("Road of the King.in","r",stdin); //freopen(".out","w",stdout); n=read(); m=read(); dp[0][1][1]=1; for(RG int i=0;i<m;i++) for(RG int j=1;j<=n;j++) for(RG int k=1;k<=j;k++) { (dp[i+1][j+1][k]+=dp[i][j][k]*(n-j))%=mod; (dp[i+1][j][k]+=dp[i][j][k]*(j-k))%=mod; (dp[i+1][j][j]+=dp[i][j][k]*k)%=mod; } printf("%lld\n",dp[m][n][n]); //fclose(stdin); fclose(stdout); return 0; }
Submission Info
Submission Time | |
---|---|
Task | F - Road of the King |
User | vjudge3 |
Language | C++14 (GCC 5.4.1) |
Score | 1000 |
Code Size | 774 Byte |
Status | AC |
Exec Time | 124 ms |
Memory | 218624 KB |
Judge Result
Set Name | sample | all | ||||
---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 1000 / 1000 | ||||
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, 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, sample-01.txt, sample-02.txt, sample-03.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 1 ms | 256 KB |
01-02.txt | AC | 1 ms | 256 KB |
01-03.txt | AC | 44 ms | 217344 KB |
01-04.txt | AC | 2 ms | 1024 KB |
01-05.txt | AC | 43 ms | 217344 KB |
01-06.txt | AC | 51 ms | 217728 KB |
01-07.txt | AC | 118 ms | 218624 KB |
01-08.txt | AC | 123 ms | 218624 KB |
01-09.txt | AC | 123 ms | 218624 KB |
01-10.txt | AC | 124 ms | 218624 KB |
sample-01.txt | AC | 2 ms | 2304 KB |
sample-02.txt | AC | 65 ms | 218112 KB |
sample-03.txt | AC | 63 ms | 110080 KB |