QOJ.ac

QOJ

ID题目提交者结果用时内存语言文件大小提交时间测评时间
#577763#6429. Let's Play Curlinglibantian#Compile Error//C++23956b2024-09-20 14:40:042024-09-20 14:40:05

Judging History

你现在查看的是最新测评结果

  • [2024-09-20 14:40:05]
  • 评测
  • [2024-09-20 14:40:04]
  • 提交

answer

#include<bits/stdc++.h>
using namespace std;
#define int long long
#define pii pair<int,int>
#define fi first
#define se second
#define all(_a) _a.begin(),_a.end()
void solve(){
    int n,m;
    cin>>n>>m;
    vector<int>a(n),b(m);
    for(int i=0;i<n;i++)cin>>a[i];
    for(int i=0;i<m;i++)cin>>b[i];

    sort(all(a));
    sort(all(b));

    int res=0;
    res=max(res,n-(int)(upper_bound(all(a),b[n-1])-a.begin()));
    res=max(res,lower_bound(all(a),b[0])-a.begin());

    for(int i=1;i<m;i++){
        int l=b[i-1],r=b[i];
        int posl=upper_bound(all(a),l)-a.begin();
        int posr=lower_bound(all(a),r)-a.begin();
        posr--;
        res=max(res,max(posr-posl+1,(int)0));
    }
    if(res==0)cout<<"Impossible"<<endl;
    else cout<<res<<endl;

}
signed main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr),cin.tie(nullptr);
    int T=1;
    cin>>T;
    while(T--)solve();
    return 0;
}

詳細信息

answer.code: In function ‘void solve()’:
answer.code:20:12: error: no matching function for call to ‘max(long long int&, __gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >::difference_type)’
   20 |     res=max(res,lower_bound(all(a),b[0])-a.begin());
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from answer.code: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:
answer.code:20:12: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long long int’ and ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >::difference_type’ {aka ‘long int’})
   20 |     res=max(res,lower_bound(all(a),b[0])-a.begin());
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:
answer.code:20:12: note:   deduced conflicting types for parameter ‘const _Tp’ (‘long long int’ and ‘__gnu_cxx::__normal_iterator<long long int*, std::vector<long long int> >::difference_type’ {aka ‘long int’})
   20 |     res=max(res,lower_bound(all(a),b[0])-a.begin());
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
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:
answer.code:20:12: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘long long int’
   20 |     res=max(res,lower_bound(all(a),b[0])-a.begin());
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
/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:
answer.code:20:12: note:   mismatched types ‘std::initializer_list<_Tp>’ and ‘long long int’
   20 |     res=max(res,lower_bound(all(a),b[0])-a.begin());
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~