제출 #768921

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
768921		caganyanmaz	선물상자 (IOI15_boxes)	C++17	15 / 100	1 ms	340 KiB

boxes

#include <bits/stdc++.h>
#define pb push_back
#define DEBUGGING
#define f first
#define s second
#define int int64_t
#ifdef DEBUGGING
#define debug(x) cout << (#x) << ": " << (x) << "\n";
#else
#define debug(x) 42
#endif
using namespace std;

constexpr static int MXSIZE = 1e7 + 2;
int left_dp[MXSIZE];
int right_dp[MXSIZE];
vector<int> left_val;
vector<int> right_val;
int mid = 0;

int delivery(int32_t N, int32_t K, int32_t L, int32_t p[])
{
	for (int i = 0; i < N; i++)
		if (p[i] < L / 2)
			left_val.pb(p[i]);
		else if (p[i] > L / 2)
			right_val.pb(-p[i]);
		else
			mid++;
	sort(left_val.begin(), left_val.end());
	sort(right_val.begin(),	right_val.end());
	for (int i = 1; i <= left_val.size(); i++)
	{
		if (i - K >= 0)
			left_dp[i] = left_dp[i-K];
		left_dp[i] += left_val[i-1] * 2; 
	}
	for (int i = 1; i <= right_val.size(); i++)
	{
		if (i - K >= 0)
			right_dp[i] = right_dp[i-K];
		right_dp[i] += (L + right_val[i-1]) * 2;
	}
	int res = left_dp[left_val.size()] + right_dp[right_val.size()] + (mid/K) * L;
	if (mid%K)
		res += L;
	for (int j = 1; j <= 3; j++)
	{
		int lo = K * j - (mid % K);
		for (int i = 0; i <= lo; i++)
			res = min(res, left_dp[left_val.size()-i] + right_dp[right_val.size()-lo+i] + ((mid+lo)/K) * L);
	}
	return res;
}

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

boxes.cpp: In function 'int64_t delivery(int32_t, int32_t, int32_t, int32_t*)':
boxes.cpp:32:20: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   32 |  for (int i = 1; i <= left_val.size(); i++)
      |                  ~~^~~~~~~~~~~~~~~~~~
boxes.cpp:38:20: warning: comparison of integer expressions of different signedness: 'int64_t' {aka 'long int'} and 'std::vector<long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   38 |  for (int i = 1; i <= right_val.size(); i++)
      |                  ~~^~~~~~~~~~~~~~~~~~~

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