Submission #59818

#	Time	Username	Problem	Language	Result	Execution time	Memory
59818		WA_TLE	Holiday (IOI14_holiday)	C++14	7 / 100	351 ms	17960 KiB

holiday

#include<deque>
#include<queue>
#include<vector>
#include<algorithm>
#include<iostream>
#include<set>
#include<cmath>
#include<tuple>
#include<string>
//#include<chrono>
#include<functional>
#include<iterator>
#include<random>
#include<unordered_set>
#include<array>
#include<map>
#include<iomanip>
#include<assert.h>
#include<bitset>
#include<stack>
using namespace std;
typedef long long int llint;
typedef long double lldo;
#define mp make_pair
#define mt make_tuple
#define pub push_back
#define puf push_front
#define pob pop_back
#define pof pop_front
#define fir first
#define sec second
#define res resize
#define ins insert
#define era erase
/*
cout<<setprecision(20)
cin.tie(0);
ios::sync_with_stdio(false);
*/
const llint mod=1e9+7;
const llint big=2.19e15+1;
const long double pai=3.141592653589793238462643383279502884197;
const long double eps=1e-15;
template <class T,class U>void mineq(T& a,U b){if(a>b){a=b;}}
template <class T,class U>void maxeq(T& a,U b){if(a<b){a=b;}}
llint gcd(llint a,llint b){if(a%b==0){return b;}else return gcd(b,a%b);}
//llint lcm(llint a,llint b){return a/gcd(a,b)*b;}
template<class T> void SO(T& ve){sort(ve.begin(),ve.end());}
template<class T> void REV(T& ve){reverse(ve.begin(),ve.end());}
template<class T>llint LBI(vector<T>&ar,T in){return lower_bound(ar.begin(),ar.end(),in)-ar.begin();}
template<class T>llint UBI(vector<T>&ar,T in){return upper_bound(ar.begin(),ar.end(),in)-ar.begin();}
/*
ioi2014 day2 hoilday
拡張　convex full trick
凸関数とそうでない関数のマージを行う
*/
#include"holiday.h"
vector<llint>pot;//spot,point
pair<vector<llint>,vector<llint>>gusolve(int sta,int owa){
	//solveのstaからowaまでのマージを行う
	//愚直～ O(n^2)～
	//.firに求めるもの、.secにマージソートで高速化?
	vector<llint>ans((owa-sta)*2);
	vector<llint>gen;gen.reserve(owa-sta);
	int i,j;
	for(i=0;i<owa-sta;i++){
		llint t=pot[i+sta];
		int bas=gen.size();
		gen.pub(t);
		while(0<bas&&gen[bas-1]<gen[bas]){
			swap(gen[bas-1],gen[bas]);
			bas--;
		}
		llint now=0;
		for(j=0;j<gen.size();j++){
			now+=gen[j];
			maxeq(ans[i+j+1],now);
		}
	}
	return move(mp(move(ans),move(gen)));
}
pair<vector<llint>,vector<llint>>solve(int sta,int owa){
	if(sta+10>=owa){return gusolve(sta,owa);}
	int mid=(sta+owa)/2,i,j;
	auto zehan=solve(sta,mid);
	vector<llint>ans((owa-sta)*2);
	for(i=0;i<zehan.fir.size();i++){ans[i]=zehan.fir[i];}
	//O(nlogn)をさらに分割統治
	auto kohan=solve(mid,owa);
	//zeha.secとkohan.firを拡張convex full trick !!!
	vector<llint>wa(mid-sta+1+5);
	for(i=0;i<mid-sta;i++){wa[i+1]=wa[i]+zehan.sec[i];}
	for(i=mid-sta;i<mid-sta+5;i++){wa[i+1]=wa[i];}
	//cerr<<"debag wa\n";
	//for(auto it:wa){cerr<<it<<" ";}cerr<<endl;
	vector<pair<int,int>>conb;
	//conbのback.secは適当でいい
	auto&ato=kohan.fir;//短く
	for(i=0;i<ato.size();i++){
		if(0<i&&ato[i-1]==ato[i]){continue;}
		while(conb.size()>=2){
			int day=conb[conb.size()-2].sec;
			int od=conb.back().fir;//old
			int nd=i;//new
			if(day<nd){break;}
			if(wa[day-od]+ato[od]<=wa[day-nd]+ato[nd]){conb.pob();}
			else{break;}
		}
		if(conb.size()>=1){
			//ここで二分探索!
			int bmin=i-1;
			int bmax=i+wa.size()-2;
			//等しいときはできるだけ大きく
			//bminが答え
			int od=conb.back().fir;//old
			int nd=i;//new
			while(bmin+1<bmax){
				int bgen=(1+bmin+bmax)/2;
				if(wa[bgen-od]+ato[od]<wa[bgen-nd]+ato[nd]){bmax=bgen;}
				else{bmin=bgen;}
			}
			conb.back().sec=bmax;
		}
		conb.pub(mp(i,-1));
		//cerr<<"i="<<i<<"ato="<<ato[i]<<endl;
		//for(auto it:conb){cerr<<it.fir<<':'<<it.sec<<"  ";}
		//cerr<<endl;
	}
	conb.back().sec=mod;
	int bas=0;
	for(i=0;i<ans.size()-mid+sta;i++){
		while(conb[bas].sec<=i){bas++;}
		maxeq(ans[i+mid-sta],wa[i-conb[bas].fir]+ato[conb[bas].fir]);
	}
	vector<llint>gen;
	merge(zehan.sec.begin(),zehan.sec.end(),kohan.sec.begin(),kohan.sec.end(),back_inserter(gen),greater<llint>());
	return move(mp(move(ans),move(gen)));
}
llint findMaxAttraction(int n,int start,int d,int attraction[]){
	//初めに左に行く場合と右に行く場合を計算
	llint ans=0;
	pot.resize(n+n);
	llint i;
	for(i=0;i<=start;i++){pot[i]=attraction[start-i];}
	vector<llint>hahi=solve(0,start+1).fir;
	for(i=0;i<n+n;i++){pot[i]=0;}
	for(i=1;i<n-start;i++){pot[2*i]=attraction[i+start];}
	vector<llint>mdmg=solve(0,(n-start)*2).fir;
	for(i=0;i<n+n;i++){pot[i]=0;}
	for(i=0;i<=d;i++){
		llint ge=hahi[min((llint)hahi.size()-1,i)]+mdmg[min((llint)mdmg.size()-1,d-i)];
		maxeq(ans,ge);
	}
	
	for(i=1;i<=start;i++){pot[2*i]=attraction[start-i];}
	vector<llint>mdhi=solve(0,(start+1)*2).fir;
	for(i=0;i<n+n;i++){pot[i]=0;}
	for(i=0;i<n-start;i++){pot[i]=attraction[i+start];}
	//cerr<<"kokokara"<<endl;
	vector<llint>hamg=solve(0,(n-start)).fir;
	for(i=0;i<n+n;i++){pot[i]=0;}
	for(i=0;i<=d;i++){
		llint ge=mdhi[min((llint)mdhi.size()-1,i)]+hamg[min((llint)hamg.size()-1,d-i)];
		maxeq(ans,ge);
	}
	return ans;
}

Compilation message (stderr)

holiday.cpp: In function 'std::pair<std::vector<long long int>, std::vector<long long int> > gusolve(int, int)':
holiday.cpp:75:12: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
   for(j=0;j<gen.size();j++){
           ~^~~~~~~~~~~
holiday.cpp: In function 'std::pair<std::vector<long long int>, std::vector<long long int> > solve(int, int)':
holiday.cpp:87:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<zehan.fir.size();i++){ans[i]=zehan.fir[i];}
          ~^~~~~~~~~~~~~~~~~
holiday.cpp:99:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<ato.size();i++){
          ~^~~~~~~~~~~
holiday.cpp:131:11: warning: comparison between signed and unsigned integer expressions [-Wsign-compare]
  for(i=0;i<ans.size()-mid+sta;i++){
          ~^~~~~~~~~~~~~~~~~~~
holiday.cpp:84:24: warning: unused variable 'j' [-Wunused-variable]
  int mid=(sta+owa)/2,i,j;
                        ^
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: 7 / 7
• Subtask 2: 0 / 23
• Subtask 3: 0 / 17
• Subtask 4: 0 / 53