# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
531158 | sidon | Jump (BOI06_jump) | C++17 | 5 ms | 972 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;
void add(string &x, const string &y) {
int cur = 0, j = size(y);
for(int i = 0; i < j || cur; ++i) {
if(i < j) cur += y[i] - '0';
if(int(size(x)) == i) x.push_back('0');
cur += x[i] - '0';
x[i] = (cur % 10) + '0';
cur /= 10;
}
}
int main() {
ios::sync_with_stdio(0), cin.tie(0);
int n; cin >> n;
int a[n][n];
string b[n][n];
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
cin >> a[i][j];
b[i][j] = "0";
}
}
b[0][0] = "1";
for(int i = 0; i < n; ++i) {
for(int j = 0; j < n; ++j) {
if(i == n-1 && j == n-1) cout << string(b[i][j]);
if(i + a[i][j] < n) add(b[i + a[i][j]][j], b[i][j]);
if(j + a[i][j] < n) add(b[i][j + a[i][j]], b[i][j]);
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |