Submission #216756

#	Submission time	Handle	Problem	Language	Result	Execution time	Memory
216756	2020-03-28T03:26:08 Z	LittleFlowers__	Boxes with souvenirs (IOI15_boxes)	C++14	Compilation error	0 ms	0 KB

boxes

#include <bits/stdc++.h>
using namespace std;
#define in ({int x=0;int c=getchar(),n=0;for(;!isdigit(c);c=getchar()) n=(c=='-');for(;isdigit(c);c=getchar()) x=x*10+c-'0';n?-x:x;})
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
int rnd(int l,int r){return l+rng()%(r-l+1);}
#define fasty ios_base::sync_with_stdio(0),cin.tie(0);
#define forinc(a,b,c) for(int a=b,_c=c;a<=_c;++a)
#define fordec(a,b,c) for(int a=b,_c=c;a>=_c;--a)
#define forv(a,b) for(auto&a:b)
#define fi first
#define se second
#define pb push_back
#define ii pair<int,int>
#define mt make_tuple
#define all(a) a.begin(),a.end()
#define reset(f, x) memset(f, x, sizeof(f))
#define bit(x,i) ((x>>(i-1))&1)
#define on(x,i) (x|(1ll<<(i-1)))
#define off(x,i) (x&~(1<<(i-1)))
#define gg exit(0);

//#define unx 1

#ifndef unx
#include "boxes.h"
#endif // unx

const int N=10000010;

long long f[N],g[N];

long long delivery(int n,int k,int l,int p[]){
    long long ret=LLONG_MAX;
    forinc(i,1,n) f[i]=f[max(0ll,i-k)]+2*p[i-1];
    fordec(i,n,1) g[i]=g[min(n+1,i+k)]+2*(l-p[i-1]);
    forinc(i,0,n){
        ret=min(ret,f[i]+g[i+1]);
        ret=min(ret,f[i]+g[min(n+1,i+k+1)]+l);
    }
    cout<<ret;
}

#ifdef unx
int p[10000010];
main(){
    #define task "boxes"
    freopen(task".inp","r",stdin);
    freopen(task".out","w",stdout);

    int n,k,l; cin>>n>>k>>l;
    forinc(i,1,n) cin>>p[i-1];
    cout<<delivery(n,k,l,p)<<"\n";
}
#endif // unx

Compilation message

boxes.cpp: In function 'int rnd(int, int)':
boxes.cpp:5:30: warning: conversion to 'int' from 'std::mersenne_twister_engine<long unsigned int, 32, 624, 397, 31, 2567483615, 11, 4294967295, 7, 2636928640, 15, 4022730752, 18, 1812433253>::result_type {aka long unsigned int}' may alter its value [-Wconversion]
 int rnd(int l,int r){return l+rng()%(r-l+1);}
                             ~^~~~~~~~~~~~~~
boxes.cpp: In function 'long long int delivery(int, int, int, int*)':
boxes.cpp:34:37: error: no matching function for call to 'max(long long int, int)'
     forinc(i,1,n) f[i]=f[max(0ll,i-k)]+2*p[i-1];
                                     ^
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:219:5: note: candidate: template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)
     max(const _Tp& __a, const _Tp& __b)
     ^~~
/usr/include/c++/7/bits/stl_algobase.h:219:5: note:   template argument deduction/substitution failed:
boxes.cpp:34:37: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
     forinc(i,1,n) f[i]=f[max(0ll,i-k)]+2*p[i-1];
                                     ^
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:265:5: note: candidate: template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)
     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
     ^~~
/usr/include/c++/7/bits/stl_algobase.h:265:5: note:   template argument deduction/substitution failed:
boxes.cpp:34:37: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
     forinc(i,1,n) f[i]=f[max(0ll,i-k)]+2*p[i-1];
                                     ^
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:3462:5: note: candidate: template<class _Tp> constexpr _Tp std::max(std::initializer_list<_Tp>)
     max(initializer_list<_Tp> __l)
     ^~~
/usr/include/c++/7/bits/stl_algo.h:3462:5: note:   template argument deduction/substitution failed:
boxes.cpp:34:37: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
     forinc(i,1,n) f[i]=f[max(0ll,i-k)]+2*p[i-1];
                                     ^
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:3468:5: note: candidate: template<class _Tp, class _Compare> constexpr _Tp std::max(std::initializer_list<_Tp>, _Compare)
     max(initializer_list<_Tp> __l, _Compare __comp)
     ^~~
/usr/include/c++/7/bits/stl_algo.h:3468:5: note:   template argument deduction/substitution failed:
boxes.cpp:34:37: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
     forinc(i,1,n) f[i]=f[max(0ll,i-k)]+2*p[i-1];
                                     ^
boxes.cpp:41:1: warning: no return statement in function returning non-void [-Wreturn-type]
 }
 ^