Submission #994286
Source Code Expand
//* #include <stdio.h> #include <string.h> #include <ctype.h> #include <time.h> #include <stdlib.h> #include <iostream> #include <algorithm> #include <vector> #include <queue> #include <set> #include <map> #include <string> #include <numeric> #include <functional> #define MOD 1000000007 #define MAX 0x3f3f3f3f #define MAX2 0x3f3f3f3f3f3f3f3fll #define ERR 1e-10 #define mp make_pair #define all(x) (x).begin(), (x).end() #pragma warning(disable:4996) using namespace std; typedef long long ll; typedef long double ldb; typedef pair<int, int> pii; typedef pair<ll, ll> pll; typedef pair<double, double> pdd; ll n, m; ll pas[400][400]; ll xpow[400][400]; int main() { ll i, j, k, l; cin>>n>>m; for(i=0;i<400;i++) { pas[i][0]=pas[i][i]=1; for(j=1;j<i;j++) { pas[i][j]=(pas[i-1][j]+pas[i-1][j-1])%MOD; } } for(i=0;i<400;i++) { xpow[i][0]=1; for(j=1;j<400;j++) xpow[i][j]=xpow[i][j-1]*i%MOD; } ll ans=0; for(i=n-1;i<m;i++) { ll t=i; ll u=xpow[n-1][m-1-i]; ll sum=0; for(j=0;j<=n-1;j++) { sum+=xpow[n-j][t]*pas[n-1][j]%MOD*(j%2==0?1:-1); sum%=MOD; } ans+=sum*u%MOD; ans%=MOD; } if(ans < 0) ans+=MOD; cout<<ans<<endl; return 0; } //*/
Submission Info
Submission Time | |
---|---|
Task | F - Road of the King |
User | polequoll |
Language | C++14 (GCC 5.4.1) |
Score | 0 |
Code Size | 1256 Byte |
Status | WA |
Exec Time | 6 ms |
Memory | 2688 KB |
Judge Result
Set Name | sample | all | ||||||||
---|---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 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 |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01-01.txt | AC | 5 ms | 2688 KB |
01-02.txt | AC | 5 ms | 2688 KB |
01-03.txt | AC | 5 ms | 2688 KB |
01-04.txt | AC | 5 ms | 2688 KB |
01-05.txt | WA | 5 ms | 2688 KB |
01-06.txt | WA | 5 ms | 2688 KB |
01-07.txt | WA | 5 ms | 2688 KB |
01-08.txt | WA | 5 ms | 2688 KB |
01-09.txt | WA | 5 ms | 2688 KB |
01-10.txt | AC | 5 ms | 2688 KB |
sample-01.txt | AC | 5 ms | 2688 KB |
sample-02.txt | WA | 6 ms | 2688 KB |
sample-03.txt | AC | 5 ms | 2688 KB |