# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
316516 | 2020-10-26T13:48:48 Z | Dymo | Kangaroo (CEOI16_kangaroo) | C++14 | 1 ms | 384 KB |
#include<bits/stdc++.h> using namespace std; #define pb push_back #define ll long long #define pll pair<ll,ll> #define ff first #define ss second #define endl "\n" const ll maxn=3e3+50; const ll mod =1e9+7; const ll base=1e17; ll dp[maxn][maxn]; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); if (fopen("test.t", "r")) { freopen("test.inp", "r", stdin); freopen("test.out", "w", stdout) ; } ll n, st, ed; cin>>n>>st>>ed; if (st>ed) swap(st,ed); st++; ed++; dp[1][0]=1; for (ll i=2; i<=n; i++) { for (ll j=0; j<=n; j++) { if (i!=st&&i!=ed) { // them 1 nhom loai 1; if (j) dp[i][j]=(dp[i][j]+dp[i-1][j-1])%mod; // ghep 2 nhom loai 1; if (j) dp[i][j]=(dp[i][j]+dp[i-1][j+1]*(j+1)*j)%mod; // ghep nhom st va nhom loai 1; if (i>st) { dp[i][j]=(dp[i][j]+dp[i-1][j+1]*(j+1))%mod; } // ghep nhom ed va nhom loai 1; if (i>ed) { dp[i][j]=(dp[i][j]+dp[i-1][j+1]*(j+1))%mod; } // cout <<"WTF"<<endl; } else { dp[i][j]=(dp[i][j]+dp[i-1][j])%mod; if (j) dp[i][j]=(dp[i][j]+dp[i-1][j+1]*(j+1))%mod; } } } // cout <<dp[2][0]<<" "<<dp[2][1]<<" "<<dp[2][2]<<endl; cout <<dp[n][0]; }
Compilation message
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
1 | Incorrect | 1 ms | 384 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |