제출 #1289152

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1289152		naneosmic	Feast (NOI19_feast)	C++20	컴파일 에러	0 ms	0 KiB

feast

#include <bits/stdc++.h>
#define int long long
#define endl "\n"
using namespace std;
int n,k,v,c;
vector<int>a;
void calc(int lambda){
    vector<vector<pair<int,int>>>dp(n,vector<pair<int,int>>(2));
    dp[0][0]={0,0};
    dp[0][1]={a[0]-lambda,1};
    for(int i=1;i<n;i++){
        dp[i][0]=max(dp[i-1][0],dp[i-1][1]);
        dp[i][1]=max({dp[i-1][0].first+a[i]-lambda,dp[i-1][0].second+1},{dp[i-1][1].first+a[i],dp[i-1][1].second});
    }
    v=max(dp[n-1][0].first,dp[n-1][1].first);
    c=max(dp[n-1][0].second,dp[n-1][1].second);
}
signed main(){
    cin>>n>>k;
    a.resize(n);
    for(int i=0;i<n;i++){
        cin>>a[i];
    }
    int l=0,r=1e18;
    while(l<r){
        int mid=(l+r+1)/2;
        calc(mid);
        if(c>=k){
            l=mid;
        }else{
            r=mid-1;
        }
    }
    cout<<v+(l*k);
}

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

feast.cpp: In function 'void calc(long long int)':
feast.cpp:13:21: error: no matching function for call to 'max(<brace-enclosed initializer list>, <brace-enclosed initializer list>)'
   13 |         dp[i][1]=max({dp[i-1][0].first+a[i]-lambda,dp[i-1][0].second+1},{dp[i-1][1].first+a[i],dp[i-1][1].second});
      |                  ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from feast.cpp:1:
/usr/include/c++/13/bits/stl_algobase.h:257:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::max(const _Tp&, const _Tp&)'
  257 |     max(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:257:5: note:   template argument deduction/substitution failed:
feast.cpp:13:21: note:   couldn't deduce template parameter '_Tp'
   13 |         dp[i][1]=max({dp[i-1][0].first+a[i]-lambda,dp[i-1][0].second+1},{dp[i-1][1].first+a[i],dp[i-1][1].second});
      |                  ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::max(const _Tp&, const _Tp&, _Compare)'
  303 |     max(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:303:5: note:   template argument deduction/substitution failed:
feast.cpp:13:21: note:   candidate expects 3 arguments, 2 provided
   13 |         dp[i][1]=max({dp[i-1][0].first+a[i]-lambda,dp[i-1][0].second+1},{dp[i-1][1].first+a[i],dp[i-1][1].second});
      |                  ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/usr/include/c++/13/bits/stl_algo.h:5795:5: note: candidate: 'template<class _Tp> constexpr _Tp std::max(initializer_list<_Tp>)'
 5795 |     max(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5795:5: note:   template argument deduction/substitution failed:
feast.cpp:13:21: note:   candidate expects 1 argument, 2 provided
   13 |         dp[i][1]=max({dp[i-1][0].first+a[i]-lambda,dp[i-1][0].second+1},{dp[i-1][1].first+a[i],dp[i-1][1].second});
      |                  ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::max(initializer_list<_Tp>, _Compare)'
 5805 |     max(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5805:5: note:   template argument deduction/substitution failed:
feast.cpp:13:21: note:   couldn't deduce template parameter '_Compare'
   13 |         dp[i][1]=max({dp[i-1][0].first+a[i]-lambda,dp[i-1][0].second+1},{dp[i-1][1].first+a[i],dp[i-1][1].second});
      |                  ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~