oj.uz

답안 #553878

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
553878 2022-04-27T08:32:57 Z tht2005 Sightseeing in Kyoto (JOI22_kyoto) C++17
10 / 100
 16 ms 8188 KB 
#include <bits/stdc++.h>

using namespace std;

typedef long long LL;
const LL INF = numeric_limits<LL>::max();

const int N = 1003;
int w, h, a[N], b[N];
LL f[N][N];

int main() {
    scanf("%d %d", &w, &h);
    for(int i = 1; i <= w; ++i) {
        scanf("%d", a + i);
    }
    for(int i = 1; i <= h; ++i) {
        scanf("%d", b + i);
    }
    for(int i = 1; i <= w; ++i) {
        for(int j = 1; j <= h; ++j) {
            f[i][j] = INF;
        }
    }
    f[1][1] = 0;
    for(int i = 1; i <= w; ++i) {
        for(int j = 1; j <= h; ++j) {
            if(i != 1) f[i][j] = min(f[i][j], f[i - 1][j] + b[j]);
            if(j != 1) f[i][j] = min(f[i][j], f[i][j - 1] + a[i]);
        }
    }
    printf("%lld", f[w][h]);
    return 0;
}

Compilation message

kyoto.cpp: In function 'int main()':
kyoto.cpp:13:10: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   13 |     scanf("%d %d", &w, &h);
      |     ~~~~~^~~~~~~~~~~~~~~~~
kyoto.cpp:15:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   15 |         scanf("%d", a + i);
      |         ~~~~~^~~~~~~~~~~~~
kyoto.cpp:18:14: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
   18 |         scanf("%d", b + i);
      |         ~~~~~^~~~~~~~~~~~~

Subtask #1
10.0 / 10.0

# 결과 실행 시간 메모리 Grader output
1 Correct 1 ms 212 KB Output is correct
2 Correct 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 692 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 1080 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 8 ms 8184 KB Output is correct
10 Correct 9 ms 8148 KB Output is correct
11 Correct 8 ms 8148 KB Output is correct
12 Correct 15 ms 8140 KB Output is correct
13 Correct 16 ms 8188 KB Output is correct
14 Correct 7 ms 8128 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 8 ms 8148 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 0 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 1 ms 340 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 340 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 1 ms 340 KB Output is correct
3 Incorrect 3 ms 2744 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 1 ms 212 KB Output is correct
3 Correct 0 ms 212 KB Output is correct
4 Correct 1 ms 692 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 1080 KB Output is correct
8 Correct 1 ms 340 KB Output is correct
9 Correct 8 ms 8184 KB Output is correct
10 Correct 9 ms 8148 KB Output is correct
11 Correct 8 ms 8148 KB Output is correct
12 Correct 15 ms 8140 KB Output is correct
13 Correct 16 ms 8188 KB Output is correct
14 Correct 7 ms 8128 KB Output is correct
15 Correct 9 ms 8184 KB Output is correct
16 Correct 8 ms 8148 KB Output is correct
17 Correct 8 ms 8148 KB Output is correct
18 Correct 1 ms 212 KB Output is correct
19 Correct 1 ms 212 KB Output is correct
20 Correct 1 ms 212 KB Output is correct
21 Correct 2 ms 340 KB Output is correct
22 Correct 0 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 1 ms 340 KB Output is correct
26 Correct 1 ms 308 KB Output is correct
27 Correct 1 ms 340 KB Output is correct
28 Correct 1 ms 340 KB Output is correct
29 Correct 1 ms 308 KB Output is correct
30 Correct 1 ms 340 KB Output is correct
31 Incorrect 3 ms 2744 KB Output isn't correct
32 Halted 0 ms 0 KB -