제출 #420181

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
420181		ismoilov	선물상자 (IOI15_boxes)	C++14	20 / 100	1 ms	204 KiB

boxes

#include "boxes.h"
#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define IOS ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
#define all(x) (x).begin(), (x).end()
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fpp(a,i,c) for(int (a) = (i); (a) <= (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) > (c); (a)--)
#define fmm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)

ll delivery(int n, int k, int L, int p[]) {
	vector <ll> a, b;
	ll ans = 0, l = L;
	fp(i,0,n){
		if(p[i] <= l-p[i])
			a.push_back(p[i]*2);
		else
			b.push_back((l-p[i])*2);
	}
	sort(all(a));
	sort(all(b));
	ll aa = 0, bb = 0;
	if(a.size() % k != 0)
		aa = a[a.size()-1];
	if(b.size() % k != 0)
		bb = b[b.size()-1];
	if(l >= aa + bb){
		int	x = k-1;
		while(x < a.size())
			ans += a[x], x += k;
		x = k-1;
		while(x < b.size())
			ans += b[x], x += k;
		if(a.size() % k > 0)
			ans += a[a.size()-1];
		if(b.size() % k > 0)
			ans += b[b.size()-1];
		return ans;
	}
	else{
		fp(i,0,k){
			if(a.empty()){
				if(!b.empty())
					b.pop_back();
				continue;
			}
			if(b.empty()){
				if(!a.empty())
					a.pop_back();
				continue;
			}
			if(a.back() > b.back())
				a.pop_back();
			else
				b.pop_back();
		}
		int	x = k-1;
		while(x < a.size())
			ans += a[x], x += k;
		x = k-1;
		while(x < b.size())
			ans += b[x], x += k;
		if(a.size() % k > 0)
			ans += a[a.size()-1];
		if(b.size() % k > 0)
			ans += b[b.size()-1];
		return ans+l;
	}
}

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

boxes.cpp: In function 'll delivery(int, int, int, int*)':
boxes.cpp:7:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
      |                           ^
boxes.cpp:15:2: note: in expansion of macro 'fp'
   15 |  fp(i,0,n){
      |  ^~
boxes.cpp:30:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   30 |   while(x < a.size())
      |         ~~^~~~~~~~~~
boxes.cpp:33:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   33 |   while(x < b.size())
      |         ~~^~~~~~~~~~
boxes.cpp:7:27: warning: unnecessary parentheses in declaration of 'i' [-Wparentheses]
    7 | #define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
      |                           ^
boxes.cpp:42:3: note: in expansion of macro 'fp'
   42 |   fp(i,0,k){
      |   ^~
boxes.cpp:59:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   59 |   while(x < a.size())
      |         ~~^~~~~~~~~~
boxes.cpp:62:11: warning: comparison of integer expressions of different signedness: 'int' and 'std::vector<long long int>::size_type' {aka 'long unsigned int'} [-Wsign-compare]
   62 |   while(x < b.size())
      |         ~~^~~~~~~~~~

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