답안 #65561

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
65561 2018-08-08T03:23:30 Z daniel_02 선물상자 (IOI15_boxes) C++17
100 / 100
501 ms 196076 KB
    #include "boxes.h"
    #include <bits/stdc++.h>

    #define ll long long

    using namespace std;

    const int N = 1e7 + 3;

    ll dp[N], dp_suf[N];

    long long delivery(int N, int K, int L, int p[]) {

        long long ans, res = 0;

        ans = 1LL * 1e18 + 7;

        for (int i = 0; i < N; i++)
        {
            if (i < K)
            {
                dp[i] = p[i] + min(L - p[i], p[i]);
            }
            else
            {
                dp[i] = (p[i] + min(L - p[i], p[i])) + dp[i - K];
            }
        }

        for (int i = N - 1; i >= 0; i--)
        {
            if (N - i - 1 < K)
            {
                dp_suf[i] = (L - p[i]) + min(L - p[i], p[i]);
            }
            else
            {
                dp_suf[i] = ((L - p[i]) + min(L - p[i], p[i])) + dp_suf[i + K];
            }
        }

        for (int i = 0; i < N; i++){
                ans = min(ans, dp[i] + dp_suf[i + 1]);
        }

        for (int i = 0; i < N; i += K)
        {
            res += (L - p[i]) + min(p[i], L - p[i]);
        }

        ans = min(ans, res);

        return ans;

        return ans;
    }

Compilation message

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:12:52: warning: declaration of 'N' shadows a global declaration [-Wshadow]
     long long delivery(int N, int K, int L, int p[]) {
                                                    ^
boxes.cpp:8:15: note: shadowed declaration is here
     const int N = 1e7 + 3;
               ^
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 376 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 256 KB Output is correct
3 Correct 2 ms 256 KB Output is correct
4 Correct 2 ms 256 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 256 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 380 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 380 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 51 ms 19932 KB Output is correct
34 Correct 27 ms 19932 KB Output is correct
35 Correct 29 ms 19956 KB Output is correct
36 Correct 52 ms 19948 KB Output is correct
37 Correct 52 ms 19832 KB Output is correct
38 Correct 52 ms 19964 KB Output is correct
39 Correct 47 ms 19832 KB Output is correct
40 Correct 31 ms 19960 KB Output is correct
41 Correct 49 ms 20060 KB Output is correct
42 Correct 32 ms 19932 KB Output is correct
# 결과 실행 시간 메모리 Grader output
1 Correct 2 ms 256 KB Output is correct
2 Correct 2 ms 376 KB Output is correct
3 Correct 2 ms 376 KB Output is correct
4 Correct 2 ms 376 KB Output is correct
5 Correct 2 ms 376 KB Output is correct
6 Correct 2 ms 376 KB Output is correct
7 Correct 2 ms 376 KB Output is correct
8 Correct 2 ms 376 KB Output is correct
9 Correct 2 ms 376 KB Output is correct
10 Correct 2 ms 376 KB Output is correct
11 Correct 2 ms 376 KB Output is correct
12 Correct 2 ms 376 KB Output is correct
13 Correct 2 ms 376 KB Output is correct
14 Correct 2 ms 376 KB Output is correct
15 Correct 2 ms 256 KB Output is correct
16 Correct 2 ms 256 KB Output is correct
17 Correct 2 ms 256 KB Output is correct
18 Correct 2 ms 256 KB Output is correct
19 Correct 2 ms 376 KB Output is correct
20 Correct 2 ms 256 KB Output is correct
21 Correct 2 ms 376 KB Output is correct
22 Correct 2 ms 376 KB Output is correct
23 Correct 2 ms 380 KB Output is correct
24 Correct 2 ms 376 KB Output is correct
25 Correct 2 ms 376 KB Output is correct
26 Correct 2 ms 376 KB Output is correct
27 Correct 2 ms 348 KB Output is correct
28 Correct 2 ms 380 KB Output is correct
29 Correct 2 ms 348 KB Output is correct
30 Correct 2 ms 376 KB Output is correct
31 Correct 2 ms 376 KB Output is correct
32 Correct 2 ms 380 KB Output is correct
33 Correct 51 ms 19932 KB Output is correct
34 Correct 27 ms 19932 KB Output is correct
35 Correct 29 ms 19956 KB Output is correct
36 Correct 52 ms 19948 KB Output is correct
37 Correct 52 ms 19832 KB Output is correct
38 Correct 52 ms 19964 KB Output is correct
39 Correct 47 ms 19832 KB Output is correct
40 Correct 31 ms 19960 KB Output is correct
41 Correct 49 ms 20060 KB Output is correct
42 Correct 32 ms 19932 KB Output is correct
43 Correct 474 ms 195972 KB Output is correct
44 Correct 233 ms 196028 KB Output is correct
45 Correct 257 ms 196068 KB Output is correct
46 Correct 475 ms 196064 KB Output is correct
47 Correct 486 ms 196076 KB Output is correct
48 Correct 478 ms 196072 KB Output is correct
49 Correct 459 ms 196060 KB Output is correct
50 Correct 324 ms 195992 KB Output is correct
51 Correct 501 ms 196064 KB Output is correct
52 Correct 342 ms 195980 KB Output is correct