oj.uz

Submission #821075

# Submission time Handle Problem Language Result Execution time Memory
821075 2023-08-11T07:20:58 Z danikoynov Sightseeing in Kyoto (JOI22_kyoto) C++14
10 / 100
 8 ms 8228 KB 
#include<bits/stdc++.h>
#define endl '\n'

using namespace std;
typedef long long ll;

void speed()
{
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);
    cout.tie(NULL);
}
const int maxn = 1e3 + 10;
const ll inf = 1e18;
int h, w;
ll a[maxn], b[maxn], dp[maxn][maxn];
void solve()
{
    cin >> h >> w;
    for (int i = 1; i <= h; i ++)
        cin >> a[i];
    for (int i = 1; i <= w; i ++)
        cin >> b[i];

    for (int i = 1; i <= h; i ++)
    {
        for (int j = 1; j <= w; j ++)
        {
            if (i == 1 && j == 1)
                continue;
            dp[i][j] = inf;
            if (i != 1)
            dp[i][j] = min(dp[i - 1][j] + b[j], dp[i][j]);
            if (j != 1)
                dp[i][j] = min(dp[i][j - 1] + a[i], dp[i][j]);
        }
    }

    cout << dp[h][w] << endl;
}

int main()
{
    solve();
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 8 ms 8136 KB Output is correct
10 Correct 7 ms 8148 KB Output is correct
11 Correct 7 ms 8148 KB Output is correct
12 Correct 7 ms 8148 KB Output is correct
13 Correct 7 ms 8228 KB Output is correct
14 Correct 7 ms 8148 KB Output is correct
15 Correct 7 ms 8136 KB Output is correct
16 Correct 7 ms 8148 KB Output is correct
17 Correct 7 ms 8148 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 212 KB Output is correct
2 Correct 0 ms 212 KB Output is correct
3 Incorrect 3 ms 2644 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 340 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 1 ms 2260 KB Output is correct
6 Correct 1 ms 1620 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 0 ms 340 KB Output is correct
9 Correct 8 ms 8136 KB Output is correct
10 Correct 7 ms 8148 KB Output is correct
11 Correct 7 ms 8148 KB Output is correct
12 Correct 7 ms 8148 KB Output is correct
13 Correct 7 ms 8228 KB Output is correct
14 Correct 7 ms 8148 KB Output is correct
15 Correct 7 ms 8136 KB Output is correct
16 Correct 7 ms 8148 KB Output is correct
17 Correct 7 ms 8148 KB Output is correct
18 Correct 0 ms 212 KB Output is correct
19 Correct 0 ms 212 KB Output is correct
20 Correct 0 ms 212 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 212 KB Output is correct
23 Correct 0 ms 340 KB Output is correct
24 Correct 0 ms 340 KB Output is correct
25 Correct 0 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 0 ms 212 KB Output is correct
30 Correct 0 ms 212 KB Output is correct
31 Incorrect 3 ms 2644 KB Output isn't correct
32 Halted 0 ms 0 KB -