Arch Linux

Oops, I didn't upload the source code in the report. I place one in the comment. Sorry for that.

----
#include <cstring>
#include <iostream>
#include <algorithm>
#include <vector>
#include <unordered_map>
#include <unordered_set>
#include <functional>
#include <stack>
#include <list>
#include <array>
#include <sstream>
#include <cmath>
#include <cinttypes>
#include <cassert>

using namespace std;

class Solution {
public:
int longestIncreasingPath(vector<vector<int>>& matrix)
{
const int row = matrix.size();
if (0 == row)
return 0;

const int col = matrix[0].size();
if (0 == col)
return 0;

bool visited[row][col];
int dist[row][col];

memset(visited, 0, sizeof(visited));
memset(dist, -1, sizeof(visited));

function<int(int, int)> rec = [&](int r, int c) {
if (visited[r][c])
return dist[r][c];

visited[r][c] = true;
int max_dist = 0;

if (r > 0 && matrix[r][c] < matrix[r - 1][c])
max_dist = max(max_dist, rec(r - 1, c)) + 1;

if (c > 0 && matrix[r][c] < matrix[r][c - 1])
max_dist = max(max_dist, rec(r, c - 1)) + 1;

if (r < row - 1 && matrix[r][c] < matrix[r + 1][c])
max_dist = max(max_dist, rec(r + 1, c)) + 1;

if (c < col - 1 && matrix[r][c] < matrix[r][c + 1])
max_dist = max(max_dist, rec(r, c + 1)) + 1;

dist[r][c] = max_dist;
return max_dist;
};

int ans = 0;

for (int r = 0; r < row; r++)
for (int c = 0; c < col; c++)
ans = max(ans, rec(r, c));

return ans;
}
};

int main()
{
Solution sol;
int row, col;
cin >> row >> col;

vector<vector<int>> matrix;

for (int r = 0; r < row; r++)
{
matrix.emplace_back();
for (int c = 0; c < col; c++)
{
int val;
cin >> val;
matrix[r].push_back(val);
}
}

cout << sol.longestIncreasingPath(matrix) << endl;

return 0;
}
----

The error is somewhat better now with GCC 8:

1337.cpp: In lambda function:
1337.cpp:37:17: sorry, unimplemented: capture of variably-modified type ‘bool [row][col]’ that is not an N3639 array of runtime bound
if (visited[r][c])

...which means you should bring it upstream. (Possibly it's already reported but I can't find it.)