# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
441087 | OttoTheDino | Jump (BOI06_jump) | C++17 | 1 ms | 436 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;
#define rep(i,s,e) for (int i = s; i <= e; ++i)
#define rrep(i,s,e) for (int i = s; i >= e; --i)
#define pb push_back
#define pf push_front
#define fi first
#define se second
#define all(a) a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n; cin >> n;
int a[n][n];
ll dp[n][n]={};
rep (i,0,n-1) rep (j,0,n-1) cin >> a[i][j];
dp[0][0] = 1;
rep (i,0,n-1) {
rep(j,0,n-1) {
if (a[i][j]==0) continue;
if (i+a[i][j]<n) dp[i+a[i][j]][j]+=dp[i][j];
if (j+a[i][j]<n) dp[i][j+a[i][j]]+=dp[i][j];
}
}
cout << dp[n-1][n-1] << "\n";
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |