| # |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
| 316337 |
2020-10-25T23:04:03 Z |
sofapuden |
Jump (BOI06_jump) |
C++14 |
|
37 ms |
384 KB |
#include <bits/stdc++.h>
using namespace std;
int main(){
int n; cin >> n;
vector<vector<int>> gr(n,vector<int>(n));
vector<vector<int>> dp(n,vector<int>(n,0));
dp[0][0] = 1;
for(auto &x : gr)for(auto &y : x)cin >> y;
for(int i = 0; i < n; ++i){
for(int j = 0; j < n; ++j){
if(gr[i][j] + i < n && gr[i][j] != 0)dp[i+gr[i][j]][j]+=dp[i][j];
if(gr[i][j] + j < n && gr[i][j] != 0)dp[i][j+gr[i][j]]+=dp[i][j];
}
}
cout << dp[n-1][n-1] << "\n";
}
| # |
Verdict |
Execution time |
Memory |
Grader output |
| 1 |
Correct |
0 ms |
256 KB |
Output is correct |
| 2 |
Correct |
0 ms |
256 KB |
Output is correct |
| 3 |
Correct |
0 ms |
256 KB |
Output is correct |
| 4 |
Correct |
1 ms |
256 KB |
Output is correct |
| 5 |
Correct |
1 ms |
256 KB |
Output is correct |
| 6 |
Correct |
37 ms |
384 KB |
Output is correct |
| 7 |
Correct |
1 ms |
256 KB |
Output is correct |
| 8 |
Correct |
1 ms |
384 KB |
Output is correct |
| 9 |
Correct |
1 ms |
384 KB |
Output is correct |
| 10 |
Incorrect |
1 ms |
256 KB |
Output isn't correct |
| 11 |
Correct |
1 ms |
384 KB |
Output is correct |
| 12 |
Correct |
1 ms |
384 KB |
Output is correct |
| 13 |
Correct |
1 ms |
384 KB |
Output is correct |
| 14 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 15 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
| 16 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 17 |
Incorrect |
2 ms |
384 KB |
Output isn't correct |
| 18 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 19 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
| 20 |
Incorrect |
3 ms |
384 KB |
Output isn't correct |
