제출 #56336

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
56336		WA_TLE	선물상자 (IOI15_boxes)	C++14	10 / 100	2 ms	376 KiB

boxes

#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();}
//円環にそってやるだけ　
#include<boxes.h>
#define pos positions
llint delivery(int N,int K,int L,int positions[]){
	vector<llint>wa(N+1);
	vector<llint>ga(N+1);
	int i;
	for(i=0;i<N-1;i++){if(pos[i]>pos[i+1]){assert(false);}}
	for(i=1;i<=K;i++){wa[i]=pos[i-1];}
	for(i=K+1;i<=N;i++){wa[i]=wa[i-K]+pos[i-1];}
	for(i=1;i<=K;i++){ga[i]=L-pos[N-i];}
	for(i=K+1;i<=N;i++){ga[i]=ga[i-K]+L-pos[N-i];}
	llint ans=2e17;
	for(i=0;i<=N;i++){mineq(ans,wa[i]+ga[N-i]);}
	return ans*2;
}

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