# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
728548 | Karpin | Jump (BOI06_jump) | C++14 | 1 ms | 596 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 ll long long
#define vt vector
#define ar array
double amount [300][300];
void solve(){
int n;
cin >> n;
int grid [n + 5][n + 5];
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
cin >> grid[i][j];
}
}
amount[0][0] = 1;
for(int i = 0; i < n; i++){
for(int j = 0; j < n; j++){
if (i == j && i == n - 1) break;
amount[i + grid[i][j]][j] += amount[i][j];
amount[i][j + grid[i][j]] += amount[i][j];
}
}
cout << round(amount[n - 1][n - 1]) << endl;
}
int main(){
ios::sync_with_stdio(0);
cin.tie(0);
int testcases = 1;
// cin >> testcases;
while(testcases--){
solve();
}
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |