제출 #1082223

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1082223		raphael_heuchl	선물상자 (IOI15_boxes)	C++14	10 / 100	1 ms	448 KiB

boxes

#include "boxes.h"
#include <vector>
#include <algorithm>
#include <map>
#include <iostream>
#define INF 1'000'000'000'000'000'000
#define MIN(a, b) ((a) < (b) ? (a) : (b))

long long delivery(int N, int K, int L, int p[])
{
    long long best = INF;
    for (int i = 0; i < K; ++i)
    {
        long long sum = 0;
        long long pos = i;
        sum += p[i] + MIN(p[i], L - p[i]);

        while (pos < N-1)
            sum += MIN(L - 2*p[pos+1], 0) + p[pos=MIN(pos+K, N-1)] + MIN(p[pos], L - p[pos]);
            
        best = MIN(best, sum);
    }

    return best;
}

컴파일 시 표준 에러 (stderr) 메시지

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:19:50: warning: operation on 'pos' may be undefined [-Wsequence-point]
   19 |             sum += MIN(L - 2*p[pos+1], 0) + p[pos=MIN(pos+K, N-1)] + MIN(p[pos], L - p[pos]);
      |                                                  ^
boxes.cpp:19:50: warning: operation on 'pos' may be undefined [-Wsequence-point]
boxes.cpp:19:50: warning: operation on 'pos' may be undefined [-Wsequence-point]
boxes.cpp:19:50: warning: operation on 'pos' may be undefined [-Wsequence-point]

• Subtask 1: 10 / 10
• Subtask 2: 0 / 10
• Subtask 3: 0 / 15
• Subtask 4: 0 / 15
• Subtask 5: 0 / 20
• Subtask 6: 0 / 30