oj.uz

답안 #877224

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
877224 2023-11-23T04:04:14 Z Regulus Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 4 ms 8284 KB 
#include <bits/stdc++.h>            // pA
#define IO ios::sync_with_stdio(false);cin.tie(0);
#define debug(x) cerr << #x << " = " << (x) << ' '
#define endl cerr << '\n'
#define all(v) (v).begin(), (v).end()
#define SZ(v) (ll)(v).size()
#define lowbit(x) (x)&-(x)
#define pb emplace_back
#define F first
#define S second
using namespace std;
using ll = long long;
using pll = pair<ll, ll>;

const int N = 1005;
const ll INF = 1e18;
ll a[N], b[N], dp[N][N];

int main(void)
{ IO
    ll n, i, m, j;

    cin >> n >> m;
    for (i=1; i <= n; ++i) cin >> a[i];
    for (i=1; i <= m; ++i) cin >> b[i];

    for (i=0; i <= n; ++i) for (j=0; j <= m; ++j) dp[i][j] = INF;
    dp[1][1] = 0;
    for (i=1; i <= n; ++i)
    {
        for (j=1; j <= m; ++j)
        {
            dp[i][j] = min({dp[i][j], dp[i-1][j]+b[j], dp[i][j-1] + a[i]});
            //cerr << dp[i][j] << ' ';
        } //endl;
    }

    cout << dp[n][m] << '\n';


    return 0;
}

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 8284 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 3 ms 8280 KB Output is correct
12 Correct 3 ms 8280 KB Output is correct
13 Correct 3 ms 8284 KB Output is correct
14 Correct 3 ms 8284 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8156 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Incorrect 1 ms 4700 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# 결과 실행 시간 메모리 Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 348 KB Output is correct
4 Correct 1 ms 2652 KB Output is correct
5 Correct 1 ms 4444 KB Output is correct
6 Correct 1 ms 4444 KB Output is correct
7 Correct 1 ms 2396 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 3 ms 8284 KB Output is correct
10 Correct 3 ms 8284 KB Output is correct
11 Correct 3 ms 8280 KB Output is correct
12 Correct 3 ms 8280 KB Output is correct
13 Correct 3 ms 8284 KB Output is correct
14 Correct 3 ms 8284 KB Output is correct
15 Correct 4 ms 8284 KB Output is correct
16 Correct 3 ms 8156 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 0 ms 460 KB Output is correct
19 Correct 0 ms 348 KB Output is correct
20 Correct 0 ms 348 KB Output is correct
21 Correct 0 ms 348 KB Output is correct
22 Correct 0 ms 348 KB Output is correct
23 Correct 0 ms 348 KB Output is correct
24 Correct 0 ms 348 KB Output is correct
25 Correct 0 ms 348 KB Output is correct
26 Correct 0 ms 348 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 344 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Incorrect 1 ms 4700 KB Output isn't correct
32 Halted 0 ms 0 KB -