# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
728548 |
2023-04-22T15:26:05 Z |
Karpin |
Jump (BOI06_jump) |
C++14 |
|
1 ms |
596 KB |
#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 |
1 |
Correct |
0 ms |
340 KB |
Output is correct |
2 |
Correct |
0 ms |
340 KB |
Output is correct |
3 |
Correct |
1 ms |
340 KB |
Output is correct |
4 |
Correct |
1 ms |
340 KB |
Output is correct |
5 |
Correct |
1 ms |
340 KB |
Output is correct |
6 |
Correct |
1 ms |
340 KB |
Output is correct |
7 |
Correct |
1 ms |
340 KB |
Output is correct |
8 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
11 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
12 |
Incorrect |
0 ms |
340 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
340 KB |
Output isn't correct |
15 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
16 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
17 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
18 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
19 |
Incorrect |
1 ms |
468 KB |
Output isn't correct |
20 |
Incorrect |
1 ms |
596 KB |
Output isn't correct |