oj.uz

Submission #1055500

# Submission time Handle Problem Language Result Execution time Memory
1055500 2024-08-12T20:14:50 Z j_vdd16 Sightseeing in Kyoto (JOI22_kyoto) C++17
0 / 100
 2000 ms 48052 KB 
#include <algorithm>
#include <bitset>
#include <cstdint>
#include <cstring>
#include <iostream>
#include <limits.h>
#include <math.h>
#include <map>
#include <numeric>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>

#define int long long
#define loop(X, N) for(int X = 0; X < (N); X++)
#define all(V) V.begin(), V.end()
#define rall(V) V.rbegin(), V.rend()

using namespace std;

typedef vector<int> vi;
typedef vector<vi> vvi;
typedef pair<int, int> ii;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<bool> vb;
typedef vector<vector<bool>> vvb;

typedef uint64_t u64;
typedef int64_t i64;

int h, w;
vi a, b;

int minIdx(const vi& arr, int l, int r) {
    int best = l;
    for (int i = l; i <= r; i++) {
        if (arr[i] < arr[best])
            best = i;
    }

    return best;
}

map<pair<ii, ii>, int> memoize;
int solve(int i1, int j1, int i2, int j2) {
    if (i1 == i2) {
        return (j2 - j1) * a[i1];
    }
    if (j1 == j2) {
        return (i2 - i1) * b[j1];
    }

    if (memoize.count({{i1, j1}, {i2, j2}}))
        return memoize[{{i1, j1}, {i2, j2}}];

    int bestI = minIdx(a, i1, i2);
    int bestJ = minIdx(b, j1, j2);

    int res;
    if (bestI == i1 && bestJ == j1) {
        int bestI2 = minIdx(a, i1 + 1, i2);
        int bestJ2 = minIdx(b, j1 + 1, j2);

        // if (a[bestI2] * (j2 - j1) + b[bestJ] * (i2 - i1) < a[bestI] * (j2 - j1) + b[bestJ2] * (i2 - i1))
        //     return solve(i1, j1, bestI2, bestJ) + solve(bestI2, bestJ, i2, j2);
        // else
        //     return solve(i1, j1, bestI, bestJ2) + solve(bestI, bestJ2, i2, j2);

        res = min(solve(i1, j1, bestI2, bestJ) + solve(bestI2, bestJ, i2, j2), solve(i1, j1, bestI, bestJ2) + solve(bestI, bestJ2, i2, j2));
    }
    else if (bestI == i2 && bestJ == j2) {
        int bestI2 = minIdx(a, i1, i2 - 1);
        int bestJ2 = minIdx(b, j1, j2 - 1);

        // if (a[bestI2] * (j2 - j1) + b[bestJ] * (i2 - i1) < a[bestI] * (j2 - j1) + b[bestJ2] * (i2 - i1))
        //     return solve(i1, j1, bestI2, bestJ) + solve(bestI2, bestJ, i2, j2);
        // else
        //     return solve(i1, j1, bestI, bestJ2) + solve(bestI, bestJ2, i2, j2);

        res = min(solve(i1, j1, bestI2, bestJ) + solve(bestI2, bestJ, i2, j2), solve(i1, j1, bestI, bestJ2) + solve(bestI, bestJ2, i2, j2));
    }
    else {
        res = solve(i1, j1, bestI, bestJ) + solve(bestI, bestJ, i2, j2);
    }

    memoize[{{i1, j1}, {i2, j2}}] = res;
    return res;
}

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

    cin >> h >> w;

    a = vi(h);
    b = vi(w);
    loop(i, h) cin >> a[i];
    loop(i, w) cin >> b[i];

    // vvi scores(h, vi(w));
    // loop(i, h) {
    //     scores[i][0] = i * b[0];
    // }
    // loop(i, w) {
    //     scores[0][i] = i * a[0];
    // }

    // for (int i = 1; i < h; i++) {
    //     for (int j = 1; j < w; j++) {
    //         scores[i][j] = min(scores[i - 1][j] + b[j], scores[i][j - 1] + a[i]);
    //     }
    // }
    //cout << scores[h - 1][w - 1] << endl;

    cout << solve(0, 0, h - 1, w - 1);

	return 0;
}

Subtask #1
0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 472 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 911 ms 28244 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1057 ms 35560 KB Output is correct
17 Execution timed out 2019 ms 48052 KB Time limit exceeded
18 Halted 0 ms 0 KB -

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 326 ms 14504 KB Output is correct
4 Correct 1686 ms 2960 KB Output is correct
5 Execution timed out 2066 ms 4180 KB Time limit exceeded
6 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct
2 Correct 0 ms 348 KB Output is correct
3 Correct 0 ms 344 KB Output is correct
4 Correct 1 ms 348 KB Output is correct
5 Correct 0 ms 344 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 456 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 0 ms 348 KB Output is correct
10 Correct 0 ms 472 KB Output is correct
11 Correct 3 ms 344 KB Output is correct
12 Correct 2 ms 344 KB Output is correct
13 Correct 911 ms 28244 KB Output is correct
14 Correct 2 ms 348 KB Output is correct
15 Correct 2 ms 348 KB Output is correct
16 Correct 1057 ms 35560 KB Output is correct
17 Execution timed out 2019 ms 48052 KB Time limit exceeded
18 Halted 0 ms 0 KB -