fork download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3. #define int long long
  4. #define dd double
  5. #define ld long double
  6. #define ull unsigned long long
  7. #define yes cout << "YES\n"
  8. #define no cout << "NO\n"
  9. #define el "\n"
  10. #define Arwa ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);
  11. #define fix(x) cout << fixed << setprecision(x)
  12. #define all(v) v.begin(),v.end()
  13. #define dpp(v,val) memset(v,val,sizeof(v))
  14. #define mod 1e9+7
  15. #define oo 1e9
  16. const int N = 1e5 + 5;
  17. int n,m;
  18. vector<vector<int>>v;
  19. map<pair<int,int>,bool>mp;
  20. int dp[1003][1003];
  21. bool valid(int i,int j)
  22. {
  23. if(mp[{i,j}]==1) return false;
  24. return (i>=1&&i<=n&&j>=1&&j<=m);
  25. }
  26. int solve(int i,int j)
  27. {
  28. if(!valid(i,j)) return 0;
  29. int& ret =dp[i][j];
  30. if(ret!=-1) return ret;
  31. if(i==n&&j==m) return 1;
  32. ret=solve(i,j+1)+solve(i+1,j);
  33. return ret;
  34. }
  35. void HereWeGoAgain()
  36. {
  37. cin>>n>>m;
  38. cin.ignore();
  39. v.resize(n);
  40. for(int i=0;i<n;i++)
  41. {
  42. string s;
  43. getline(cin,s);
  44. for(int j=1;j<s.length();j++)
  45. {
  46. if(s[j]!=' ')
  47. mp[{i+1,(s[j]-'0')}]=1;
  48. }
  49. }
  50. dpp(dp,-1);
  51. //for(auto it:mp) if(it.second) cout<<it.first.first<<' '<<it.first.second<<el;
  52. cout<<solve(1,1);
  53. }
  54. int32_t main()
  55. {
  56. Arwa
  57. int t=1;
  58. cin>>t;
  59. cout<<el<<el;
  60. for(int i=1;i<=t;i++)
  61. {
  62. HereWeGoAgain();
  63. cout<<el<<el;
  64. }
  65. return 0;
  66. }
Success #stdin #stdout 0.01s 11456KB
stdin
Standard input is empty
stdout

0