제출 #259714

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
259714		uacoder123	선물상자 (IOI15_boxes)	C++14	컴파일 에러	0 ms	0 KiB

boxes

#include <bits/stdc++.h>
#include "boxes.h"
using namespace std;
#define F first
#define S second
#define FOR(i,a,b) for (auto i = (a); i <= (b); ++i)
#define NFOR(i,a,b) for(auto i = (a); i >= (b); --i)
#define all(x) (x).begin(), (x).end()
#define sz(x) int(x.size())
#define mp(i,a) make_pair(i,a)
#define pb(a) push_back(a)
#define bit(x,b) (x&(1LL<<b))

typedef int lli;
typedef pair <lli,lli> ii;
typedef pair <lli,ii> iii;
typedef vector <lli> vi;

lli arr[10000000],arr1[10000000],ans=0;
long long delivery(int N, int K, int L, int p[]) 
{
    lli n,k,l;
    n=N;
    k=K;
    l=L;
    for(lli i=0;i<n;++i)
    {
        arr[i]=p[i]*2+((i-k>=0)?arr[i-k]:0*1LL);
    }
    for(lli i=n-1;i>=0*1LL;--i)
        arr1[i]=(l-p[i])*2+((i+k<=n-1)?arr1[i+k]:0*1LL);
    ans=min(arr[n-1],arr1[0*1LL]);
    for(lli i=0*1LL;i<n-1;++i)
        ans=min(ans,arr[i]+arr1[i+1]);
    for(lli i=0*1LL;i<=n;++i)
        ans=min(ans,((i>0*1LL)?arr[i-1]:0*1LL)+l+((n-i-k>0*1LL)?arr1[(n)-(n-k-i)]:0));
    return(ans);
}

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

boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:28:22: warning: conversion to 'lli {aka int}' from 'long long int' may alter its value [-Wconversion]
         arr[i]=p[i]*2+((i-k>=0)?arr[i-k]:0*1LL);
                ~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:31:27: warning: conversion to 'lli {aka int}' from 'long long int' may alter its value [-Wconversion]
         arr1[i]=(l-p[i])*2+((i+k<=n-1)?arr1[i+k]:0*1LL);
                 ~~~~~~~~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~
boxes.cpp:36:85: error: no matching function for call to 'min(lli&, long long int)'
         ans=min(ans,((i>0*1LL)?arr[i-1]:0*1LL)+l+((n-i-k>0*1LL)?arr1[(n)-(n-k-i)]:0));
                                                                                     ^
In file included from /usr/include/c++/7/bits/char_traits.h:39:0,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/istream:38,
                 from /usr/include/c++/7/sstream:38,
                 from /usr/include/c++/7/complex:45,
                 from /usr/include/c++/7/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:52,
                 from boxes.cpp:1:
/usr/include/c++/7/bits/stl_algobase.h:195:5: note: candidate: template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)
     min(const _Tp& __a, const _Tp& __b)
     ^~~
/usr/include/c++/7/bits/stl_algobase.h:195:5: note:   template argument deduction/substitution failed:
boxes.cpp:36:85: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
         ans=min(ans,((i>0*1LL)?arr[i-1]:0*1LL)+l+((n-i-k>0*1LL)?arr1[(n)-(n-k-i)]:0));
                                                                                     ^
In file included from /usr/include/c++/7/bits/char_traits.h:39:0,
                 from /usr/include/c++/7/ios:40,
                 from /usr/include/c++/7/istream:38,
                 from /usr/include/c++/7/sstream:38,
                 from /usr/include/c++/7/complex:45,
                 from /usr/include/c++/7/ccomplex:39,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:52,
                 from boxes.cpp:1:
/usr/include/c++/7/bits/stl_algobase.h:243:5: note: candidate: template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)
     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
     ^~~
/usr/include/c++/7/bits/stl_algobase.h:243:5: note:   template argument deduction/substitution failed:
boxes.cpp:36:85: note:   deduced conflicting types for parameter 'const _Tp' ('int' and 'long long int')
         ans=min(ans,((i>0*1LL)?arr[i-1]:0*1LL)+l+((n-i-k>0*1LL)?arr1[(n)-(n-k-i)]:0));
                                                                                     ^
In file included from /usr/include/c++/7/algorithm:62:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:65,
                 from boxes.cpp:1:
/usr/include/c++/7/bits/stl_algo.h:3450:5: note: candidate: template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)
     min(initializer_list<_Tp> __l)
     ^~~
/usr/include/c++/7/bits/stl_algo.h:3450:5: note:   template argument deduction/substitution failed:
boxes.cpp:36:85: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
         ans=min(ans,((i>0*1LL)?arr[i-1]:0*1LL)+l+((n-i-k>0*1LL)?arr1[(n)-(n-k-i)]:0));
                                                                                     ^
In file included from /usr/include/c++/7/algorithm:62:0,
                 from /usr/include/x86_64-linux-gnu/c++/7/bits/stdc++.h:65,
                 from boxes.cpp:1:
/usr/include/c++/7/bits/stl_algo.h:3456:5: note: candidate: template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)
     min(initializer_list<_Tp> __l, _Compare __comp)
     ^~~
/usr/include/c++/7/bits/stl_algo.h:3456:5: note:   template argument deduction/substitution failed:
boxes.cpp:36:85: note:   mismatched types 'std::initializer_list<_Tp>' and 'int'
         ans=min(ans,((i>0*1LL)?arr[i-1]:0*1LL)+l+((n-i-k>0*1LL)?arr1[(n)-(n-k-i)]:0));
                                                                                     ^