# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
634840 | kabika | Jump (BOI06_jump) | C++14 | 1 ms | 468 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr ll MOD = 1e9 + 7;
#define pb push_back
int main()
{
ios_base::sync_with_stdio(0);
cin.tie(0);
cout.tie(0);
int n;
cin >> n;
vector<vector<int>> v(n,vector<int>(n));
vector<vector<ll>> dp(n,vector<ll>(n,0));
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
cin >> v[i][j];
}
dp[0][0] = 1;
for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
{
if(v[i][j] == 0)
continue;
if(i+v[i][j] < n)
dp[i+v[i][j]][j] += dp[i][j];
if(j+v[i][j] < n)
dp[i][j+v[i][j]] += dp[i][j];
}
}
/*for(int i = 0; i < n; ++i)
{
for(int j = 0; j < n; ++j)
cout << dp[i][j] << " ";
cout << '\n';
}*/
cout << dp[n-1][n-1] << '\n';
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |