# | Submission time | Handle | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
602592 | 2022-07-23T09:08:38 Z | CyberCow | Sightseeing in Kyoto (JOI22_kyoto) | C++17 | 9 ms | 8208 KB |
#include <iostream> #include <algorithm> #include <vector> #include <queue> #include <set> #include <string> #include <cmath> #include <map> #include <unordered_map> #include <unordered_set> #include <fstream> #include <iomanip> #include <iterator> #include <stack> #include <deque> using namespace std; using ll = long long; ll dp[1005][1005]; vector<ll> a, b; void solve() { ll n, i, j, x, y, h, w; cin >> h >> w; for ( i = 0; i < h; i++) { cin >> x; a.push_back(x); } for ( i = 0; i < w; i++) { cin >> x; b.push_back(x); } for ( i = 0; i < h; i++) { dp[i][0] = i * b[0]; } for ( i = 0; i < w; i++) { dp[0][i] = i * a[0]; } for ( i = 1; i < h; i++) { for ( j = 1; j < w; j++) { dp[i][j] = min(dp[i - 1][j] + b[j], dp[i][j - 1] + a[i]); } } cout << dp[h - 1][w - 1]; } int main() { ios_base::sync_with_stdio(false); cin.tie(0); int tt = 1; //cin >> tt; while (tt--) { solve(); } return 0; }
Compilation message
# | 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 | Correct | 0 ms | 340 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 | 1 ms | 340 KB | Output is correct |
9 | Correct | 9 ms | 8172 KB | Output is correct |
10 | Correct | 8 ms | 8148 KB | Output is correct |
11 | Correct | 8 ms | 8148 KB | Output is correct |
12 | Correct | 7 ms | 8208 KB | Output is correct |
13 | Correct | 7 ms | 8148 KB | Output is correct |
14 | Correct | 7 ms | 8188 KB | Output is correct |
15 | Correct | 7 ms | 8148 KB | Output is correct |
16 | Correct | 7 ms | 8148 KB | Output is correct |
17 | Correct | 8 ms | 8148 KB | Output is correct |
18 | Correct | 0 ms | 212 KB | Output is correct |
19 | Correct | 0 ms | 212 KB | Output is correct |
20 | Correct | 0 ms | 212 KB | Output is correct |
21 | Correct | 0 ms | 340 KB | Output is correct |
22 | Correct | 1 ms | 212 KB | Output is correct |
23 | Correct | 1 ms | 340 KB | Output is correct |
24 | Correct | 1 ms | 340 KB | Output is correct |
25 | Correct | 0 ms | 340 KB | Output is correct |
26 | Correct | 0 ms | 340 KB | Output is correct |
27 | Correct | 1 ms | 340 KB | Output is correct |
28 | Correct | 0 ms | 340 KB | Output is correct |
# | 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 | Incorrect | 3 ms | 2772 KB | Output isn't correct |
4 | Halted | 0 ms | 0 KB | - |
# | 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 | Correct | 0 ms | 340 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 | 1 ms | 340 KB | Output is correct |
9 | Correct | 9 ms | 8172 KB | Output is correct |
10 | Correct | 8 ms | 8148 KB | Output is correct |
11 | Correct | 8 ms | 8148 KB | Output is correct |
12 | Correct | 7 ms | 8208 KB | Output is correct |
13 | Correct | 7 ms | 8148 KB | Output is correct |
14 | Correct | 7 ms | 8188 KB | Output is correct |
15 | Correct | 7 ms | 8148 KB | Output is correct |
16 | Correct | 7 ms | 8148 KB | Output is correct |
17 | Correct | 8 ms | 8148 KB | Output is correct |
18 | Correct | 0 ms | 212 KB | Output is correct |
19 | Correct | 0 ms | 212 KB | Output is correct |
20 | Correct | 0 ms | 212 KB | Output is correct |
21 | Correct | 0 ms | 340 KB | Output is correct |
22 | Correct | 1 ms | 212 KB | Output is correct |
23 | Correct | 1 ms | 340 KB | Output is correct |
24 | Correct | 1 ms | 340 KB | Output is correct |
25 | Correct | 0 ms | 340 KB | Output is correct |
26 | Correct | 0 ms | 340 KB | Output is correct |
27 | Correct | 1 ms | 340 KB | Output is correct |
28 | Correct | 0 ms | 340 KB | Output is correct |
29 | Correct | 0 ms | 212 KB | Output is correct |
30 | Correct | 1 ms | 212 KB | Output is correct |
31 | Incorrect | 3 ms | 2772 KB | Output isn't correct |
32 | Halted | 0 ms | 0 KB | - |