제출 #1270423

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1270423		steveonalex	Jump (BOI06_jump)	C++20	100 / 100	4 ms	1096 KiB

jump

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
typedef unsigned long long ull;
 
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
 
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
 
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ull mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
 
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
    double wow = (double) ((ull) rng()) / ((ull)(0-1));
    return wow * (r - l) + l;
}
 
template <class T1, class T2>
    bool maximize(T1 &a, T2 b){
        if (a < b) {a = b; return true;}
        return false;
    }
 
template <class T1, class T2>
    bool minimize(T1 &a, T2 b){
        if (a > b) {a = b; return true;}
        return false;
    }
 
template <class T>
    void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
        for(auto item: container) out << item << separator;
        out << finish;
    }
 
template <class T>
    void remove_dup(vector<T> &a){
        sort(ALL(a));
        a.resize(unique(ALL(a)) - a.begin());
    }

string add(string a, string b){
    if (a.size() < b.size()) swap(a, b);
    b = string(a.size() - b.size(), '0') + b;

    int carry = 0;
    for(int i = (int) a.size() - 1; i >= 0; --i) {
        a[i] += b[i] - '0' + carry;
        if (a[i] > '9') {
            a[i] -= 10;
            carry = 1;
        }
        else carry = 0;
    }

    if (carry) a = "1" + a;
    return a;
}

void solve(){
    int n; cin >> n;
    int a[n][n];
    for(int i = 0; i < n; ++i) for(int j = 0; j < n; ++j) cin >> a[i][j];

    string dp[n][n];
    for(int i = 0; i < n; ++i) for(int j = 0; j < n; ++j) dp[i][j] = "0";
    dp[0][0] = "1";

    for(int i = 0; i < n; ++i) for(int j = 0; j < n; ++j){
        if (a[i][j] == 0) continue;
        if (i + a[i][j] < n) dp[i+a[i][j]][j] = add(dp[i+a[i][j]][j], dp[i][j]);
        if (j + a[i][j] < n) dp[i][j+a[i][j]] = add(dp[i][j+a[i][j]], dp[i][j]);
    }

    cout << dp[n-1][n-1] << "\n";
}

int main(void){
    ios::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    clock_t cock = clock();

    solve();

    cerr << "Time elapsed: " << clock() - cock << "ms!\n";
    return 0;
}

• Subtask 1: 100 / 100