# |
Submission time |
Handle |
Problem |
Language |
Result |
Execution time |
Memory |
316338 |
2020-10-25T23:15:08 Z |
sofapuden |
Jump (BOI06_jump) |
C++14 |
|
17 ms |
1280 KB |
#include <bits/stdc++.h>
using namespace std;
string add(string a, string b){
string ans;
reverse(a.begin(),a.end());
reverse(b.begin(),b.end());
while(a.size() < b.size()){
a+="0";
}
while(b.size() < a.size()){
b+="0";
}
int ex = 0;
for(int i = 0; i < (int)a.size(); ++i){
int cur = a[i]+b[i]+ex-'0'-'0';
ex = cur/10;
ans+=(char)((cur%10)+'0');
}
if(ex)ans += (char)('0'+ex);
return ans;
}
int main(){
int n; cin >> n;
vector<vector<int>> gr(n,vector<int>(n));
vector<vector<string>> dp(n,vector<string>(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]=add(dp[i][j],dp[i+gr[i][j]][j]);
if(gr[i][j] + j < n && gr[i][j] != 0)dp[i][j+gr[i][j]]=add(dp[i][j],dp[i][j+gr[i][j]]);
}
}
cout << dp[n-1][n-1] << "\n";
}
# |
Verdict |
Execution time |
Memory |
Grader output |
1 |
Correct |
1 ms |
256 KB |
Output is correct |
2 |
Correct |
0 ms |
256 KB |
Output is correct |
3 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
4 |
Correct |
1 ms |
384 KB |
Output is correct |
5 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
6 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
7 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
8 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
9 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
10 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
11 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
12 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
13 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
14 |
Incorrect |
1 ms |
384 KB |
Output isn't correct |
15 |
Incorrect |
4 ms |
512 KB |
Output isn't correct |
16 |
Incorrect |
10 ms |
896 KB |
Output isn't correct |
17 |
Incorrect |
8 ms |
768 KB |
Output isn't correct |
18 |
Incorrect |
13 ms |
1152 KB |
Output isn't correct |
19 |
Incorrect |
10 ms |
896 KB |
Output isn't correct |
20 |
Incorrect |
17 ms |
1280 KB |
Output isn't correct |