oj.uz

Submission #588810

# Submission time Handle Problem Language Result Execution time Memory
588810 2022-07-04T05:42:43 Z 박상훈(#8401) Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 10 ms 8240 KB 
#include <bits/stdc++.h>

typedef long long ll;
using namespace std;
const ll INF = 1e18;
int a[100100], b[100100];
ll dp[1010][1010];

int main(){
    int n, m;
    scanf("%d %d", &n, &m);
    for (int i=1;i<=n;i++) scanf("%d", a+i);
    for (int i=1;i<=m;i++) scanf("%d", b+i);

    for (int i=0;i<=n+1;i++) fill(dp[i], dp[i]+m+2, INF);
    dp[1][1] = 0;
    for (int i=1;i<=n;i++){
        for (int j=1;j<=m;j++){
            dp[i][j] = min(dp[i][j], min(dp[i-1][j] + b[j], dp[i][j-1] + a[i]));
        }
    }
    printf("%lld\n", dp[n][m]);
    return 0;
}

Compilation message

kyoto.cpp: In function 'int main()':
kyoto.cpp:11:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   11 |     scanf("%d %d", &n, &m);
      |     ~~~~~^~~~~~~~~~~~~~~~~
kyoto.cpp:12:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   12 |     for (int i=1;i<=n;i++) scanf("%d", a+i);
      |                            ~~~~~^~~~~~~~~~~
kyoto.cpp:13:33: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     for (int i=1;i<=m;i++) scanf("%d", b+i);
      |                            ~~~~~^~~~~~~~~~~

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 212 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 0 ms 340 KB Output is correct
9 Correct 8 ms 8172 KB Output is correct
10 Correct 9 ms 8236 KB Output is correct
11 Correct 10 ms 8236 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 8 ms 8148 KB Output is correct
14 Correct 9 ms 8240 KB Output is correct
15 Correct 9 ms 8148 KB Output is correct
16 Correct 9 ms 8228 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 264 KB Output is correct
23 Correct 0 ms 340 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 340 KB Output is correct
27 Correct 0 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 5 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 212 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 0 ms 340 KB Output is correct
9 Correct 8 ms 8172 KB Output is correct
10 Correct 9 ms 8236 KB Output is correct
11 Correct 10 ms 8236 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 8 ms 8148 KB Output is correct
14 Correct 9 ms 8240 KB Output is correct
15 Correct 9 ms 8148 KB Output is correct
16 Correct 9 ms 8228 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 264 KB Output is correct
23 Correct 0 ms 340 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 340 KB Output is correct
27 Correct 0 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 5 ms 2644 KB Output isn't correct
32 Halted 0 ms 0 KB -