제출 #133075

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

boxes

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

#define ll long long
#define F first
#define S Second
#define pb push_back
#define pii pair<ll,ll>
#define mp make_pair

using namespace :: std;

const ll maxn=3e7+500;
const ll inf=1e17+900;

ll sagh(ll n,ll k){return (n/k)+(n%k!=0);}

ll dp[maxn];

long long delivery(int n, int k, int L, int p[]) {
    fill(dp,dp+maxn,inf);
    k=min(k,n);
    ll u=n%k;
    for(ll i=0;i<k;i++){
	vector<ll> l,r,vec;l.reserve(n/k+2);r.reserve(n/k+2);
	for(ll j=i+k-1;j<n;j+=k){
	    l.pb(p[j]);
	}
	ll ii=(u-i+k)%k;
	ll cnt=1;
	for(ll j=n-ii-k;j>=0;j-=k){
	    r.pb(L-p[j]);
	}
	ll ct=0;
	if(i)ct+=p[i-1];
	if(ii)ct+=(L-p[n-ii]);

	for(auto v:l)vec.pb(v);
	for(auto v:r)vec.pb(v);
	sort(vec.begin(),vec.end());
	ll pr=ct;
	for(ll j=0;j<vec.size();j++){
	    dp[j*k+i+ii]=min(dp[j*k+i+ii],pr);
	    pr+=vec[j];
	}
	dp[vec.size()*k+i+ii]=min(dp[vec.size()*k+i+ii],pr);
    }




    ll ans=sagh(n,k)*L;
    for(ll i=0;i*k<=n;i++){
	ans=min(ans,dp[n-i*k]*2+L*i);
    }
    return ans;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:42:14: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(ll j=0;j<vec.size();j++){
             ~^~~~~~~~~~~
boxes.cpp:30:5: warning: unused variable 'cnt' [-Wunused-variable]
  ll cnt=1;
     ^~~

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