oj.uz

답안 #1055464

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
1055464 2024-08-12T19:46:30 Z j_vdd16 Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 335 ms 1048576 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;
}

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];
    }

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

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

        if (bestI2 == i2 && bestJ2 == j2) {
            return min((i2 - i1) * b[bestJ] + (j2 - j1) * a[bestI2], (i2 - i1) * b[bestJ2] + (j2 - j1) * a[bestI]);
        }

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

        if (bestI2 == i1 && bestJ2 == j1) {
            return min((i2 - i1) * b[bestJ] + (j2 - j1) * a[bestI2], (i2 - i1) * b[bestJ2] + (j2 - j1) * a[bestI]);
        }
        
        return solve(i1, j1, bestI2, bestJ2) + solve(bestI2, bestJ2, i2, j2);
        // return min(
        //     solve(i1, j1, i2 - 1, j2) + solve(i2 - 1, j2, i2, j2),
        //     solve(i1, j1, i2, j2 - 1) + solve(i2, j2 - 1, i2, j2)
        // );
    }
    else {
        return solve(i1, j1, bestI, bestJ) + solve(bestI, bestJ, i2, j2);
    }
}

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;

	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 0 ms 860 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 8284 KB Output is correct
10 Correct 4 ms 8284 KB Output is correct
11 Correct 5 ms 8336 KB Output is correct
12 Correct 4 ms 8204 KB Output is correct
13 Correct 4 ms 8284 KB Output is correct
14 Correct 3 ms 8284 KB Output is correct
15 Correct 4 ms 8144 KB Output is correct
16 Correct 4 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 352 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 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 Correct 2 ms 3536 KB Output is correct
4 Runtime error 335 ms 1048576 KB Execution killed with signal 9
5 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 0 ms 860 KB Output is correct
5 Correct 0 ms 348 KB Output is correct
6 Correct 0 ms 348 KB Output is correct
7 Correct 0 ms 348 KB Output is correct
8 Correct 0 ms 348 KB Output is correct
9 Correct 4 ms 8284 KB Output is correct
10 Correct 4 ms 8284 KB Output is correct
11 Correct 5 ms 8336 KB Output is correct
12 Correct 4 ms 8204 KB Output is correct
13 Correct 4 ms 8284 KB Output is correct
14 Correct 3 ms 8284 KB Output is correct
15 Correct 4 ms 8144 KB Output is correct
16 Correct 4 ms 8284 KB Output is correct
17 Correct 3 ms 8284 KB Output is correct
18 Correct 0 ms 348 KB Output is correct
19 Correct 1 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 352 KB Output is correct
27 Correct 0 ms 348 KB Output is correct
28 Correct 0 ms 348 KB Output is correct
29 Correct 0 ms 348 KB Output is correct
30 Correct 0 ms 348 KB Output is correct
31 Correct 2 ms 3536 KB Output is correct
32 Runtime error 335 ms 1048576 KB Execution killed with signal 9
33 Halted 0 ms 0 KB -