제출 #782459

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

boxes

#include<bits/stdc++.h>
using namespace std;
#define pii pair<int,int>
#define pb push_back
#define rep(i,n) for(int i=0;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
int read(){int x;scanf("%d",&x);return x;}
void print(int x){printf("%d\n",x);}
const int mod=1000000007;
long long delivery(int n,int k,int L,int p[])
{
	multiset<pair<long long,long long>> ldis,rdis,all;
	long long l=L;
	rep(i,n)
	{
		if(p[i]<=l-p[i])
		{
			ldis.insert({p[i],0});all.insert({p[i],0});
		}
		else
		{
			rdis.insert({l-p[i],1});all.insert({l-p[i],1});
		}
	}
	long long res=0;
	while(!all.empty())
	{
		if((int)all.size()<=k)
		{
			long long ld=0,rd=0;
			for(auto v:all)
			{
				if(v.second==0){ld=max(ld,v.first);}
				else{rd=max(rd,v.first);}
			}
			res+=min(2*(ld+rd),l);all.clear();
		}
		else
		{
			pair<long long,long long> v=*(--all.end());
			all.erase(--all.end());
			long long ld=0,rd=0;
			if(v.second==0){ld=max(ld,v.first);ldis.erase(v);}
			else{rd=max(rd,v.first);rdis.erase(v);}
			int sz=k-1;
			if(v.second==0)
			{
				if(!rdis.empty())
				{
					sz--;rd=max(rd,(*(--rdis.end())).first);
					v=*(--rdis.end());
					all.erase(v);
					rdis.erase(--rdis.end());
				}
			}
			else
			{
				if(!ldis.empty())
				{
					sz--;ld=max(ld,(*(--ldis.end())).first);
					v=*(--ldis.end());
					all.erase(v);
					ldis.erase(--ldis.end());
				}
			}
			//cout<<sz<<" "<<ld<<" "<<rd<<endl;
			rep1(i,sz)
			{
				v=*(--all.end());
				all.erase(--all.end());
				if(v.second==0){ld=max(ld,v.first);ldis.erase(v);}
				else{rd=max(rd,v.first);rdis.erase(v);}
			}
			res+=min(2*(ld+rd),l);
		}
	}
	return res;
}

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

boxes.cpp: In function 'int read()':
boxes.cpp:7:23: warning: ignoring return value of 'int scanf(const char*, ...)' declared with attribute 'warn_unused_result' [-Wunused-result]
    7 | int read(){int x;scanf("%d",&x);return x;}
      |                  ~~~~~^~~~~~~~~

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