제출 #1318320

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

Main

#include <bits/stdc++.h>
#define pb push_back 
#pragma GCC target("avx2,bmi,bmi2")
#pragma GCC optimize("Ofast,unroll-loops")
using namespace std;
int32_t main(){
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);
    int t;
    cin >> t;
    while(t--){
        vector<vector<short>> dp(1001,vector<short>(50002,-1));
        int n;
        cin >> n;
        vector<int> v(n),pref(n+1,0);
        for(auto&i:v)cin>>i;
        for(int i = 0; i < n; i++){
            pref[i+1]=pref[i]+v[i];
            dp[i+1][v[i]]=i+1;
        }
        for(int i = 1; i <= n; i++){
            for(int j = 1; j <= pref[i]; j++){
                dp[i][j]=max({dp[i][j],dp[i-1][j],v[i-1]<j?dp[i-1][j-v[i-1]]:0});
            }
        }
        vector<int> ans;
        for(int i = 1; i <= n; i++){
            bool ok=1;
            for(int j = i; j <= n; j++){
                int sum=pref[j]-pref[j-i];
                if(sum&1){
                    ok=0;break;
                }
                if(dp[j][sum/2] < (j-i+1)){
                    ok=0;break;
                }
            }
            if(ok) ans.pb(i);
        }
        cout << ans.size() << ' ';
        for(auto i : ans) cout << i << ' ';
        cout << '\n';
    }
}

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

Main.cpp: In function 'int32_t main()':
Main.cpp:24:29: error: no matching function for call to 'max(<brace-enclosed initializer list>)'
   24 |                 dp[i][j]=max({dp[i][j],dp[i-1][j],v[i-1]<j?dp[i-1][j-v[i-1]]:0});
      |                          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from Main.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:
Main.cpp:24:29: note:   candidate expects 2 arguments, 1 provided
   24 |                 dp[i][j]=max({dp[i][j],dp[i-1][j],v[i-1]<j?dp[i-1][j-v[i-1]]:0});
      |                          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:
Main.cpp:24:29: note:   candidate expects 3 arguments, 1 provided
   24 |                 dp[i][j]=max({dp[i][j],dp[i-1][j],v[i-1]<j?dp[i-1][j-v[i-1]]:0});
      |                          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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:
Main.cpp:24:29: note:   deduced conflicting types for parameter '_Tp' ('short int' and 'int')
   24 |                 dp[i][j]=max({dp[i][j],dp[i-1][j],v[i-1]<j?dp[i-1][j-v[i-1]]:0});
      |                          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:
Main.cpp:24:29: note:   deduced conflicting types for parameter '_Tp' ('short int' and 'int')
   24 |                 dp[i][j]=max({dp[i][j],dp[i-1][j],v[i-1]<j?dp[i-1][j-v[i-1]]:0});
      |                          ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~