제출 #97503

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
97503		MvC	휴가 (IOI14_holiday)	C++11	17 / 100	52 ms	768 KiB

holiday

#pragma GCC optimize("O3")
#include "holiday.h"
#include<bits/stdc++.h>
#define rc(x) return cout<<x<<endl,0
#define pb push_back
#define in insert
#define er erase
#define fd find
#define fr first
#define sc second
typedef long long ll;
typedef long double ld;
const ll INF=0x3f3f3f3f3f3f3f3f;
const ll llinf=(1LL<<62);
const int inf=(1<<30);
const int nmax=1e5+50;
const int mod=1e9+7;
using namespace std;
ll f[nmax],rf[nmax],rg[nmax],g[nmax];
multiset<ll>st;
multiset<ll>::iterator it;
ll findMaxAttraction(int n,int s,int d,int a[])
{
	int i,v,j;
	ll sum,ans=0;
	if(n<=3000)
	{
		for(i=s;i>=0;i--)
		{
			st.in(a[i]);
			it=st.end();
			it--;
			sum=v=0;
			for(j=1;j+s-i<=d;j++)
			{
				if(!v)sum+=1LL*(*it);
				if(it!=st.begin())it--;
				else v=1;
				f[s-i+j]=max(f[s-i+j],sum);
				if(2*(s-i)+j<=d)g[2*(s-i)+j]=max(g[2*(s-i)+j],f[s-i+j]);
				if(v)break;
			}
		}
		st.clear();
		for(i=s+1;i<n;i++)
		{
			st.in(a[i]);
			it=st.end();
			it--;
			sum=v=0;
			for(j=1;j+i-s<=d;j++)
			{
				if(!v)sum+=1LL*(*it);
				if(it!=st.begin())it--;
				else v=1;
				rf[i-s+j]=max(rf[i-s+j],sum);
				if(2*(i-s)+j<=d)rg[2*(i-s)+j]=max(rg[2*(i-s)+j],rf[i-s+j]);
				if(v)break;
			}
		}
		for(i=0;i<=d;i++)ans=max(ans,max(f[i]+rg[d-i],g[i]+rf[d-i]));
	}
	return ans;
}
/*int main()
{
	//freopen("sol.in","r",stdin);
	//freopen("sol.out","w",stdout);
	ios_base::sync_with_stdio(false);cin.tie(0);cerr.tie(0);cout.tie(0);
	
    return 0;
}*/

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

grader.cpp: In function 'int main()':
grader.cpp:7:12: warning: variable 'n_s' set but not used [-Wunused-but-set-variable]
     int i, n_s;
            ^~~

• Subtask 1: 0 / 7
• Subtask 2: 0 / 23
• Subtask 3: 17 / 17
• Subtask 4: 0 / 53