#1167278 (C++23) No.3557 KCPC or KUPC 2

• 問題: No.3557 KCPC or KUPC 2
• ユーザー: a_s_k
• 提出日時: 2026-05-29 19:19:51
• 言語: C++23 (gcc 15.2.0 + boost 1.89.0)
• 結果: AC
• 実行時間: 2 ms / 2,000 ms
• コード長: 4,130 bytes
• コンパイル時間: 5,361 ms
• コンパイル使用メモリ: 385,012 KB
• 実行使用メモリ: 6,400 KB
• 最終ジャッジ日時: 2026-05-29 19:20:02
• 合計ジャッジ時間: 7,852 ms
• ジャッジサーバーID （参考情報）: judge3_0 / judge2_0

サブタスク	配点	結果
部分点1	10 %	AC * 30
部分点2	40 %	AC * 30
部分点3	50 %	AC * 30
合計	100 点

ソースコード

#include "bits/stdc++.h"
#include "atcoder/all"
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#include <ext/pb_ds/tag_and_trait.hpp>
using namespace __gnu_pbds;
using namespace std;
using namespace atcoder;
using ll = __int128_t;
using ld = long double;
using ull = unsigned long long;
#define rep(i, m, n) for (ll i = (ll)m; i < (ll)n; i++)
#define drep(i, m, n) for (ll i = m - 1; i >= n; i--)
#define Endl endl
#define all(a) a.begin(), a.end()
#define pr(i, j) make_pair(i, j)
#define isin(x, l, r) (l <= x && x < r)
template <typename T>
bool chmin(T &a, T b)
{
    if (a > b)
    {
        a = b;
        return true;
    }
    return false;
};
template <typename T>
bool chmax(T &a, T b)
{
    if (a < b)
    {
        a = b;
        return true;
    }
    return false;
};
#define srt(ar) sort(ar.begin(), ar.end())
#define rev(ar) reverse(ar.begin(), ar.end())
#define jge(f, s, t) cout << (f ? s : t) << endl
template <typename T>
using ordered_set = tree<T, null_type, std::less<T>, rb_tree_tag, tree_order_statistics_node_update>;
#pragma GCC target("avx2")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")

#define printar(ar)             \
    do                          \
    {                           \
        for (auto dbg : ar)     \
        {                       \
            cout << dbg << " "; \
        }                       \
        cout << endl;           \
    } while (0)
const ll inf = 1e18;
const ld pi = 3.14159265358979;
const ld eps = 1e-9;
template <class T, ll n, ll idx = 0>
auto make_vec(const ll (&d)[n], const T &init) noexcept
{
    if constexpr (idx < n)
        return std::vector(d[idx], make_vec<T, n, idx + 1>(d, init));
    else
        return init;
}

template <class T, ll n>
auto make_vec(const ll (&d)[n]) noexcept
{
    return make_vec(d, T{});
}
//////////////// 以下を貼る ////////////////
template <class T>
size_t HashCombine(const size_t seed, const T &v)
{
    return seed ^ (std::hash<T>()(v) + 0x9e3779b9 + (seed << 6) + (seed >> 2));
}
/* pair用 */
template <class T, class S>
struct std::hash<std::pair<T, S>>
{
    size_t operator()(const std::pair<T, S> &keyval) const noexcept
    {
        return HashCombine(std::hash<T>()(keyval.first), keyval.second);
    }
};
/* vector用 */
template <class T>
struct std::hash<std::vector<T>>
{
    size_t operator()(const std::vector<T> &keyval) const noexcept
    {
        size_t s = 0;
        for (auto &&v : keyval)
            s = HashCombine(s, v);
        return s;
    }
};
/* tuple用 */
template <int N>
struct HashTupleCore
{
    template <class Tuple>
    size_t operator()(const Tuple &keyval) const noexcept
    {
        size_t s = HashTupleCore<N - 1>()(keyval);
        return HashCombine(s, std::get<N - 1>(keyval));
    }
};
template <>
struct HashTupleCore<0>
{
    template <class Tuple>
    size_t operator()(const Tuple &keyval) const noexcept { return 0; }
};
template <class... Args>
struct std::hash<std::tuple<Args...>>
{
    size_t operator()(const tuple<Args...> &keyval) const noexcept
    {
        return HashTupleCore<tuple_size<tuple<Args...>>::value>()(keyval);
    }
};
////////////////////////////////////////////
int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    long long n;
    cin >> n;
    int a, b, c, d, e, f;
    cin >> a >> b >> c >> d >> e >> f;
    function<ll(ll, ll, ll)> fn = [&](ll A, ll B, ll C)
    {
        ll ng = 0;
        ll ok = (ll)n / A + 1;
        while (ok - ng > 1)
        {
            ll md = (ok + ng) / 2;
            ll cnt = A * md;
            ll X = md / B;
            ll Y = md * X - X * (X + 1) / 2 * B;
            Y *= C;
            cnt += Y;
            if (cnt >= (ll)n)
            {
                ok = md;
            }
            else
            {
                ng = md;
            }
        }
        return ok;
    };
    ll X = fn(a, b, c);
    ll Y = fn(d, e, f);
    if (X == Y)
    {
        cout << "Same" << Endl;
    }
    else if (X < Y)
    {
        cout << "KCPC" << endl;
    }
    else
    {
        cout << "KUPC" << endl;
    }
}