제출 #1218517

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1218517		LIA	선물상자 (IOI15_boxes)	C++17	10 / 100	0 ms	328 KiB

boxes

#include "boxes.h"
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef tuple <ll,ll,ll> plll;
typedef vector <plll> vplll;
typedef pair <ll,ll> pll;
typedef vector <ll> vll;
typedef vector <pll> vpll;
typedef vector <vector <pll>> vvpll;
typedef vector <vector <ll>> vvll;
typedef vector <bool> vb;
typedef vector <vector <bool>> vvb;
#define loop(i, s, e) for (ll i = (s); i < (e); ++i)
#define loopr(i, e, s) for (ll i = (e)-1; i >= (s); --i)
#define all(a) a.begin(), a.end()
const ll inf = 1e20;
ll n,k,l;
vll p;
vll r;
long long delivery(int N, int K, int L, int P[]) {
    n=N,k=K,l=L;
    p.resize(n);
    r.resize(n);
    loop(i,0,n) {
        p[i] = P[i];
        r[i] = l-P[i];
    }
    sort(all(p));
    sort(all(r));
    vll suml(n), sumr(n);

    for (ll i = 0; i < n; ++i) {
        suml[i] = 2LL * p[i];
        if (i >= k)
            suml[i] += suml[i - k];
    }

    for (ll i = 0; i < n; ++i) {
        sumr[i] = 2LL * r[i];
        if (i >= k)
            sumr[i] += sumr[i - k];
    }

    ll ans = inf;
    reverse(all(sumr));
    suml.push_back(0);
    sumr.push_back(0);
    loop(i,0,n) {
        ans = min(ans, suml[i] + sumr[i+1]);
    }
    ans = min(ans, sumr[0]);
    return ans;
}

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

boxes.cpp:17:16: warning: overflow in conversion from 'double' to 'll' {aka 'long long int'} changes value from '1.0e+20' to '9223372036854775807' [-Woverflow]
   17 | const ll inf = 1e20;
      |                ^~~~

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