Submission #204054

#	Time	Username	Problem	Language	Result	Execution time	Memory
204054		Segtree	Boxes with souvenirs (IOI15_boxes)	C++14	0 / 100	381 ms	470260 KiB

boxes

#include"boxes.h"
#include<iostream>
#include<algorithm>
#include<vector>
using namespace std;
typedef long long ll;
#define chmin(a,b) a=min(a,b)
#define chmax(a,b) a=max(a,b)
#define rep(i,n) for(int i=0;i<n;i++)
#define mod 1000000007
#define mad(a,b) a=(a+b)%mod
vector<ll> rua[10000010],rub[10000010];
ll delivery(int N,int K,int L,int P[]){
	rep(i,K){
		rua[i].push_back(0);
		rub[i].push_back(0);
	}
	rep(i,N){
		rua[i%K].push_back(rua[i%K].back()+P[i]*2);
		rub[i%K].push_back(rub[i%K].back()+(L-P[i])*2);
	}
	ll ans=1e17;
	for(int i=0;i+K-1<N;i++){
		ll res=L;
		//for(int j=i-1;j>=0;j-=K)res+=P[j]*2;
		int a=i-1;
		if(a>=0){
			res+=rua[a%K][a/K+1];
		}
		
		//for(int j=i+K;j<N;j+=K)res+=(L-P[j])*2;
		int b=i+K;
		if(b<N){
			res+=rub[b%K].back()-rub[b%K][b/K];
		}
		cerr<<i<<":"<<res<<endl;
		chmin(ans,res);
	}
	for(int i=0;i<=N;i++){
		ll res=0;
		//for(int j=i-1;j>=0;j-=K)res+=P[j]*2;
		int a=i-1;
		if(a>=0){
			res+=rua[a%K][a/K+1];
		}
		
		//for(int j=i;j<N;j+=K)res+=(L-P[j])*2;
		int b=i;
		if(b<N){
			res+=rub[b%K].back()-rub[b%K][b/K];
		}
		cerr<<i<<":"<<res<<endl;
		chmin(ans,res);
	}
	return ans;
}
/*
int main(){
	int n,k,l,p[110];
	cin>>n>>k>>l;
	rep(i,n){
		cin>>p[i];
	}
	cout<<delivery(n,k,l,p)<<endl;
}*/

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