제출 #521640

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
521640		NicolaAbusaad2014	선물상자 (IOI15_boxes)	C++14	0 / 100	1 ms	292 KiB

boxes

/**
 * Prof.Nicola
**/
#include <bits/stdc++.h>
#include "boxes.h"

using namespace std;
#define endl "\n"
#define mp make_pair
#define F first
#define S second
#define REP(i,l,r) for(long long i=(l);i<(r);i++)
#define PER(i,l,r) for(long long i=(r)-1;i>=(l);i--)
#define bitl __builtin_clz
#define bitr __builtin_ctz
#define bits __builtin_popcount
const long dx[4]={1,0,-1,0},dz[4]={0,1,0,-1};
const long double pi=3.14159265359;
const long long mod=1e9+7;
long long p(long long x){while(x&(x-1)){x=x&(x-1);}return x;}
long long squared(long long x){return (x*x)%mod;}
long long power(long long x,long long p){if(p==0){return 1;}if(p%2==1){return (power(x,p-1)*x)%mod;}return squared(power(x,p/2));}
long long inv(long long x){return power(x,mod-2);}
long long log(long long x,long long z){if(x<z){return 0;}return 1+log(x/z,z);}
template<class T>void re(T&x){cin>>x;}
template<class T1,class T2> void re(pair<T1,T2>&x){re(x.first);re(x.second);}
template<class T>void re(vector<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T>void re(deque<T>&x){for(long i=0;i<x.size();i++){re(x[i]);}}
template<class T>void out(T x){cout<<x<<" ";}
template<class T1,class T2>void out(pair<T1,T2>x){out(x.first);out(x.second);cout<<endl;}
template<class T>void out(vector<T>x,long l=0,long r=0){if(!r){r=x.size();}for(long i=l;i<r;i++){out(x[i]);}cout<<endl;}
template<class T>void out(deque<T>x,long l=0,long r=0){if(!r){r=x.size();}for(long i=l;i<r;i++){out(x[i]);}cout<<endl;}
template<class T>void out(set<T>x){while(!x.empty()){out(*x.begin());x.erase(*x.begin());}cout<<endl;}
template<class T1,class T2>void out(map<T1,T2>x){while(!x.empty()){out(*x.begin());x.erase(x.begin()->first);}cout<<endl;}
template<class T>void out(queue<T>x){while(!x.empty()){out(x.front());x.pop();}cout<<endl;}
template<class T>void out(priority_queue<T>x){while(!x.empty()){out(x.top());x.pop();}cout<<endl;}
template<class T>void out(stack<T>x){while(!x.empty()){out(x.top());x.pop();}cout<<endl;}
template<class T>T cross(complex<T>x,complex<T>z){return (conj(x)*z).imag();}
template<class T>T dot(complex<T>x,complex<T>z){return (conj(x)*z).real();}
set<long long>::iterator T;
long long vLE(long long x,vector<long long>&VT,long l=0,long r=-1){if(r==-1){r=VT.size()-1;}if(VT[l]>x){return -1;}long long z=p(r-l);while(z){if(l+z<=r&&VT[l+z]<=x){l+=z;}z/=2;}return l;}
long long vL(long long x,vector<long long>&VT,long l=0,long r=-1){if(r==-1){r=VT.size()-1;}if(VT[l]>=x){return -1;}long long z=p(r-l);while(z){if(l+z<=r&&VT[l+z]<x){l+=z;}z/=2;}return l;}
long long vGE(long long x,vector<long long>&VT,long l=0,long r=-1){if(r==-1){r=VT.size()-1;}if(VT[l]>=x){return l;}l=vL(x,VT,l,r);if(l==r){return -1;}return l+1;}
long long vG(long long x,vector<long long>&VT,long l=0,long r=-1){if(r==-1){r=VT.size()-1;}if(VT[l]>x){return l;}l=vLE(x,VT,l,r);if(l==r){return -1;}return l+1;}
long long sLE(long long x,set<long long>&ST){if(ST.count(x)){return x;}if(*ST.begin()>x){return -1;}ST.insert(x);T=ST.find(x);T--;ST.erase(x);return *T;}
long long sL(long long x,set<long long>&ST){if(*ST.begin()>=x){return -1;}if(ST.count(x)){T=ST.find(x);T--;return *T;}ST.insert(x);T=ST.find(x);T--;ST.erase(x);return *T;}
long long sGE(long long x,set<long long>&ST){if(ST.count(x)){return x;}if(*ST.rbegin()<x){return -1;}ST.insert(x);T=ST.find(x);T++;ST.erase(x);return *T;}
long long sG(long long x,set<long long>&ST){if(*ST.rbegin()<=x){return -1;}if(ST.count(x)){T=ST.find(x);T++;return *T;}ST.insert(x);T=ST.find(x);T++;ST.erase(x);return *T;}
vector<long long>P;
long long n,k,l;
long long cost1(long x)
{
    long long ret;
    while(x>=0){
        ret+=2*P[x];
        x-=k;
    }
    return ret;
}
long long cost2(long x)
{
    long long ret=0;
    while(x<n){
        ret+=2*(l-P[x]);
        x+=k;
    }
    return ret;
}
long long delivery(int N, int K, int L, int p[]) {
    n=N;
    k=K;
    l=L;
    REP(i,0,N){
        P.push_back(p[i]);
    }
    long long ans;
    if(p[N-1]<=L/2){
        return cost1(N-1);
    }
    if(p[0]>=(L+1)/2){
        return cost2(0);
    }
    long x=vL((L+1)/2,P);
    ans=cost1(x)+cost2(x+1);
    ans=min(ans,cost1(x+1)+cost2(x+2));
    REP(i,0,K+2){
        ans=min(ans,N+cost1(x+1-i)+cost2(x-i+2+K));
    }
    return ans;
}

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

boxes.cpp: In function 'long long int cost1(long int)':
boxes.cpp:58:12: warning: 'ret' may be used uninitialized in this function [-Wmaybe-uninitialized]
   58 |     return ret;
      |            ^~~
boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:53:15: warning: 'ret' may be used uninitialized in this function [-Wmaybe-uninitialized]
   53 |     long long ret;
      |               ^~~
boxes.cpp:87:22: warning: 'ret' may be used uninitialized in this function [-Wmaybe-uninitialized]
   87 |         ans=min(ans,N+cost1(x+1-i)+cost2(x-i+2+K));
      |                     ~^~~~~~~~~~~~~
boxes.cpp:85:27: warning: 'ret' may be used uninitialized in this function [-Wmaybe-uninitialized]
   85 |     ans=min(ans,cost1(x+1)+cost2(x+2));
      |                 ~~~~~~~~~~^~~~~~~~~~~
boxes.cpp:84:17: warning: 'ret' may be used uninitialized in this function [-Wmaybe-uninitialized]
   84 |     ans=cost1(x)+cost2(x+1);
      |         ~~~~~~~~^~~~~~~~~~~

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