minimum-cost-to-make-at-least-one-valid-path-in-a-grid 1.0.0
Minimum Cost to Make at Least One Valid Path in a Grid
Loading...
Searching...
No Matches
main.cpp File Reference
#include <bits/stdc++.h>
Include dependency graph for main.cpp:

Go to the source code of this file.

Data Structures

struct  pair_hash
 
class  Solution
 

Functions

int main ()
 

Function Documentation

◆ main()

int main ( )

Definition at line 66 of file main.cpp.

67{
68 vector<vector<int>> grid = {{1,1,1,1}, {2,2,2,2}, {1,1,1,1}, {2,2,2,2}};
69 cout << Solution().minCost(grid) << '\n';
70 return 0;
71}
int minCost(vector< vector< int > > &grid)
Definition main.cpp:19

References Solution::minCost().