제출 #1307838

#제출 시각아이디문제언어결과실행 시간메모리
1307838exoworldgd축제 (IOI25_festival)C++20
컴파일 에러
0 ms0 KiB
#include "festival.h" #include <bits/stdc++.h> #define exoworldgd cin.tie(0)->sync_with_stdio(0),cout.tie(0) using namespace std; using ll=long long; int n; vector<int>cur,best; void rec(int pos,ll s,int lim,vector<int>&a,vector<int>&p,vector<int>&t){ if(pos==n){ if(cur.size()>best.size())best=cur; return; } if(s>=p[a[pos]]&&lim>=t[a[pos]])cur.push_back(a[pos]),rec(pos+1,min((s-p[a[pos]])*t[a[pos]],1e18),lim,a,p,t),cur.pop_back(); rec(pos+1,s,min(lim,t[a[pos]]-1),a,p,t); } vector<int>max_coupons(int s,vector<int>p,vector<int>t){ vector<int>a; n=p.size(); for(int i=0;i<n;i++)a.push_back(i); sort(a.begin(),a.end(),[&](int a,int b){ if(t[a]==1&&t[b]==1)return p[a]<p[b]; if(t[a]==1||t[b]==1)return t[b]==1; return 1ll*p[a]*t[a]*(t[b]-1)<1ll*p[b]*t[b]*(t[a]-1); }); rec(0,s,4,a,p,t); return best; }

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

festival.cpp: In function 'void rec(int, ll, int, std::vector<int>&, std::vector<int>&, std::vector<int>&)':
festival.cpp:13:72: error: no matching function for call to 'min(ll, double)'
   13 |     if(s>=p[a[pos]]&&lim>=t[a[pos]])cur.push_back(a[pos]),rec(pos+1,min((s-p[a[pos]])*t[a[pos]],1e18),lim,a,p,t),cur.pop_back();
      |                                                                     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/vector:62,
                 from festival.h:1,
                 from festival.cpp:1:
/usr/include/c++/13/bits/stl_algobase.h:233:5: note: candidate: 'template<class _Tp> constexpr const _Tp& std::min(const _Tp&, const _Tp&)'
  233 |     min(const _Tp& __a, const _Tp& __b)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:233:5: note:   template argument deduction/substitution failed:
festival.cpp:13:72: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'double')
   13 |     if(s>=p[a[pos]]&&lim>=t[a[pos]])cur.push_back(a[pos]),rec(pos+1,min((s-p[a[pos]])*t[a[pos]],1e18),lim,a,p,t),cur.pop_back();
      |                                                                     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note: candidate: 'template<class _Tp, class _Compare> constexpr const _Tp& std::min(const _Tp&, const _Tp&, _Compare)'
  281 |     min(const _Tp& __a, const _Tp& __b, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algobase.h:281:5: note:   template argument deduction/substitution failed:
festival.cpp:13:72: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'double')
   13 |     if(s>=p[a[pos]]&&lim>=t[a[pos]])cur.push_back(a[pos]),rec(pos+1,min((s-p[a[pos]])*t[a[pos]],1e18),lim,a,p,t),cur.pop_back();
      |                                                                     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from festival.cpp:2:
/usr/include/c++/13/bits/stl_algo.h:5775:5: note: candidate: 'template<class _Tp> constexpr _Tp std::min(initializer_list<_Tp>)'
 5775 |     min(initializer_list<_Tp> __l)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5775:5: note:   template argument deduction/substitution failed:
festival.cpp:13:72: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   13 |     if(s>=p[a[pos]]&&lim>=t[a[pos]])cur.push_back(a[pos]),rec(pos+1,min((s-p[a[pos]])*t[a[pos]],1e18),lim,a,p,t),cur.pop_back();
      |                                                                     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/usr/include/c++/13/bits/stl_algo.h:5785:5: note: candidate: 'template<class _Tp, class _Compare> constexpr _Tp std::min(initializer_list<_Tp>, _Compare)'
 5785 |     min(initializer_list<_Tp> __l, _Compare __comp)
      |     ^~~
/usr/include/c++/13/bits/stl_algo.h:5785:5: note:   template argument deduction/substitution failed:
festival.cpp:13:72: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   13 |     if(s>=p[a[pos]]&&lim>=t[a[pos]])cur.push_back(a[pos]),rec(pos+1,min((s-p[a[pos]])*t[a[pos]],1e18),lim,a,p,t),cur.pop_back();
      |                                                                     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~