Submission #572386

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
572386	2022-06-04T10:26:36 Z	InternetPerson10	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	8 ms	8164 KB

kyoto

#include <bits/stdc++.h>
typedef long long ll;

using namespace std;

ll ans[1001][1001];

ll BIG = 1e18 + 9;

int main() {
    ios::sync_with_stdio(false);
    cin.tie(0);
    int h, w;
    cin >> h >> w;
    vector<ll> a(h), b(w);
    for(int i = 0; i < h; i++) {
        cin >> a[i];
    }
    for(int i = 0; i < w; i++) {
        cin >> b[i];
    }
    for(int i = 0; i < h; i++) {
        for(int j = 0; j < w; j++) {
            if(max(i, j)) {
                if(i == 0) ans[i][j] = ans[i][j-1] + a[i];
                else if(j == 0) ans[i][j] = ans[i-1][j] + b[j];
                else ans[i][j] = min(ans[i][j-1] + a[i], ans[i-1][j] + b[j]);
            }
            else ans[i][j] = 0;
        }
    }
    cout << ans[h-1][w-1] << '\n';
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 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	324 KB	Output is correct
9	Correct	8 ms	8084 KB	Output is correct
10	Correct	7 ms	8164 KB	Output is correct
11	Correct	7 ms	8144 KB	Output is correct
12	Correct	7 ms	8148 KB	Output is correct
13	Correct	8 ms	8148 KB	Output is correct
14	Correct	7 ms	8128 KB	Output is correct
15	Correct	7 ms	8164 KB	Output is correct
16	Correct	7 ms	8148 KB	Output is correct
17	Correct	8 ms	8148 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	328 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	332 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	1 ms	212 KB	Output is correct
2	Correct	0 ms	340 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	0 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	324 KB	Output is correct
9	Correct	8 ms	8084 KB	Output is correct
10	Correct	7 ms	8164 KB	Output is correct
11	Correct	7 ms	8144 KB	Output is correct
12	Correct	7 ms	8148 KB	Output is correct
13	Correct	8 ms	8148 KB	Output is correct
14	Correct	7 ms	8128 KB	Output is correct
15	Correct	7 ms	8164 KB	Output is correct
16	Correct	7 ms	8148 KB	Output is correct
17	Correct	8 ms	8148 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	1 ms	212 KB	Output is correct
21	Correct	1 ms	328 KB	Output is correct
22	Correct	1 ms	336 KB	Output is correct
23	Correct	1 ms	328 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	332 KB	Output is correct
27	Correct	1 ms	340 KB	Output is correct
28	Correct	0 ms	340 KB	Output is correct
29	Correct	1 ms	212 KB	Output is correct
30	Correct	0 ms	340 KB	Output is correct
31	Incorrect	3 ms	2644 KB	Output isn't correct
32	Halted	0 ms	0 KB	-