제출 #125572

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

boxes

#include "boxes.h"
#include <bits/stdc++.h>
#define pb push_back
#define MP make_pair
#define F first
#define S second
#define MEM(i,j) memset(i,j,sizeof i)
#define ALL(v) v.begin(),v.end()
#define ET cout << "\n"
#define DB(a,s,e) {for(int i=s;i<e;++i) cout << a[i] << " ";ET;}
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

const ll INF=1e18;
vector<ll> lf,rg;
ll dp[2][10000005];

long long delivery(int N, int K, int L, int p[])
{
	int bound=L/2;
	ll ans=INF,lsz,rsz;
	lf.pb(0);
	for(int i=0;i<N;++i)
		if(p[i]<=bound) lf.pb(p[i]);
		else rg.pb(p[i]);
	rg.pb(L),reverse(ALL(rg));
	for(int i=0;i<rg.size();++i)
		rg[i]=L-rg[i];
	for(int i=0;i<lf.size();++i)
		if(i>=K) dp[0][i]=dp[0][i-K]+lf[i]*2;
		else dp[0][i]=lf[i]*2;
	for(int i=0;i<rg.size();++i)
		if(i>=K) dp[1][i]=dp[1][i-K]+rg[i]*2;
		else dp[1][i]=rg[i]*2;
	lsz=lf.size(),rsz=rg.size();
	for(int i=rsz-1;i>=0&&i>=rsz-K;--i)
	{
		ll tmp=INF,sum=0;
		for(ll j=0;lsz-j*K+rsz-i-2>=0;++j)
			if(rsz-i-1<=j*K)
				tmp=min(tmp,j*L+dp[0][lsz-j*K+rsz-i-2]);
		for(ll j=i;j>=0;j-=K,sum+=L)
			ans=min(ans,dp[1][i]+sum+tmp);
	}
	return ans;
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:29:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<rg.size();++i)
              ~^~~~~~~~~~
boxes.cpp:31:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<lf.size();++i)
              ~^~~~~~~~~~
boxes.cpp:34:15: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(int i=0;i<rg.size();++i)
              ~^~~~~~~~~~
boxes.cpp:38:15: warning: conversion to 'int' from 'll {aka long long int}' may alter its value [-Wconversion]
  for(int i=rsz-1;i>=0&&i>=rsz-K;--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