# | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
---|---|---|---|---|---|---|---|
444452 | 2021-07-14T05:42:42 Z | cpp219 | 캥거루 (CEOI16_kangaroo) | C++14 | 16 ms | 31820 KB |
#pragma GCC optimization O2 #pragma GCC optimization "unroll-loop" #pragma target ("avx2") #include <bits/stdc++.h> #define ll long long #define ld long double #define fs first #define sc second using namespace std; typedef pair<ll,ll> LL; const ll N = 2e3 + 9; const ll Log2 = 20; const ll mod = 1e9 + 7; ll n,s,e,dp[N][N]; ll f(ll pos,ll g){ if (pos == n + 1) return !g; if (dp[pos][g] != -1) return dp[pos][g]; ll ans = 0; if (pos > e){ if (g) ans = f(pos + 1,g - 1); ans = (ans + f(pos + 1,g + 1) * g * (g + 1))%mod; } else if (pos == e) ans = (f(pos + 1,g) + f(pos + 1,g + 1)*(g + 1))%mod; else if (pos > s){ if (g) ans = f(pos + 1,g - 1); ans = (ans + f(pos + 1,g + 1) * (g + 1) * (g + 1))%mod; } else if (pos == s) ans = (f(pos + 1,g) + f(pos + 1,g + 1)*(g + 1))%mod; else if (pos < s){ if (g) ans = f(pos + 1,g - 1); ans = (ans + f(pos + 1,g + 1) * (g + 2) * (g + 1))%mod; } return dp[pos][g] = ans; } int main(){ ios_base::sync_with_stdio(NULL); cin.tie(0); cout.tie(0); #define task "test" if (fopen(task".INP","r")){ freopen(task".INP","r",stdin); freopen(task".OUT","w",stdout); } cin>>n>>s>>e; memset(dp,-1,sizeof(dp)); if (s < e) swap(s,e); cout<<f(2,0); }
Compilation message
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 31820 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 31820 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 31820 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |
# | 결과 | 실행 시간 | 메모리 | Grader output |
---|---|---|---|---|
1 | Incorrect | 16 ms | 31820 KB | Output isn't correct |
2 | Halted | 0 ms | 0 KB | - |