Submission #489743

#TimeUsernameProblemLanguageResultExecution timeMemory
489743JerryLiu06Jump (BOI06_jump)C++17
70 / 100
1 ms464 KiB
// https://oj.uz/problem/view/BOI06_jump #include <bits/stdc++.h> using namespace std; using ll = long long; using ld = long double; using db = double; using str = string; using pi = pair<int, int>; using pl = pair<ll, ll>; using pd = pair<db, db>; using vi = vector<int>; using vb = vector<bool>; using vl = vector<ll>; using vd = vector<db>; using vs = vector<str>; using vpi = vector<pi>; using vpl = vector<pl>; using vpd = vector<pd>; #define FASTIO ios_base::sync_with_stdio(false); cin.tie(0); #define mp make_pair #define f first #define s second #define sz(x) (int)(x).size() #define bg(x) begin(x) #define all(x) bg(x), end(x) #define sor(x) sort(all(x)) #define rsz resize #define ins insert #define ft front() #define bk back() #define pb push_back #define pf push_front #define lb lower_bound #define ub upper_bound #define FOR(i, a, b) for (int i = (a); i < (b); i++) #define F0R(i, a) FOR(i, 0, a) #define ROF(i, a, b) for (int i = (b) - 1; i >= (a); i--) #define R0F(i, a) ROF(i, 0, a) #define EACH(a, x) for (auto& a : x) ll cdiv(ll a, ll b) { return a / b + ((a ^ b) > 0 && a % b); } ll fdiv(ll a, ll b) { return a / b - ((a ^ b) < 0 && a % b); } template<class T> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } template<class T> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } template<class T> void remDup(vector<T>& v) { sor(v); v.erase(unique(all(v)), v.end()); } const int MOD = 1e9 + 7; const int MX = 110; const ll INF = 1e18; int N, A[MX][MX]; ll DP[MX][MX]; int main() { FASTIO; cin >> N; DP[0][0] = 1; F0R(i, N) { F0R(j, N) { cin >> A[i][j]; if (A[i][j] == 0) { continue; } if (i + A[i][j] <= N) { DP[i + A[i][j]][j] += DP[i][j]; } if (j + A[i][j] <= N) { DP[i][j + A[i][j]] += DP[i][j]; } } } cout << DP[N - 1][N - 1]; }
#Verdict Execution timeMemoryGrader output
Fetching results...