제출 #1009974

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1009974		Ausp3x	선물상자 (IOI15_boxes)	C++17	100 / 100	605 ms	293796 KiB

boxes

// 人外有人，天外有天
// author: Ausp3x

#pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
typedef long long             lng;
typedef unsigned int          uint;
typedef unsigned long long    ulng;
using namespace std;
using namespace __gnu_pbds;

int const INF32 = 0x3f3f3f3f;
lng const INF64 = 0x3f3f3f3f3f3f3f3f;

lng delivery(int N, int K, int L, int positions[]) {
    sort(positions, positions + N);

    vector<lng> prf(N + 1, 0);
    for (int i = 1; i <= N; i++) {
        prf[i] = 2 * positions[i - 1];
        if (i - K >= 0)
            prf[i] += prf[i - K];
    }

    vector<lng> suf(N + 1, 0);
    for (int i = N - 1; i >= 0; i--) {
        suf[i] = 2 * (L - positions[i]);
        if (i + K <= N)
            suf[i] += suf[i + K];
    }

    lng ans = INF64;
    for (int i = 0; i <= N; i++) {
        ans = min(ans, prf[i] + suf[i]);
        if (i + K <= N)
            ans = min({ans, prf[i] + suf[i + K] + L, prf[i + K] + suf[i] + L});
    }

    return ans;
}

/*
int main() {
    ios_base::sync_with_stdio(false);
    cin.tie(NULL);

    int t = 1;
    cin >> t;
    while (t--) {
        int N, K, L;
        cin >> N >> K >> L;
        int positions[N];
        for (int i = 0; i < N; i++)
            cin >> positions[i];

        cout << delivery(N, K, L, positions) << endl;
    }

    return 0;
}
//*/

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

boxes.cpp:4:55: warning: bad option '-f O2' to pragma 'optimize' [-Wpragmas]
    4 | #pragma GCC optimize("O1, O2, O3, Ofast, unroll-loops")
      |                                                       ^
boxes.cpp:4:55: warning: bad option '-f O3' to pragma 'optimize' [-Wpragmas]
boxes.cpp:4:55: warning: bad option '-f Ofast' to pragma 'optimize' [-Wpragmas]
boxes.cpp:4:55: warning: bad option '-f unroll-loops' to pragma 'optimize' [-Wpragmas]
boxes.cpp:16:50: warning: bad option '-f O2' to attribute 'optimize' [-Wattributes]
   16 | lng delivery(int N, int K, int L, int positions[]) {
      |                                                  ^
boxes.cpp:16:50: warning: bad option '-f O3' to attribute 'optimize' [-Wattributes]
boxes.cpp:16:50: warning: bad option '-f Ofast' to attribute 'optimize' [-Wattributes]
boxes.cpp:16:50: warning: bad option '-f unroll-loops' to attribute 'optimize' [-Wattributes]

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