fork download
  1. #include<bits/stdc++.h>
  2.  
  3. #define ll long long
  4. #define pp push_back
  5. #define endl '\n'
  6. #define all(x) x.begin(),x.end()
  7. #define ld long double
  8. #define PI acos(-1)
  9. #define ones(x) __builtin_popcountll(x)
  10. //#define int ll
  11.  
  12. using namespace std;
  13.  
  14. void Drakon() {
  15. ios_base::sync_with_stdio(false);
  16. cin.tie(nullptr);
  17. cout.tie(nullptr);
  18. #ifdef Clion
  19. freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
  20. #endif
  21. }
  22.  
  23. unsigned long long inf = 1e10;
  24. const double EPS = 1e-6;
  25. const int MOD = 1000000007, N = 1e6 + 5, LOG = 25;
  26.  
  27. ll mul(const ll &a, const ll &b) {
  28. return (a % MOD + MOD) * (b % MOD + MOD) % MOD;
  29. }
  30.  
  31. ll add(const ll &a, const ll &b) {
  32. return (a + b + 2 * MOD) % MOD;
  33. }
  34.  
  35. ll pw(ll x, ll y) {
  36. ll ret = 1;
  37. while (y > 0) {
  38. if (y % 2 == 0) {
  39. x = mul(x, x);
  40. y = y / 2;
  41. } else {
  42. ret = mul(ret, x);
  43. y = y - 1;
  44. }
  45. }
  46. return ret;
  47. }
  48.  
  49. int n, m, k, diamond[N];
  50. vector<vector<int>> dp;
  51.  
  52. int slv(int x, int y) {
  53. if(x < 0 || x >= n || y < 0 || y >= m) return 0;
  54. if(~diamond[y] && x != diamond[y]) return 0;
  55. if(x == n - 1 && y == m - 1) return 1;
  56. int &ret = dp[x][y];
  57. if(~ret)
  58. return ret;
  59. ret = add(slv(x, y + 1), add(slv(x + 1, y + 1), slv(x - 1, y + 1)));
  60. return ret;
  61. }
  62.  
  63. void solve() {
  64. cin >> n >> m >> k;
  65. dp = vector<vector<int>>(n, vector<int>(m, -1));
  66. memset(diamond, -1, sizeof diamond);
  67. for (int i = 0; i < k; ++i) {
  68. int x, y;
  69. cin >> x >> y;
  70. x--, y--;
  71. if(diamond[y] == -1 || diamond[y] == x) diamond[y] = x;
  72. else {
  73. cout << 0;
  74. return;
  75. }
  76. }
  77. cout << slv(n - 1, 0);
  78. }
  79.  
  80. signed main() {
  81. Drakon();
  82. int t = 1;
  83. //cin >> t;
  84. while (t--) {
  85. solve();
  86. }
  87. }
Success #stdin #stdout 0.01s 7432KB
stdin
Standard input is empty
stdout
Standard output is empty