(UPD: 2024-12-04 14:48 UTC) Judge is not working due to Cloudflare incident. (URL) We can do nothing about it, sorry. After the incident is resolved, we will grade all submissions.

Submission #126806

#TimeUsernameProblemLanguageResultExecution timeMemory
126806PeppaPigKangaroo (CEOI16_kangaroo)C++14
100 / 100
42 ms23032 KiB
#include <bits/stdc++.h> #define long long long using namespace std; const int N = 2e3+5; const int M = 1e9+7; int n, s, e; long dp[N][N]; int main() { scanf("%d %d %d", &n, &s, &e); dp[1][1] = 1; for(int i = 2; i <= n; i++) for(int j = 1; j <= i; j++) { if(i == s || i == e) { dp[i][j] = (dp[i][j] + dp[i-1][j]) % M; dp[i][j] = (dp[i][j] + dp[i-1][j-1]) % M; } else { dp[i][j] = (dp[i][j] + dp[i-1][j+1] * j) % M; dp[i][j] = (dp[i][j] + dp[i-1][j-1] * (j - (i > s) - (i > e))) % M; } } printf("%lld\n", dp[n][1]); return 0; }

Compilation message (stderr)

kangaroo.cpp: In function 'int main()':
kangaroo.cpp:14:10: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
     scanf("%d %d %d", &n, &s, &e);
     ~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...