oj.uz

Submission #820995

# Submission time Handle Problem Language Result Execution time Memory
820995 2023-08-11T06:51:33 Z boris_mihov Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 9 ms 8240 KB 
#include <algorithm>
#include <iostream>
#include <numeric>
#include <cassert>
#include <vector>
#include <queue>
#include <stack>
#include <set>
#include <map>

typedef long long llong;
const int MAXN = 1000 + 10;
const llong INF = 1e18;
const int INTINF = 1e9;

int n, m;
int a[MAXN];
int b[MAXN];
llong dp[MAXN][MAXN];

void solve()
{
    dp[n][m] = 0;
    for (int i = n ; i >= 1 ; --i)
    {
        for (int j = m - (i == n) ; j >= 1 ; --j)
        {
            dp[i][j] = INF;
            if (j < m) dp[i][j] = std::min(dp[i][j], dp[i][j + 1] + a[i]);
            if (i < n) dp[i][j] = std::min(dp[i][j], dp[i + 1][j] + b[j]);;
        }
    }

    std::cout << dp[1][1] << '\n';
}

void input()
{
    std::cin >> n >> m;
    for (int i = 1 ; i <= n ; ++i)
    {
        std::cin >> a[i];
    }

    for (int i = 1 ; i <= m ; ++i)
    {
        std::cin >> b[i];
    }
}

void fastIOI()
{
    std::ios_base :: sync_with_stdio(0);
    std::cout.tie(nullptr);
    std::cin.tie(nullptr);
}

int main()
{
    fastIOI();
    input();
    solve();

    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 336 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 8180 KB Output is correct
10 Correct 7 ms 8220 KB Output is correct
11 Correct 8 ms 8148 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 9 ms 8240 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 8 ms 8156 KB Output is correct
16 Correct 8 ms 8220 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 328 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 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 3 ms 2772 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 340 KB Output is correct
2 Correct 0 ms 332 KB Output is correct
3 Correct 0 ms 336 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 8180 KB Output is correct
10 Correct 7 ms 8220 KB Output is correct
11 Correct 8 ms 8148 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 9 ms 8240 KB Output is correct
14 Correct 8 ms 8148 KB Output is correct
15 Correct 8 ms 8156 KB Output is correct
16 Correct 8 ms 8220 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 0 ms 340 KB Output is correct
20 Correct 0 ms 340 KB Output is correct
21 Correct 0 ms 332 KB Output is correct
22 Correct 0 ms 328 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 1 ms 340 KB Output is correct
28 Correct 0 ms 340 KB Output is correct
29 Correct 0 ms 340 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Incorrect 3 ms 2772 KB Output isn't correct
32 Halted 0 ms 0 KB -