Submission #994178

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
994178	2024-06-07T08:20:13 Z	vjudge1	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	492 ms	1048576 KB

kyoto

#include <bits/stdc++.h>
using namespace std;

int main(){
    ios::sync_with_stdio(0);
    cin.tie(0);
    int H, W;
    cin >> H >> W;
    vector <unsigned long long> A(H), B(W);
    for(auto &x : A){
        cin >> x;
    }
    for(auto &x : B){
        cin >> x;
    }
    unsigned long long dp[H][W] = {0};
    for(int i = 1; i < H; i++){
        dp[i][0] = B[0] * i;
    }
    for(int j = 1; j < W; j++){
        dp[0][j] = A[0] * j;
    }
    for(int i = 1; i < H; i++){
        for(int j = 1; j < W; j++){
            dp[i][j] = min(dp[i][j - 1] + A[i], dp[i - 1][j] + B[j]);
        }
    }
    cout << dp[H - 1][W - 1];
}

Subtask #1

10.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	348 KB	Output is correct
4	Correct	1 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	352 KB	Output is correct
8	Correct	0 ms	356 KB	Output is correct
9	Correct	5 ms	8284 KB	Output is correct
10	Correct	6 ms	8284 KB	Output is correct
11	Correct	5 ms	8288 KB	Output is correct
12	Correct	6 ms	8288 KB	Output is correct
13	Correct	5 ms	8148 KB	Output is correct
14	Correct	5 ms	8284 KB	Output is correct
15	Correct	8 ms	8312 KB	Output is correct
16	Correct	5 ms	8284 KB	Output is correct
17	Correct	5 ms	8284 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	452 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	352 KB	Output is correct
24	Correct	0 ms	344 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	348 KB	Output is correct

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	2 ms	3420 KB	Output is correct
4	Runtime error	492 ms	1048576 KB	Execution killed with signal 9
5	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	348 KB	Output is correct
4	Correct	1 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	352 KB	Output is correct
8	Correct	0 ms	356 KB	Output is correct
9	Correct	5 ms	8284 KB	Output is correct
10	Correct	6 ms	8284 KB	Output is correct
11	Correct	5 ms	8288 KB	Output is correct
12	Correct	6 ms	8288 KB	Output is correct
13	Correct	5 ms	8148 KB	Output is correct
14	Correct	5 ms	8284 KB	Output is correct
15	Correct	8 ms	8312 KB	Output is correct
16	Correct	5 ms	8284 KB	Output is correct
17	Correct	5 ms	8284 KB	Output is correct
18	Correct	0 ms	348 KB	Output is correct
19	Correct	0 ms	452 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	352 KB	Output is correct
24	Correct	0 ms	344 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	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	3420 KB	Output is correct
32	Runtime error	492 ms	1048576 KB	Execution killed with signal 9
33	Halted	0 ms	0 KB	-