Submission #728526

#TimeUsernameProblemLanguageResultExecution timeMemory
728526KarpinJump (BOI06_jump)C++17
60 / 100
2 ms480 KiB
#include <bits/stdc++.h> using namespace std; #define ll long long #define vt vector #define ar array int amount [300][300]; void solve(){ int n; cin >> n; int grid [n][n]; 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 << 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 timeMemoryGrader output
Fetching results...