제출 #1061294

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1061294		codefox	선물상자 (IOI15_boxes)	C++14	100 / 100	452 ms	298176 KiB

boxes

#include<bits/stdc++.h>
#include "boxes.h"

using namespace std;

#define ll long long

ll delivery(int N,int K,int L,int positions[])
{
    deque<ll> first;
    deque<ll> second;
    for (int i = 0;i < N; i++)
    {
        if (positions[i]==0) continue;
        if (positions[i]<=L/2) first.push_back(positions[i]);
        else second.push_front(positions[i]);
    }
    vector<ll> best1(first.size());
    vector<ll> best2(second.size());
    for (int i = 0; i < first.size(); i++)
    {
        if (i >= K) best1[i] = best1[i-K]+ first[i]*2;
        else best1[i] = first[i]*2; 
    }
    for (int i = 0; i < second.size(); i++)
    {
        if (i>= K) best2[i] = best2[i-K]+ (L-second[i])*2;
        else best2[i] =(L-second[i])*2;
    }
    ll sol = 0;
    if (best1.size()) sol += best1.back();
    if (best2.size()) sol += best2.back();

   
    ll mn = 1e18;
    K = min(K, (int)best1.size()+(int)best2.size());
    for (int i = 0; i <=K; i++)
    {
        if ((int)best2.size()-K+i-1<-1) continue;
        if ((int)best1.size()-i-1<-1)  continue;
        ll aa = 0;
        ll bb = 0;
        if ((int)best1.size()-i-1>=0) aa =  best1[best1.size()-i-1];
        if ((int)best2.size()-K+i-1>=0) bb =  best2[best2.size()-K+i-1];
        mn = min(mn,aa+bb+L);
    }
    return min(mn, sol);
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:20:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   20 |     for (int i = 0; i < first.size(); i++)
      |                     ~~^~~~~~~~~~~~~~
boxes.cpp:25:23: warning: comparison of integer expressions of different signedness: 'int' and 'std::deque<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   25 |     for (int i = 0; i < second.size(); i++)
      |                     ~~^~~~~~~~~~~~~~~

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