#864192 (C++17) No.2285 Make A Unit Square

• 問題: No.2285 Make A Unit Square
• ユーザー: sten_san
• 提出日時: 2023-04-29 02:35:51
• 言語: C++17 (gcc 15.2.0 + boost 1.90.0)
• 結果: CE (最新)
  AC
  (最初)
• 実行時間: -
• コード長: 3,520 bytes
• コンパイル時間: 1,649 ms
• コンパイル使用メモリ: 268,900 KB
• 最終ジャッジ日時: 2026-06-30 11:27:55
• 合計ジャッジ時間: 2,247 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_0

コンパイルメッセージ

main.cpp: In instantiation of 'constexpr auto fix(F&&) [with F = <lambda()>::<lambda(auto:33, int)>&]':
main.cpp:73:34:   required from 'constexpr auto fix(F&&) [with F = <lambda()>::<lambda(auto:33, int)>]'
   73 |         return std::get<0>(f)(fix(std::get<0>(f)), std::forward<decltype(args)>(args)...);
      |                               ~~~^~~~~~~~~~~~~~~~
main.cpp:82:17:   required from here
   82 |     auto f = fix([&](auto f, int k) -> int {
      |              ~~~^~~~~~~~~~~~~~~~~~~~~~~~~~~~
   83 |         auto &g = dp[k];
      |         ~~~~~~~~~~~~~~~~
   84 | 
      |                  
   85 |         if (g.has_value()) {
      |         ~~~~~~~~~~~~~~~~~~~~
   86 |             return *g;
      |             ~~~~~~~~~~
   87 |         }
      |         ~        
   88 | 
      |                  
   89 |         array<int, 14> c = {};
      |         ~~~~~~~~~~~~~~~~~~~~~~
   90 |         for (int i = 2; i < k - 1; ++i) {
      |         ~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~
   91 |             ++c[f(i) ^ f(k - i)];
      |             ~~~~~~~~~~~~~~~~~~~~~
   92 |         }
      |         ~        
   93 | 
      |                  
   94 |         g = 0;
      |         ~~~~~~   
   95 |         while (0 < c[*g]) {
      |         ~~~~~~~~~~~~~~~~~~~
   96 |             ++*g;
      |             ~~~~~
   97 |         }
      |         ~        
   98 | 
      |                  
   99 |         return *g;
      |         ~~~~~~~~~~
  100 |     });
      |     ~~           
main.cpp:73:34: error: use of 'constexpr auto fix(F&&) [with F = <lambda()>::<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 = <lambda()>::<lambda(auto:33, int)>&]' before deduction of 'auto'

ソースコード

#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)...);
    };
}

constexpr auto g = []() {
    constexpr auto lim = 55 + 34 + 2;

    array<optional<int>, lim> dp = {}; dp[2] = 0;

    auto f = fix([&](auto f, int k) -> int {
        auto &g = dp[k];

        if (g.has_value()) {
            return *g;
        }

        array<int, 14> c = {};
        for (int i = 2; i < k - 1; ++i) {
            ++c[f(i) ^ f(k - i)];
        }

        g = 0;
        while (0 < c[*g]) {
            ++*g;
        }

        return *g;
    });

    array<int, lim> g = {};
    for (int i = 2; i < lim; ++i) {
        g[i] = f(i);
    }

    return g;
}();

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

    while (t--) {
        int a, b; cin >> a >> b;

        a = [&]() {
            if (a < 57) {
                return g[a];
            }
            return g[(a - 57) % 34 + 57];
        }();

        b = [&]() {
            if (b < 57) {
                return g[b];
            }
            return g[(b - 57) % 34 + 57];
        }();

        cout << ((a ^ b) ? "First" : "Second") << '\n';
    }

    cout << flush;
}