oj.uz

답안 #588789

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
588789 2022-07-04T04:56:19 Z 반딧불(#8402) Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 9 ms 8204 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;

int n, m;
ll a[100002], b[100002];
ll dist[1002][1002];

int main(){
    scanf("%d %d", &n, &m);
    for(int i=1; i<=n; i++) scanf("%lld", &a[i]);
    for(int i=1; i<=m; i++) scanf("%lld", &b[i]);
    for(int i=1; i<=n; i++) for(int j=1; j<=m; j++) dist[i][j] = 1e18;
    dist[1][1] = 0;
    for(int i=1; i<=n; i++){
        for(int j=1; j<=m; j++){
            dist[i][j+1] = min(dist[i][j+1], dist[i][j] + a[i]);
            dist[i+1][j] = min(dist[i+1][j], dist[i][j] + b[j]);
        }
    }
    printf("%lld", dist[n][m]);
}

Compilation message

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

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 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 7 ms 8148 KB Output is correct
10 Correct 7 ms 8148 KB Output is correct
11 Correct 7 ms 8148 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 8 ms 8200 KB Output is correct
14 Correct 7 ms 8148 KB Output is correct
15 Correct 8 ms 8200 KB Output is correct
16 Correct 8 ms 8148 KB Output is correct
17 Correct 9 ms 8204 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 340 KB Output is correct

Subtask #2
0 / 30.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 308 KB Output is correct
2 Correct 0 ms 308 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

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 0 ms 304 KB Output is correct
3 Correct 1 ms 316 KB Output is correct
4 Correct 1 ms 724 KB Output is correct
5 Correct 2 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 7 ms 8148 KB Output is correct
10 Correct 7 ms 8148 KB Output is correct
11 Correct 7 ms 8148 KB Output is correct
12 Correct 8 ms 8148 KB Output is correct
13 Correct 8 ms 8200 KB Output is correct
14 Correct 7 ms 8148 KB Output is correct
15 Correct 8 ms 8200 KB Output is correct
16 Correct 8 ms 8148 KB Output is correct
17 Correct 9 ms 8204 KB Output is correct
18 Correct 0 ms 340 KB Output is correct
19 Correct 1 ms 312 KB Output is correct
20 Correct 1 ms 340 KB Output is correct
21 Correct 0 ms 340 KB Output is correct
22 Correct 0 ms 340 KB Output is correct
23 Correct 1 ms 340 KB Output is correct
24 Correct 1 ms 340 KB Output is correct
25 Correct 1 ms 340 KB Output is correct
26 Correct 0 ms 340 KB Output is correct
27 Correct 1 ms 312 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 308 KB Output is correct
30 Correct 0 ms 308 KB Output is correct
31 Incorrect 3 ms 2644 KB Output isn't correct
32 Halted 0 ms 0 KB -