test/yukicoder/2276.test.cpp

• View this file on GitHub
• Last update: 2024-09-01 13:40:30+09:00
• Problem: https://yukicoder.me/problems/no/2276

Depends on

• 関数型や関数オブジェクトに関するテンプレート (src/Internal/function_traits.hpp)
• フィボナッチ探索 (src/Optimization/fibonacci_search.hpp)
• 最大最小を指定するための列挙型 (src/Optimization/MinMaxEnum.hpp)

Code

// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/2276
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
#include <iostream>
#include <vector>
#include "src/Optimization/fibonacci_search.hpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 int N;
 cin >> N;
 string S;
 cin >> S;
 vector<int> p;
 for (int i= 0; i < N; ++i)
  if (S[i] == '?') p.push_back(i);
 auto f= [&](int n) {
  for (int i= 0; i < n; ++i) S[p[i]]= 'A';
  for (int i= n; i < (int)p.size(); ++i) S[p[i]]= 'C';
  long long a= 0, ret= 0;
  for (int i= 0; i < N; ++i) {
   if (S[i] == 'A') ++a;
   else ret+= a;
  }
  return ret;
 };
 auto [x, fx]= fibonacci_search<MAXIMIZE>(f, 0, p.size());
 cout << fx << '\n';
 return 0;
}

#line 1 "test/yukicoder/2276.test.cpp"
// competitive-verifier: PROBLEM https://yukicoder.me/problems/no/2276
// competitive-verifier: TLE 0.5
// competitive-verifier: MLE 64
#include <iostream>
#include <vector>
#line 2 "src/Optimization/fibonacci_search.hpp"
#include <algorithm>
#include <cassert>
#line 2 "src/Internal/function_traits.hpp"
#include <type_traits>
// clang-format off
namespace function_template_internal{
template<class C>struct is_function_object{
 template<class U,int dummy=(&U::operator(),0)> static std::true_type check(U *);
 static std::false_type check(...);
 static C *m;
 static constexpr bool value= decltype(check(m))::value;
};
template<class F,bool,bool>struct function_type_impl{using type= void;};
template<class F>struct function_type_impl<F,true,false>{using type= F *;};
template<class F>struct function_type_impl<F,false,true>{using type= decltype(&F::operator());};
template<class F> using function_type_t= typename function_type_impl<F,std::is_function_v<F>,is_function_object<F>::value>::type;
template<class... Args>struct result_type_impl{using type= void;};
template<class R,class... Args>struct result_type_impl<R(*)(Args...)>{using type= R;};
template<class C,class R,class... Args>struct result_type_impl<R(C::*)(Args...)>{using type= R;};
template<class C,class R,class... Args>struct result_type_impl<R(C::*)(Args...)const>{using type= R;};
template<class F> using result_type_t= typename result_type_impl<function_type_t<F>>::type;
template<class... Args>struct argument_type_impl{using type= void;};
template<class R,class... Args>struct argument_type_impl<R(*)(Args...)>{using type= std::tuple<Args...>;};
template<class C,class R,class... Args>struct argument_type_impl<R(C::*)(Args...)>{using type= std::tuple<Args...>;};
template<class C,class R,class... Args>struct argument_type_impl<R(C::*)(Args...)const>{using type= std::tuple<Args...>;};
template<class F> using argument_type_t= typename argument_type_impl<function_type_t<F>>::type;
}
using function_template_internal::result_type_t,function_template_internal::argument_type_t;
// clang-format on
#line 2 "src/Optimization/MinMaxEnum.hpp"
enum MinMaxEnum { MAXIMIZE= -1, MINIMIZE= 1 };
#line 6 "src/Optimization/fibonacci_search.hpp"
// [l,r]
template <MinMaxEnum obj, class F> std::pair<int64_t, result_type_t<F>> fibonacci_search(const F &f, int64_t l, int64_t r) {
 assert(l <= r);
 int64_t s= 1, t= 2, a= l - 1, x, b, y;
 for (int64_t e= r - l + 2; t < e;) std::swap(s+= t, t);
 b= a + t, x= b - s;
 result_type_t<F> fx= f(x), fy;
 for (bool g; a + b != 2 * x;) {
  if (y= a + b - x; r < y) b= a, a= y;
  else {
   if constexpr (obj == MINIMIZE) g= fx < (fy= f(y));
   else g= fx > (fy= f(y));
   if (g) b= a, a= y;
   else a= x, x= y, fx= fy;
  }
 }
 return {x, fx};
}
#line 7 "test/yukicoder/2276.test.cpp"
using namespace std;
signed main() {
 cin.tie(0);
 ios::sync_with_stdio(0);
 int N;
 cin >> N;
 string S;
 cin >> S;
 vector<int> p;
 for (int i= 0; i < N; ++i)
  if (S[i] == '?') p.push_back(i);
 auto f= [&](int n) {
  for (int i= 0; i < n; ++i) S[p[i]]= 'A';
  for (int i= n; i < (int)p.size(); ++i) S[p[i]]= 'C';
  long long a= 0, ret= 0;
  for (int i= 0; i < N; ++i) {
   if (S[i] == 'A') ++a;
   else ret+= a;
  }
  return ret;
 };
 auto [x, fx]= fibonacci_search<MAXIMIZE>(f, 0, p.size());
 cout << fx << '\n';
 return 0;
}

Test cases

Env	Name	Status	Elapsed	Memory
g++-13	0_sample_1.txt	AC	6 ms	4 MB
g++-13	0_sample_2.txt	AC	5 ms	4 MB
g++-13	0_sample_3.txt	AC	4 ms	4 MB
g++-13	1_min_1.txt	AC	5 ms	4 MB
g++-13	1_min_2.txt	AC	5 ms	4 MB
g++-13	1_min_3.txt	AC	4 ms	4 MB
g++-13	1_min_4.txt	AC	4 ms	4 MB
g++-13	1_min_5.txt	AC	4 ms	4 MB
g++-13	1_min_6.txt	AC	4 ms	3 MB
g++-13	1_min_7.txt	AC	4 ms	4 MB
g++-13	1_min_8.txt	AC	4 ms	4 MB
g++-13	2_random_1.txt	AC	9 ms	4 MB
g++-13	2_random_10.txt	AC	17 ms	4 MB
g++-13	2_random_11.txt	AC	10 ms	4 MB
g++-13	2_random_12.txt	AC	6 ms	4 MB
g++-13	2_random_2.txt	AC	19 ms	4 MB
g++-13	2_random_3.txt	AC	9 ms	4 MB
g++-13	2_random_4.txt	AC	6 ms	4 MB
g++-13	2_random_5.txt	AC	12 ms	4 MB
g++-13	2_random_6.txt	AC	11 ms	4 MB
g++-13	2_random_7.txt	AC	17 ms	4 MB
g++-13	2_random_8.txt	AC	14 ms	4 MB
g++-13	2_random_9.txt	AC	5 ms	4 MB
g++-13	3_max_1.txt	AC	21 ms	4 MB
g++-13	3_max_10.txt	AC	21 ms	4 MB
g++-13	3_max_11.txt	AC	21 ms	4 MB
g++-13	3_max_12.txt	AC	17 ms	5 MB
g++-13	3_max_2.txt	AC	21 ms	4 MB
g++-13	3_max_3.txt	AC	21 ms	4 MB
g++-13	3_max_4.txt	AC	19 ms	4 MB
g++-13	3_max_5.txt	AC	22 ms	4 MB
g++-13	3_max_6.txt	AC	16 ms	4 MB
g++-13	3_max_7.txt	AC	14 ms	4 MB
g++-13	3_max_8.txt	AC	21 ms	4 MB
g++-13	3_max_9.txt	AC	11 ms	4 MB
g++-13	4_1type_1.txt	AC	6 ms	4 MB
g++-13	4_1type_2.txt	AC	5 ms	4 MB
g++-13	4_1type_3.txt	AC	12 ms	5 MB
g++-13	4_1type_4.txt	AC	6 ms	4 MB
g++-13	4_1type_5.txt	AC	6 ms	4 MB
g++-13	4_1type_6.txt	AC	5 ms	4 MB
g++-13	4_1type_7.txt	AC	6 ms	4 MB
g++-13	4_1type_8.txt	AC	12 ms	5 MB
g++-13	4_1type_9.txt	AC	12 ms	5 MB
g++-13	5_2types_1.txt	AC	6 ms	4 MB
g++-13	5_2types_2.txt	AC	21 ms	4 MB
g++-13	5_2types_3.txt	AC	21 ms	4 MB
g++-13	5_2types_4.txt	AC	10 ms	4 MB
g++-13	5_2types_5.txt	AC	10 ms	4 MB
g++-13	5_2types_6.txt	AC	21 ms	4 MB
g++-13	5_2types_7.txt	AC	21 ms	4 MB
g++-13	5_2types_8.txt	AC	21 ms	4 MB
g++-13	5_2types_9.txt	AC	21 ms	4 MB
g++-13	6_biased_1.txt	AC	19 ms	4 MB
g++-13	6_biased_2.txt	AC	10 ms	4 MB
g++-13	6_biased_3.txt	AC	11 ms	4 MB
g++-13	6_biased_4.txt	AC	9 ms	4 MB
g++-13	7_special_1.txt	AC	8 ms	4 MB
g++-13	7_special_2.txt	AC	7 ms	4 MB
clang++-18	0_sample_1.txt	AC	5 ms	4 MB
clang++-18	0_sample_2.txt	AC	5 ms	4 MB
clang++-18	0_sample_3.txt	AC	5 ms	4 MB
clang++-18	1_min_1.txt	AC	5 ms	4 MB
clang++-18	1_min_2.txt	AC	5 ms	4 MB
clang++-18	1_min_3.txt	AC	5 ms	4 MB
clang++-18	1_min_4.txt	AC	5 ms	4 MB
clang++-18	1_min_5.txt	AC	5 ms	4 MB
clang++-18	1_min_6.txt	AC	5 ms	4 MB
clang++-18	1_min_7.txt	AC	5 ms	4 MB
clang++-18	1_min_8.txt	AC	5 ms	4 MB
clang++-18	2_random_1.txt	AC	6 ms	4 MB
clang++-18	2_random_10.txt	AC	11 ms	4 MB
clang++-18	2_random_11.txt	AC	7 ms	4 MB
clang++-18	2_random_12.txt	AC	6 ms	4 MB
clang++-18	2_random_2.txt	AC	9 ms	4 MB
clang++-18	2_random_3.txt	AC	6 ms	4 MB
clang++-18	2_random_4.txt	AC	6 ms	4 MB
clang++-18	2_random_5.txt	AC	7 ms	4 MB
clang++-18	2_random_6.txt	AC	7 ms	4 MB
clang++-18	2_random_7.txt	AC	10 ms	4 MB
clang++-18	2_random_8.txt	AC	8 ms	4 MB
clang++-18	2_random_9.txt	AC	5 ms	4 MB
clang++-18	3_max_1.txt	AC	9 ms	4 MB
clang++-18	3_max_10.txt	AC	10 ms	4 MB
clang++-18	3_max_11.txt	AC	10 ms	4 MB
clang++-18	3_max_12.txt	AC	11 ms	5 MB
clang++-18	3_max_2.txt	AC	10 ms	4 MB
clang++-18	3_max_3.txt	AC	9 ms	4 MB
clang++-18	3_max_4.txt	AC	11 ms	4 MB
clang++-18	3_max_5.txt	AC	10 ms	4 MB
clang++-18	3_max_6.txt	AC	9 ms	4 MB
clang++-18	3_max_7.txt	AC	8 ms	4 MB
clang++-18	3_max_8.txt	AC	10 ms	4 MB
clang++-18	3_max_9.txt	AC	8 ms	4 MB
clang++-18	4_1type_1.txt	AC	5 ms	4 MB
clang++-18	4_1type_2.txt	AC	5 ms	4 MB
clang++-18	4_1type_3.txt	AC	12 ms	5 MB
clang++-18	4_1type_4.txt	AC	6 ms	4 MB
clang++-18	4_1type_5.txt	AC	6 ms	4 MB
clang++-18	4_1type_6.txt	AC	6 ms	4 MB
clang++-18	4_1type_7.txt	AC	6 ms	4 MB
clang++-18	4_1type_8.txt	AC	12 ms	5 MB
clang++-18	4_1type_9.txt	AC	13 ms	5 MB
clang++-18	5_2types_1.txt	AC	6 ms	4 MB
clang++-18	5_2types_2.txt	AC	11 ms	4 MB
clang++-18	5_2types_3.txt	AC	11 ms	4 MB
clang++-18	5_2types_4.txt	AC	6 ms	4 MB
clang++-18	5_2types_5.txt	AC	6 ms	4 MB
clang++-18	5_2types_6.txt	AC	11 ms	4 MB
clang++-18	5_2types_7.txt	AC	11 ms	4 MB
clang++-18	5_2types_8.txt	AC	11 ms	4 MB
clang++-18	5_2types_9.txt	AC	11 ms	4 MB
clang++-18	6_biased_1.txt	AC	10 ms	4 MB
clang++-18	6_biased_2.txt	AC	9 ms	4 MB
clang++-18	6_biased_3.txt	AC	8 ms	4 MB
clang++-18	6_biased_4.txt	AC	8 ms	4 MB
clang++-18	7_special_1.txt	AC	8 ms	4 MB
clang++-18	7_special_2.txt	AC	7 ms	4 MB

Back to top page