oj.uz

Submission #780899

# Submission time Handle Problem Language Result Execution time Memory
780899 2023-07-12T14:27:23 Z eltu0815 Sightseeing in Kyoto (JOI22_kyoto) C++14
10 / 100
 8 ms 8232 KB 
#include <bits/stdc++.h>
#define MAX 500005
#define MOD (ll)(1e9+7)
#define INF (ll)(1e18)
#define inf (1987654321)
 
using namespace std;    
typedef long long ll;
typedef pair<ll, ll> pll;
typedef pair<int, int> pii;
 
int n, m, q;
int a[100005], b[100005];
ll dp[1005][1005];
 
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(NULL);
    
    cin >> n >> m;
    for(int i = 1; i <= n; ++i) cin >> a[i];
    for(int i = 1; i <= m; ++i) cin >> b[i];
    for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) dp[i][j] = INF;
    
    dp[1][1] = 0;
    for(int i = 1; i <= n; ++i) for(int j = 1; j <= m; ++j) {
        dp[i][j + 1] = min(dp[i][j + 1], dp[i][j] + a[i]);
        dp[i + 1][j] = min(dp[i + 1][j], dp[i][j] + b[j]);
    }
    cout << dp[n][m];
    return 0;
}

Subtask #1
10.0 / 10.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Correct 1 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 1608 KB Output is correct
7 Correct 1 ms 1108 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 7 ms 8148 KB Output is correct
10 Correct 7 ms 8148 KB Output is correct
11 Correct 7 ms 8168 KB Output is correct
12 Correct 7 ms 8144 KB Output is correct
13 Correct 7 ms 8148 KB Output is correct
14 Correct 7 ms 8148 KB Output is correct
15 Correct 7 ms 8232 KB Output is correct
16 Correct 8 ms 8164 KB Output is correct
17 Correct 7 ms 8148 KB Output is correct
18 Correct 1 ms 332 KB Output is correct
19 Correct 1 ms 340 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 1 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 324 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 324 KB Output is correct
26 Correct 1 ms 328 KB Output is correct
27 Correct 0 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 30.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 340 KB Output is correct
2 Correct 1 ms 340 KB Output is correct
3 Incorrect 3 ms 2772 KB Output isn't correct
4 Halted 0 ms 0 KB -

Subtask #3
0 / 60.0

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