# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
963202 | biank | K-th path (IZhO11_kthpath) | C++14 | 1 ms | 460 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;
const int MAX_N = 30;
using ll = long long;
ll dp[MAX_N][MAX_N][2];
char g[MAX_N][MAX_N];
ll ways(int n, int m, string &s) { //maneras de llegar de 0, 0 a n - 1, m - 1 con camino <= s
memset(dp, 0, sizeof dp);
dp[0][0][g[0][0] != s[0]] = 1;
for (int i = 0; i < n; i++) {
for (int j = 0; j < m; j++) {
if (i != 0) {
dp[i][j][1] += dp[i - 1][j][1];
if (g[i][j] <= s[i + j]) {
dp[i][j][g[i][j] != s[i + j]] += dp[i - 1][j][0];
}
}
if (j != 0) {
dp[i][j][1] += dp[i][j - 1][1];
if (g[i][j] <= s[i + j]) {
dp[i][j][g[i][j] != s[i + j]] += dp[i][j - 1][0];
}
}
}
}
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |