/ SeriousOJ /

Record Detail

Compile Error 

foo.cc: In function 'void solve()':
foo.cc:21:12: error: no matching function for call to 'min(ll&, std::__iterator_traits<__gnu_cxx::__normal_iterator<char*, std::__cxx11::basic_string<char> >, void>::difference_type)'
   21 |     k = min(k, count(all(s1), '?'));
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:60,
                 from /usr/include/x86_64-linux-gnu/c++/13/bits/stdc++.h:51,
                 from foo.cc: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:
foo.cc:21:12: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'std::__iterator_traits<__gnu_cxx::__normal_iterator<char*, std::__cxx11::basic_string<char> >, void>::difference_type' {aka 'long int'})
   21 |     k = min(k, count(all(s1), '?'));
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~
/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:
foo.cc:21:12: note:   deduced conflicting types for parameter 'const _Tp' ('long long int' and 'std::__iterator_traits<__gnu_cxx::__normal_iterator<char*, std::__cxx11::basic_string<char> >, void>::difference_type' {aka 'long int'})
   21 |     k = min(k, count(all(s1), '?'));
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~
In file included from /usr/include/c++/13/algorithm:61:
/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:
foo.cc:21:12: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   21 |     k = min(k, count(all(s1), '?'));
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~
/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:
foo.cc:21:12: note:   mismatched types 'std::initializer_list<_Tp>' and 'long long int'
   21 |     k = min(k, count(all(s1), '?'));
      |         ~~~^~~~~~~~~~~~~~~~~~~~~~~~

Code

#include<bits/stdc++.h>
#define endl        '\n'
#define F           first
#define S           second
#define pb          push_back
#define yes         cout<<"YES\n"
#define no          cout<<"NO\n"
#define all(x)      x.begin(),x.end()
#define allr(x)     x.rbegin(),x.rend()
#define error1(x)   cerr<<#x<<" = "<<(x)<<endl
#define error2(a,b) cerr<<"("<<#a<<", "<<#b<<") = ("<<(a)<<", "<<(b)<<")\n";
#define coutall(v)  for(auto &it: v) cout << it << " "; cout << endl;
using namespace std;
using ll = long long;
using ld = long double;

void solve() {
    ll n, k, ans = 0;
    string s1;
    cin >> n >> k >> s1;
    k = min(k, count(all(s1), '?'));

    auto calAns = [&](string &s) -> ll {
        ll cntB = count(all(s), 'B'), tot = 0;
        for(int i = 0; i < n; i++) {
            if(s[i] == 'A') tot += cntB;
            else if(s[i] == 'B') --cntB;
        }
        return tot;
    };

    if(k == 1) {
        for(int i = 0; i < n; i++) { // first ? -> A
            if(s1[i] == '?') {
                s1[i] = 'A';
                ans = max(ans, calAns(s1));
                s1[i] = '?';
                break;
            }
        }
        for(int i = n - 1; i >= 0; i--) {
            if(s1[i] == '?') {
                s1[i] = 'B';
                ans = max(ans, calAns(s1));
                s1[i] = '?';
                break;
            }
        }
    }
    else if(k > 1) {
        int a = (k + 1) >> 1, b = k >> 1;
        for(int i = 0; i < n && a > 0; i++) {
            if(s1[i] == '?') {
                s1[i] = 'A';
                --a;
            }
        }
        for(int i = n - 1; i >= 0 && b > 0; i--) {
            if(s1[i] == '?') {
                s1[i] = 'B';
                --b;
            }
        }
        ans = max(ans, calAns(s1));
    }
    else ans = max(ans, calAns(s1));

    cout << ans << endl;
    return;
}

signed main() {
    ios::sync_with_stdio(false); cin.tie(0);
    int tc = 1;
    cin >> tc;
    for (int t = 1; t <= tc; t++) {
        // cout << "Case " << t << ": ";
        solve();
    }
    return 0;
}

Information

Submit By
Type
Submission
Problem
P1110 E. Subsequence of AB
Language
C++17 (G++ 13.2.0)
Submit At
2024-11-07 08:43:57
Judged At
2024-11-11 02:23:30
Judged By
Score
0
Total Time
0ms
Peak Memory
0 Bytes
  1. About
  2. Contact Us
  3. Privacy
  4. Terms of Service
  5. Copyright Complaint
  6. English
  1. © SeriousOJ Forked from © 2005 - 2023 Vijos.org
  2. dc24fca