Submission #837363

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
837363	2023-08-25T09:56:56 Z	veehz	Sightseeing in Kyoto (JOI22_kyoto)	C++17	10 / 100	356 ms	1048576 KB

kyoto

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

typedef long long ll;
typedef long double ld;
#define pb push_back

const ll INF = 1e16;

int main() {
  int h, w;
  cin >> h >> w;
  vector<ll> a(h);
  for (int i = 0; i < h; i++) cin >> a[i];
  vector<ll> b(w);
  for (int i = 0; i < w; i++) cin >> b[i];

  vector<vector<ll>> ans(h, vector<ll>(w));
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < w; j++) {
      if (i == 0 && j == 0)
        ans[i][j] = 0;
      else {
        ans[i][j] = INF;
        if (i > 0) ans[i][j] = min(ans[i][j], ans[i - 1][j] + b[j]);
        if (j > 0) ans[i][j] = min(ans[i][j], ans[i][j - 1] + a[i]);
      }
    }
  }
  cout << ans[h - 1][w - 1] << endl;
}

Subtask #1

10.0 / 10.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	1 ms	300 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	724 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	7 ms	8120 KB	Output is correct
10	Correct	7 ms	8116 KB	Output is correct
11	Correct	7 ms	8208 KB	Output is correct
12	Correct	7 ms	8204 KB	Output is correct
13	Correct	8 ms	8148 KB	Output is correct
14	Correct	7 ms	8148 KB	Output is correct
15	Correct	7 ms	8116 KB	Output is correct
16	Correct	7 ms	8204 KB	Output is correct
17	Correct	7 ms	8144 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	304 KB	Output is correct
27	Correct	1 ms	296 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct

Subtask #2

0 / 30.0

#	Verdict	Execution time	Memory	Grader output
1	Correct	0 ms	212 KB	Output is correct
2	Correct	1 ms	212 KB	Output is correct
3	Correct	4 ms	3376 KB	Output is correct
4	Runtime error	356 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	1 ms	300 KB	Output is correct
2	Correct	0 ms	212 KB	Output is correct
3	Correct	1 ms	212 KB	Output is correct
4	Correct	1 ms	724 KB	Output is correct
5	Correct	1 ms	340 KB	Output is correct
6	Correct	1 ms	340 KB	Output is correct
7	Correct	1 ms	212 KB	Output is correct
8	Correct	0 ms	212 KB	Output is correct
9	Correct	7 ms	8120 KB	Output is correct
10	Correct	7 ms	8116 KB	Output is correct
11	Correct	7 ms	8208 KB	Output is correct
12	Correct	7 ms	8204 KB	Output is correct
13	Correct	8 ms	8148 KB	Output is correct
14	Correct	7 ms	8148 KB	Output is correct
15	Correct	7 ms	8116 KB	Output is correct
16	Correct	7 ms	8204 KB	Output is correct
17	Correct	7 ms	8144 KB	Output is correct
18	Correct	1 ms	212 KB	Output is correct
19	Correct	1 ms	212 KB	Output is correct
20	Correct	0 ms	212 KB	Output is correct
21	Correct	1 ms	212 KB	Output is correct
22	Correct	0 ms	212 KB	Output is correct
23	Correct	1 ms	212 KB	Output is correct
24	Correct	0 ms	212 KB	Output is correct
25	Correct	0 ms	212 KB	Output is correct
26	Correct	0 ms	304 KB	Output is correct
27	Correct	1 ms	296 KB	Output is correct
28	Correct	0 ms	212 KB	Output is correct
29	Correct	0 ms	212 KB	Output is correct
30	Correct	1 ms	212 KB	Output is correct
31	Correct	4 ms	3376 KB	Output is correct
32	Runtime error	356 ms	1048576 KB	Execution killed with signal 9
33	Halted	0 ms	0 KB	-