#859169 (C++17) No.2268 NGワード回避

• 問題: No.2268 NGワード回避
• ユーザー: sten_san
• 提出日時: 2023-04-14 21:37:36
• 言語: C++17 (gcc 15.2.0 + boost 1.90.0)
• 結果: CE
  (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 3,082 bytes
• コンパイル時間: 1,165 ms
• コンパイル使用メモリ: 204,304 KB
• 最終ジャッジ日時: 2026-06-30 07:23:33
• 合計ジャッジ時間: 1,870 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_0

コンパイルメッセージ

main.cpp: In instantiation of 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:33, int)>&]':
main.cpp:73:34:   required from 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:33, int)>]'
   73 |         return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
      |                               ~~~^~~~~~~~~~~~~~~~
main.cpp:87:8:   required from here
   87 |     fix([&](auto f, int d = 0) -> bool {
      |     ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   88 |         if (n <= d) {
      |         ~~~~~~~~~~~~~
   89 |             if (s.find(w) == end(s)) {
      |             ~~~~~~~~~~~~~~~~~~~~~~~~~~
   90 |                 return true;
      |                 ~~~~~~~~~~~~
   91 |             }
      |             ~
   92 |             return false;
      |             ~~~~~~~~~~~~~
   93 |         }
      |         ~
   94 | 
      |         
   95 |         w += 'a';
      |         ~~~~~~~~~
   96 |         if (f(d + 1)) {
      |         ~~~~~~~~~~~~~~~
   97 |             return true;
      |             ~~~~~~~~~~~~
   98 |         }
      |         ~
   99 |         w.pop_back();
      |         ~~~~~~~~~~~~~
  100 | 
      |         
  101 |         w += 'b';
      |         ~~~~~~~~~
  102 |         if (f(d + 1)) {
      |         ~~~~~~~~~~~~~~~
  103 |             return true;
      |             ~~~~~~~~~~~~
  104 |         }
      |         ~
  105 |         w.pop_back();
      |         ~~~~~~~~~~~~~
  106 | 
      |         
  107 |         return false;
      |         ~~~~~~~~~~~~~
  108 |     })();
      |     ~~  
main.cpp:73:34: error: use of 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:33, int)>&]' before deduction of 'auto'
   73 |         return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
      |                               ~~~^~~~~~~~~~~~~~~~
main.cpp:73:34: error: use of 'constexpr auto fix(F&&) [with F = main()::<lambda(auto:33, int)>&]' before deduction of 'a

ソースコード

#include <bits/stdc++.h>
using namespace std;

struct iofast_t {
    iofast_t() {
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} iofast;

struct uns_t {} uns;
template <typename Element, typename Head, typename ...Args>
auto vec(Element init, Head arg, Args ...args) {
    if constexpr (sizeof...(Args) == 0) return vector(arg, init);
    else return vector(arg, vec(init, args...));
}
template <typename Element, typename Head, typename ...Args>
auto vec(uns_t, Head arg, Args ...args) {
    return vec(Element(), arg, args...);
}

template <typename Container>
auto distance(const Container &c, decltype(begin(c)) iter) {
    return distance(begin(c), iter);
}

template <typename RIter, typename Compare = less<typename iterator_traits<RIter>::value_type>>
auto isort(RIter first, RIter last, Compare comp = Compare()) {
    vector<int> i(distance(first, last));
    iota(begin(i), end(i), 0);
    sort(begin(i), end(i), [&](auto x, auto y) {
        return comp(*(first + x), *(first + y));
    });
    return i;
}

template <typename, template <typename> typename, typename = void_t<>>
struct detect : false_type {};
template <typename T, template <typename> typename Check>
struct detect<T, Check, void_t<Check<T>>> : true_type {};
template <typename T, template <typename> typename Check>
constexpr inline bool detect_v = detect<T, Check>::value;

template <typename T>
using has_member_sort = decltype(declval<T>().sort());

template <typename Container, typename Compare = less<typename Container::value_type>>
auto sorted(Container c, Compare comp = Compare()) {
    if constexpr (detect_v<Container, has_member_sort>) {
        c.sort(comp);
        return c;
    }
    else {
        sort(begin(c), end(c), comp);
        return c;
    }
}

template <typename Container, typename Compare = equal_to<typename Container::value_type>>
auto uniqued(Container c, Compare comp = Compare()) {
    c.erase(unique(begin(c), end(c), comp), end(c));
    return c;
}

template <typename T, typename Compare = less<T>>
T &chmin(T &l, T r, Compare &&f = less<T>()) { return l = min(l, r, f); }
template <typename T, typename Compare = less<T>>
T &chmax(T &l, T r, Compare &&f = less<T>()) { return l = max(l, r, f); }

template <typename F>
constexpr auto fix(F &&f) noexcept {
    return [f = std::tuple<F>(std::forward<F>(f))](auto &&...args) mutable {
        return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
    };
}

int main() {
    int n; cin >> n;

    set<string> s;
    for (int i = 0; i < n; ++i) {
        string v; cin >> v;
        s.insert(v);
    }

    string w = "";
    fix([&](auto f, int d = 0) -> bool {
        if (n <= d) {
            if (s.find(w) == end(s)) {
                return true;
            }
            return false;
        }

        w += 'a';
        if (f(d + 1)) {
            return true;
        }
        w.pop_back();

        w += 'b';
        if (f(d + 1)) {
            return true;
        }
        w.pop_back();

        return false;
    })();

    cout << w << endl;
}