Submission #292562

#TimeUsernameProblemLanguageResultExecution timeMemory
292562AKaan37Meetings (IOI18_meetings)C++17
Compilation error
0 ms0 KiB
#include "meetings.h" #include <bits/stdc++.h> using namespace std; typedef long long lo; typedef pair< lo,lo > PII; #define fi first #define se second #define mp make_pair #define endl "\n" #define pb push_back #define fio() ios_base::sync_with_stdio(false);cin.tie(NULL);cout.tie(NULL) #define FOR for(int i=1;i<=n;i++) #define mid ((start+end)/2) #define ort ((bas+son)/2) const lo inf = 1000000000000000000; const lo KOK = 100000; const lo LOG = 30; const lo li = 5010; const lo mod = 1000000007; lo n,m,b[li],a[li][li],k,flag,t,tree[li][li*4],ind; lo cev; string s; inline void build(int node,int start,int end){ if(start==end){tree[ind][node]=a[ind][start-1];return ;} build(node*2,start,mid),build(node*2+1,mid+1,end); tree[ind][node]=tree[ind][node*2]+tree[ind][node*2+1]; } inline lo query(int node,int start,int end,int l,int r){ if(start>end || start>r || end<l)return 0; if(start>=l && end<=r){return tree[ind][node];} return query(node*2,start,mid,l,r)+query(node*2+1,mid+1,end,l,r); } std::vector<long long> minimum_costs(vector<int> h,vector<int> l,vector<int> r) { t = (int)l.size(); n=(int)h.size(); for(int i=0;i<n;i++){ int mx=0; for(int j=i;j>=0;j--){ mx=max(mx,h[j]); a[i][j]=mx; } mx=0; for(int j=i;j<n;j++){ mx=max(mx,h[j]); a[i][j]=mx; } } for(int i=0;i<n;i++){ ind=i; build(1,1,n); } vector<lo> v; for(int i=0;i<t;i++){ cev=inf; for(int j=l[i];j<=r[i];j++){ ind=j; lo at=0,at1=0; if(l[i]+1<=j+1 && l[i]+1<=n)at=query(1,1,n,l[i]+1,min(n,j+1)); if(j+2<=n && j+2<=r[i]+1)at1=query(1,1,n,j+2,min(n,r[i]+1)); cev=min(cev,at+at1); } v.pb(cev); } return v; }

Compilation message (stderr)

meetings.cpp: In function 'std::vector<long long int> minimum_costs(std::vector<int>, std::vector<int>, std::vector<int>)':
meetings.cpp:66:63: error: no matching function for call to 'min(lo&, int)'
   66 |    if(l[i]+1<=j+1 && l[i]+1<=n)at=query(1,1,n,l[i]+1,min(n,j+1));
      |                                                               ^
In file included from /usr/include/c++/9/vector:60,
                 from meetings.h:3,
                 from meetings.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:198:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  198 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:198:5: note:   template argument deduction/substitution failed:
meetings.cpp:66:63: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   66 |    if(l[i]+1<=j+1 && l[i]+1<=n)at=query(1,1,n,l[i]+1,min(n,j+1));
      |                                                               ^
In file included from /usr/include/c++/9/vector:60,
                 from meetings.h:3,
                 from meetings.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:246:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  246 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:246:5: note:   template argument deduction/substitution failed:
meetings.cpp:66:63: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'int')
   66 |    if(l[i]+1<=j+1 && l[i]+1<=n)at=query(1,1,n,l[i]+1,min(n,j+1));
      |                                                               ^
In file included from /usr/include/c++/9/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
                 from meetings.cpp:2:
/usr/include/c++/9/bits/stl_algo.h:3444:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3444 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3444:5: note:   template argument deduction/substitution failed:
meetings.cpp:66:63: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   66 |    if(l[i]+1<=j+1 && l[i]+1<=n)at=query(1,1,n,l[i]+1,min(n,j+1));
      |                                                               ^
In file included from /usr/include/c++/9/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
                 from meetings.cpp:2:
/usr/include/c++/9/bits/stl_algo.h:3450:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3450 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3450:5: note:   template argument deduction/substitution failed:
meetings.cpp:66:63: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   66 |    if(l[i]+1<=j+1 && l[i]+1<=n)at=query(1,1,n,l[i]+1,min(n,j+1));
      |                                                               ^
meetings.cpp:67:61: error: no matching function for call to 'min(lo&, __gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type)'
   67 |    if(j+2<=n && j+2<=r[i]+1)at1=query(1,1,n,j+2,min(n,r[i]+1));
      |                                                             ^
In file included from /usr/include/c++/9/vector:60,
                 from meetings.h:3,
                 from meetings.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:198:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  198 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:198:5: note:   template argument deduction/substitution failed:
meetings.cpp:67:61: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   67 |    if(j+2<=n && j+2<=r[i]+1)at1=query(1,1,n,j+2,min(n,r[i]+1));
      |                                                             ^
In file included from /usr/include/c++/9/vector:60,
                 from meetings.h:3,
                 from meetings.cpp:1:
/usr/include/c++/9/bits/stl_algobase.h:246:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  246 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algobase.h:246:5: note:   template argument deduction/substitution failed:
meetings.cpp:67:61: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and '__gnu_cxx::__alloc_traits<std::allocator<int>, int>::value_type' {aka 'int'})
   67 |    if(j+2<=n && j+2<=r[i]+1)at1=query(1,1,n,j+2,min(n,r[i]+1));
      |                                                             ^
In file included from /usr/include/c++/9/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
                 from meetings.cpp:2:
/usr/include/c++/9/bits/stl_algo.h:3444:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(std::initializer_list<_Tp>)'
 3444 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3444:5: note:   template argument deduction/substitution failed:
meetings.cpp:67:61: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   67 |    if(j+2<=n && j+2<=r[i]+1)at1=query(1,1,n,j+2,min(n,r[i]+1));
      |                                                             ^
In file included from /usr/include/c++/9/algorithm:62,
                 from /usr/include/x86_64-linux-gnu/c++/9/bits/stdc++.h:65,
                 from meetings.cpp:2:
/usr/include/c++/9/bits/stl_algo.h:3450:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(std::initializer_list<_Tp>, _Compare)'
 3450 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/9/bits/stl_algo.h:3450:5: note:   template argument deduction/substitution failed:
meetings.cpp:67:61: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   67 |    if(j+2<=n && j+2<=r[i]+1)at1=query(1,1,n,j+2,min(n,r[i]+1));
      |                                                             ^