제출 #296880

#제출 시각아이디문제언어결과실행 시간메모리
296880Hemimor선물상자 (IOI15_boxes)C++14
0 / 100
3 ms640 KiB
#include "boxes.h" #include <algorithm> #include <iostream> #include <iomanip> #include <numeric> #include <cassert> #include <vector> #include <cmath> #include <queue> #include <set> #include <map> #define syosu(x) fixed<<setprecision(x) using namespace std; typedef long long ll; typedef unsigned int uint; typedef unsigned long long ull; typedef pair<int,int> P; typedef pair<double,double> pdd; typedef pair<ll,ll> pll; typedef vector<int> vi; typedef vector<vi> vvi; typedef vector<double> vd; typedef vector<vd> vvd; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<string> vs; typedef vector<P> vp; typedef vector<vp> vvp; typedef vector<pll> vpll; typedef pair<P,int> pip; typedef vector<pip> vip; const int inf=1<<30; const ll INF=1ll<<60; const double pi=acos(-1); const double eps=1e-8; const ll mod=1e9+7; const int dx[4]={-1,0,1,0},dy[4]={0,-1,0,1}; ll delivery(int N, int K, int L, int p[]) { vl c; sort(p,p+N); for(int i=0;i<N;i++) if(p[i]) c.push_back(p[i]); N=(int)c.size(); vl a(N+1),b(N+1); for(int i=0;i<N;i++) a[i+1]=(i+1-K>=0?a[i+1-K]:0)+c[i]; for(int i=N-1;i>=0;i--) b[N-i]=(N-i-K>=0?b[N-i-K]:0)+L-c[i]; ll res=INF; vl d(K,INF); /* auto f=[&](ll i,ll j){ return a[i]*2+b[j]*2+(ll)(N-i-j+K-1)/K*L; };*/ ll tmp=INF; for(int i=0;i<=N;i++){ d[i]=min(d[i]+K,a[i]*2); tmp=min(tmp,d[i]); res=min(res,b[N-i]*2+tmp); } /* for(int i=1;i<=N;i++) res=min({res,f(i,0),f(0,i)}); for(int i=1;i<N;i++){ for(int j=0;j*K<N-i;j++) res=min(res,f(i,N-i-j*K)); }*/ // cout<<res<<endl; return res; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...