oj.uz

답안 #441085

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
441085 2021-07-04T06:35:32 Z OttoTheDino Jump (BOI06_jump) C++17
15 / 100
 5 ms 972 KB 
#include <bits/stdc++.h>
using namespace std;

#define rep(i,s,e)                  for (int i = s; i <= e; ++i)
#define rrep(i,s,e)                 for (int i = s; i >= e; --i)
#define pb                          push_back
#define pf                          push_front
#define fi                          first
#define se                          second
#define all(a)                      a.begin(), a.end()
typedef long long ll;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<int> vi;
typedef vector<double> vd;
typedef vector<string> vs;
typedef vector<char> vc;
typedef vector<ll> vll;

void add (string &a, string &b) {
    bool carry = 0;
    int n = max(a.size(),b.size());
    a.resize(n,'0');
    rep (i,0,n-1) {
        int sum = a[i]+b[i]+carry-2*'0';
        carry = 0;
        if (sum>=10) {
            carry = 1;
            sum -= 10;
        }
        a[i] = char('0'+sum);
    }
    if (carry) a += '1';
}

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

    int n; cin >> n;
    int a[n][n];
    string dp[n][n];
    rep (i,0,n-1) {
        rep (j,0,n-1) {
            cin >> a[i][j];
            dp[i][j] = "0";
        }
    }
    dp[0][0] = "1";
    rep (i,0,n-1) {
        rep(j,0,n-1) {
            if (a[i][j]==0) continue;
            if (i+a[i][j]<n) add(dp[i+a[i][j]][j], dp[i][j]);
            if (j+a[i][j]<n) add(dp[i][j+a[i][j]], dp[i][j]);
        }
    }
    reverse(all(dp[n-1][n-1]));
    cout << dp[n-1][n-1] << "\n";

    return 0;
}

Subtask #1
15.0 / 100.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 204 KB Output is correct
2 Correct 1 ms 204 KB Output is correct
3 Incorrect 0 ms 204 KB Output isn't correct
4 Correct 0 ms 204 KB Output is correct
5 Incorrect 1 ms 204 KB Output isn't correct
6 Incorrect 1 ms 204 KB Output isn't correct
7 Incorrect 1 ms 204 KB Output isn't correct
8 Incorrect 1 ms 332 KB Output isn't correct
9 Incorrect 1 ms 332 KB Output isn't correct
10 Incorrect 1 ms 204 KB Output isn't correct
11 Incorrect 1 ms 332 KB Output isn't correct
12 Incorrect 1 ms 332 KB Output isn't correct
13 Incorrect 1 ms 332 KB Output isn't correct
14 Incorrect 1 ms 332 KB Output isn't correct
15 Incorrect 2 ms 460 KB Output isn't correct
16 Incorrect 3 ms 716 KB Output isn't correct
17 Incorrect 3 ms 588 KB Output isn't correct
18 Incorrect 4 ms 844 KB Output isn't correct
19 Incorrect 3 ms 716 KB Output isn't correct
20 Incorrect 5 ms 972 KB Output isn't correct