fork download 
  1. #include <bits/stdc++.h>
  2. #define ll long long
  3. #define PI 3.14159265359
  4. #define DP(x, y) memset(x, y, sizeof x)
  5. #define all(x) x.begin(), x.end()
  6. #define read(x) freopen("x", "r", stdin);
  7. #define write(x) freopen("x", "w", stdout);
  8.  
  9. using namespace std;
  10.  
  11. ll gcd(ll a,ll b) { while(b) { ll x = a; a = b; b = x % b; } return a; }
  12. ll lcm(ll a,ll b) { return a / gcd(a, b) * b; }
  13. ll nC2(ll n) { return (n)*(n-1)/2; }
  14. ll summing(ll n) { return (n)*(n+1); }
  15.  
  16. int Paths(int i, int j, int n, int m, vector<vector<char>>&grid, vector<vector<bool>>&vis, vector<vector<int>>&dp) {
  17.  
  18.     if (i == n && j == m) {
  19.         return 1;
  20.     }
  21.     if (i > n || j > m || i == 0 || j == 0) {
  22.         return 0;
  23.     }
  24.     if ( grid[i][j] == '*' || vis[i][j] ) {
  25.         return 0;
  26.     }
  27.     if (~dp[i][j]) {
  28.         return dp[i][j];
  29.     }
  30.  
  31.     vis[i][j] = 1;
  32.     int x = Paths(i+1, j, n, m, grid, vis, dp);
  33.     int y = Paths(i, j+1, n, m, grid, vis, dp);
  34.     int z = Paths(i-1, j, n, m, grid, vis, dp);
  35.     int w = Paths(i, j-1, n, m, grid, vis, dp);
  36.     vis[i][j] = 0;
  37.  
  38.     return (dp[i][j] = x+y+z+w);
  39.  
  40. }
  41.  
  42. void solve() {
  43.  
  44.     int n,m; cin >> n >> m;
  45.  
  46.     vector<pair<int,int>> breaking;
  47.     vector<vector<char>> grid(n+1, vector<char>(m+1, '.'));
  48.     vector<vector<bool>> vis(n+1, vector<bool>(m+1, 0));
  49.  
  50.     vector<vector<int>> dp(n+1, vector<int>(m+1, -1));
  51.  
  52.     cin.ignore();
  53.  
  54.     for (int i=0; i<n; i++) {
  55.  
  56.         string s, row, col;
  57.         getline(cin, s);
  58.  
  59.         stringstream ss(s);
  60.  
  61.         ss >> row;
  62.  
  63.         while (ss >> col) {
  64.             breaking.push_back({stoi(row), stoi(col)});
  65.         }
  66.     }
  67.  
  68.     for (auto i:breaking) {
  69.         grid[i.first][i.second] = '*';
  70.     }
  71.  
  72.     cout << Paths(1,1,n,m,grid,vis,dp) << "\n\n";
  73.  
  74. }
  75.  
  76. int main()
  77. {
  78.     ios::sync_with_stdio(false);
  79.     cin.tie(nullptr), cout.tie(nullptr);
  80.  
  81.     ll t=1; cin >> t;
  82.     while (t--) { solve(); }
  83.  
  84.     return 0;
  85. }
  86.  
Success #stdin #stdout 0s 5300KB
comments (?)
stdin 
Standard input is empty
stdout 
0
https://ideone.com/VAX7BF
language:
C++14 (gcc 8.3)
created:
14 days ago
visibility:
public

Share or Embed source code

Discover > Sphere Engine API

The brand new service which powers Ideone!

Discover > IDE Widget

Widget for compiling and running the source code in a web browser!