oj.uz

Submission #489744

# Submission time Handle Problem Language Result Execution time Memory
489744 2021-11-24T06:47:22 Z JerryLiu06 Jump (BOI06_jump) C++17
100 / 100
 9 ms 1740 KB 
// 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;

struct BigInt {
    vi digits; // reverse digits for print
    
    BigInt() {
        digits = {0};
    }
    BigInt(vi _digits) {
        digits.rsz(sz(_digits));
        
        F0R(i, sz(digits)) {
            digits[i] = _digits[i];
        }
    }
    BigInt(ll x) {
        while (x > 0) {
            digits.pb(x % 10), x /= 10;
        }
    }
    BigInt& operator+=(const BigInt& b) {
        vi res; int carry = 0;

        F0R(i, max(sz(digits), sz(b.digits))) {
            int x = (i >= sz(digits) ? 0 : digits[i]);
            int y = (i >= sz(b.digits) ? 0 : b.digits[i]);

            res.pb((x + y + carry) % 10);
            carry = (x + y + carry >= 10);
        }
        if (carry) res.pb(1);
        
        *this = BigInt(res); return *this;
    }
    void print() {
        R0F(i, sz(digits)) {
            cout << digits[i]; 
        }
        cout << "\n";
    }
};

int N, A[MX][MX]; BigInt DP[MX][MX];

int main() {
    FASTIO;

    cin >> N;

    DP[0][0] = BigInt(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];
            }
        }
    }
    DP[N - 1][N - 1].print();
}

Subtask #1
100.0 / 100.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 972 KB Output is correct
2 Correct 1 ms 972 KB Output is correct
3 Correct 1 ms 972 KB Output is correct
4 Correct 1 ms 972 KB Output is correct
5 Correct 1 ms 972 KB Output is correct
6 Correct 1 ms 972 KB Output is correct
7 Correct 1 ms 1024 KB Output is correct
8 Correct 2 ms 972 KB Output is correct
9 Correct 1 ms 972 KB Output is correct
10 Correct 1 ms 972 KB Output is correct
11 Correct 2 ms 972 KB Output is correct
12 Correct 1 ms 972 KB Output is correct
13 Correct 1 ms 972 KB Output is correct
14 Correct 1 ms 972 KB Output is correct
15 Correct 3 ms 1100 KB Output is correct
16 Correct 5 ms 1356 KB Output is correct
17 Correct 5 ms 1280 KB Output is correct
18 Correct 8 ms 1556 KB Output is correct
19 Correct 7 ms 1392 KB Output is correct
20 Correct 9 ms 1740 KB Output is correct