제출 #780201

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
780201		vjudge1	선물상자 (IOI15_boxes)	C++17	50 / 100	51 ms	4444 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
#define pb push_back
#define pii pair<long long, long long>
#define st first
#define nd second
#define sp " "
#define endl "\n"
#define ll long long

long long delivery(int N, int K, int L, int p[]) {
    int n = N, k = K, l = L;
    sort(p, p + n);

    ll curr = 0;
    for (int i = 0; i < n; i += k){
        int to =  min(n - 1, i + k - 1);
        if (p[to] <= L / 2){
            curr += 2 * p[to];
        }
        else if (p[i] >= L / 2){
            curr += 2 * (L - p[i]);
        }
        else curr += L;
    }

    ll ans = curr;
    curr = 0;
    int pos = 0;
    while(pos < n && p[pos] <= L / 2) pos++;

     for (int i = pos - 1; i >= 0; i -= k){
        int to =  max(0, i - k + 1);
        curr += 2 * min(p[i], L / 2); 
    }

    for (int i = pos; i < n; i += k){
        int to =  min(n - 1, i + k - 1);
        curr += 2 * (L - p[i]);
    }
    ans = min(ans, curr);

    curr = 0;
    pos = 0;
    while(pos < n && p[pos] < L / 2) pos++;

     for (int i = pos - 1; i >= 0; i -= k){
        int to =  max(0, i - k + 1);
        curr += 2 * min(p[i], L / 2); 
    }

    for (int i = pos; i < n; i += k){
        int to =  min(n - 1, i + k - 1);
        curr += 2 * (L - p[i]);
    }
    ans = min(ans, curr);
    
    curr = 0;
    reverse(p, p + n);

    for (int i = 0; i < n; i += k){
        int to =  min(n - 1, i + k - 1);
        if (p[i] <= L / 2){
            curr += 2 * p[i];
        }
        else if (p[to] >= L / 2){
            curr += 2 * (L - p[to]);
        }
        else curr += L;
    }
    return min(ans, curr);
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:34:13: warning: unused variable 'to' [-Wunused-variable]
   34 |         int to =  max(0, i - k + 1);
      |             ^~
boxes.cpp:39:13: warning: unused variable 'to' [-Wunused-variable]
   39 |         int to =  min(n - 1, i + k - 1);
      |             ^~
boxes.cpp:49:13: warning: unused variable 'to' [-Wunused-variable]
   49 |         int to =  max(0, i - k + 1);
      |             ^~
boxes.cpp:54:13: warning: unused variable 'to' [-Wunused-variable]
   54 |         int to =  min(n - 1, i + k - 1);
      |             ^~
boxes.cpp:13:23: warning: unused variable 'l' [-Wunused-variable]
   13 |     int n = N, k = K, l = L;
      |                       ^

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