#608677 (C++17) No.1359 [Zelkova 3rd Tune] 四人セゾン

提出ソース

結果

問題	No.1359 [Zelkova 3rd Tune] 四人セゾン
ユーザー	hitonanode
提出日時	2021-01-22 22:15:16
言語	C++17 (gcc 12.3.0 + boost 1.83.0)
結果	AC
実行時間	335 ms / 2,000 ms
コード長	9,744 bytes
コンパイル時間	2,332 ms
コンパイル使用メモリ	216,228 KB
実行使用メモリ	7,168 KB
最終ジャッジ日時	2024-06-08 15:23:59
合計ジャッジ時間	19,984 ms
ジャッジサーバーID （参考情報）	judge3 / judge5

このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示

入力	結果	実行時間実行使用メモリ
testcase_00	AC	2 ms 5,248 KB
testcase_01	AC	2 ms 5,376 KB
testcase_02	AC	2 ms 5,376 KB
testcase_03	AC	147 ms 5,376 KB
testcase_04	AC	138 ms 5,376 KB
testcase_05	AC	111 ms 5,376 KB
testcase_06	AC	112 ms 5,376 KB
testcase_07	AC	165 ms 6,016 KB
testcase_08	AC	179 ms 6,016 KB
testcase_09	AC	46 ms 5,376 KB
testcase_10	AC	50 ms 5,376 KB
testcase_11	AC	212 ms 6,784 KB
testcase_12	AC	230 ms 6,656 KB
testcase_13	AC	136 ms 5,632 KB
testcase_14	AC	146 ms 5,376 KB
testcase_15	AC	121 ms 5,376 KB
testcase_16	AC	140 ms 5,376 KB
testcase_17	AC	227 ms 6,784 KB
testcase_18	AC	267 ms 6,784 KB
testcase_19	AC	199 ms 6,400 KB
testcase_20	AC	218 ms 6,272 KB
testcase_21	AC	252 ms 6,528 KB
testcase_22	AC	211 ms 6,656 KB
testcase_23	AC	144 ms 5,888 KB
testcase_24	AC	144 ms 5,632 KB
testcase_25	AC	25 ms 5,376 KB
testcase_26	AC	24 ms 5,376 KB
testcase_27	AC	75 ms 5,376 KB
testcase_28	AC	105 ms 5,376 KB
testcase_29	AC	93 ms 5,376 KB
testcase_30	AC	93 ms 5,376 KB
testcase_31	AC	155 ms 5,376 KB
testcase_32	AC	125 ms 5,376 KB
testcase_33	AC	109 ms 5,376 KB
testcase_34	AC	91 ms 5,376 KB
testcase_35	AC	124 ms 5,376 KB
testcase_36	AC	120 ms 5,376 KB
testcase_37	AC	30 ms 5,376 KB
testcase_38	AC	27 ms 5,376 KB
testcase_39	AC	22 ms 5,376 KB
testcase_40	AC	21 ms 5,376 KB
testcase_41	AC	45 ms 5,376 KB
testcase_42	AC	42 ms 5,376 KB
testcase_43	AC	43 ms 5,376 KB
testcase_44	AC	242 ms 6,912 KB
testcase_45	AC	98 ms 5,376 KB
testcase_46	AC	35 ms 5,376 KB
testcase_47	AC	196 ms 5,632 KB
testcase_48	AC	151 ms 5,632 KB
testcase_49	AC	151 ms 5,760 KB
testcase_50	AC	119 ms 5,376 KB
testcase_51	AC	8 ms 5,376 KB
testcase_52	AC	214 ms 6,400 KB
testcase_53	AC	228 ms 7,168 KB
testcase_54	AC	240 ms 7,040 KB
testcase_55	AC	245 ms 7,168 KB
testcase_56	AC	242 ms 7,168 KB
testcase_57	AC	248 ms 7,168 KB
testcase_58	AC	240 ms 7,168 KB
testcase_59	AC	239 ms 7,040 KB
testcase_60	AC	232 ms 7,040 KB
testcase_61	AC	258 ms 7,168 KB
testcase_62	AC	239 ms 7,040 KB
testcase_63	AC	335 ms 7,168 KB
testcase_64	AC	277 ms 7,168 KB
testcase_65	AC	241 ms 7,040 KB
testcase_66	AC	255 ms 7,040 KB
testcase_67	AC	245 ms 7,168 KB
testcase_68	AC	235 ms 7,040 KB
testcase_69	AC	218 ms 7,040 KB
testcase_70	AC	223 ms 7,168 KB
testcase_71	AC	217 ms 7,168 KB
testcase_72	AC	244 ms 7,040 KB
testcase_73	AC	254 ms 7,040 KB
testcase_74	AC	230 ms 7,168 KB
testcase_75	AC	233 ms 7,168 KB
testcase_76	AC	230 ms 7,168 KB
testcase_77	AC	232 ms 7,040 KB

権限があれば一括ダウンロードができます

ソースコード

raw source code

#include <bits/stdc++.h>
using namespace std;
using lint = long long;
using pint = pair<int, int>;
using plint = pair<lint, lint>;
struct fast_ios { fast_ios(){ cin.tie(nullptr), ios::sync_with_stdio(false), cout << fixed << setprecision(20); }; } fast_ios_;
#define ALL(x) (x).begin(), (x).end()
#define FOR(i, begin, end) for(int i=(begin),i##_end_=(end);i<i##_end_;i++)
#define IFOR(i, begin, end) for(int i=(end)-1,i##_begin_=(begin);i>=i##_begin_;i--)
#define REP(i, n) FOR(i,0,n)
#define IREP(i, n) IFOR(i,0,n)
template <typename T, typename V>
void ndarray(vector<T>& vec, const V& val, int len) { vec.assign(len, val); }
template <typename T, typename V, typename... Args> void ndarray(vector<T>& vec, const V& val, int len, Args... args) { vec.resize(len), for_each(begin(vec), end(vec), [&](T& v) { ndarray(v, val, args...); }); }
template <typename T> bool chmax(T &m, const T q) { if (m < q) {m = q; return true;} else return false; }
template <typename T> bool chmin(T &m, const T q) { if (m > q) {m = q; return true;} else return false; }
int floor_lg(long long x) { return x <= 0 ? -1 : 63 - __builtin_clzll(x); }
template <typename T1, typename T2> pair<T1, T2> operator+(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first + r.first, l.second + r.second); }
template <typename T1, typename T2> pair<T1, T2> operator-(const pair<T1, T2> &l, const pair<T1, T2> &r) { return make_pair(l.first - r.first, l.second - r.second); }
template <typename T> vector<T> sort_unique(vector<T> vec) { sort(vec.begin(), vec.end()), vec.erase(unique(vec.begin(), vec.end()), vec.end()); return vec; }
template <typename T> istream &operator>>(istream &is, vector<T> &vec) { for (auto &v : vec) is >> v; return is; }
template <typename T> ostream &operator<<(ostream &os, const vector<T> &vec) { os << '['; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T, size_t sz> ostream &operator<<(ostream &os, const array<T, sz> &arr) { os << '['; for (auto v : arr) os << v << ','; os << ']'; return os; }
#if __cplusplus >= 201703L
template <typename... T> istream &operator>>(istream &is, tuple<T...> &tpl) { std::apply([&is](auto &&... args) { ((is >> args), ...);}, tpl); return is; }
template <typename... T> ostream &operator<<(ostream &os, const tuple<T...> &tpl) { std::apply([&os](auto &&... args) { ((os << args << ','), ...);}, tpl); return os; }
#endif
template <typename T> ostream &operator<<(ostream &os, const deque<T> &vec) { os << "deq["; for (auto v : vec) os << v << ','; os << ']'; return os; }
template <typename T> ostream &operator<<(ostream &os, const set<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T, typename TH> ostream &operator<<(ostream &os, const unordered_set<T, TH> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T> ostream &operator<<(ostream &os, const unordered_multiset<T> &vec) { os << '{'; for (auto v : vec) os << v << ','; os << '}'; return os; }
template <typename T1, typename T2> ostream &operator<<(ostream &os, const pair<T1, T2> &pa) { os << '(' << pa.first << ',' << pa.second << ')'; return os; }
template <typename TK, typename TV> ostream &operator<<(ostream &os, const map<TK, TV> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
template <typename TK, typename TV, typename TH> ostream &operator<<(ostream &os, const unordered_map<TK, TV, TH> &mp) { os << '{'; for (auto v : mp) os << v.first << "=>" << v.second << ','; os << '}'; return os; }
#ifdef HITONANODE_LOCAL
const string COLOR_RESET = "\033[0m", BRIGHT_GREEN = "\033[1;32m", BRIGHT_RED = "\033[1;31m", BRIGHT_CYAN = "\033[1;36m", NORMAL_CROSSED = "\033[0;9;37m", RED_BACKGROUND = "\033[1;41m", NORMAL_FAINT = "\033[0;2m";
#define dbg(x) cerr << BRIGHT_CYAN << #x << COLOR_RESET << " = " << (x) << NORMAL_FAINT << " (L" << __LINE__ << ") " << __FILE__ << COLOR_RESET << endl
#else
#define dbg(x) (x)
#endif

struct ModIntRuntime {
    using lint = long long int;
    static int get_mod() { return mod; }
    int val;
    static int mod;
    static std::vector<ModIntRuntime> &facs() {
        static std::vector<ModIntRuntime> facs_;
        return facs_;
    }
    static int &get_primitive_root() {
        static int primitive_root_ = 0;
        if (!primitive_root_) {
            primitive_root_ = [&]() {
                std::set<int> fac;
                int v = mod - 1;
                for (lint i = 2; i * i <= v; i++)
                    while (v % i == 0) fac.insert(i), v /= i;
                if (v > 1) fac.insert(v);
                for (int g = 1; g < mod; g++) {
                    bool ok = true;
                    for (auto i : fac)
                        if (ModIntRuntime(g).power((mod - 1) / i) == 1) {
                            ok = false;
                            break;
                        }
                    if (ok) return g;
                }
                return -1;
            }();
        }
        return primitive_root_;
    }
    static void set_mod(const int &m) {
        if (mod != m) facs().clear();
        mod = m;
        get_primitive_root() = 0;
    }
    ModIntRuntime &_setval(lint v) {
        val = (v >= mod ? v - mod : v);
        return *this;
    }
    ModIntRuntime() : val(0) {}
    ModIntRuntime(lint v) { _setval(v % mod + mod); }
    explicit operator bool() const { return val != 0; }
    ModIntRuntime operator+(const ModIntRuntime &x) const { return ModIntRuntime()._setval((lint)val + x.val); }
    ModIntRuntime operator-(const ModIntRuntime &x) const { return ModIntRuntime()._setval((lint)val - x.val + mod); }
    ModIntRuntime operator*(const ModIntRuntime &x) const { return ModIntRuntime()._setval((lint)val * x.val % mod); }
    ModIntRuntime operator/(const ModIntRuntime &x) const { return ModIntRuntime()._setval((lint)val * x.inv() % mod); }
    ModIntRuntime operator-() const { return ModIntRuntime()._setval(mod - val); }
    ModIntRuntime &operator+=(const ModIntRuntime &x) { return *this = *this + x; }
    ModIntRuntime &operator-=(const ModIntRuntime &x) { return *this = *this - x; }
    ModIntRuntime &operator*=(const ModIntRuntime &x) { return *this = *this * x; }
    ModIntRuntime &operator/=(const ModIntRuntime &x) { return *this = *this / x; }
    friend ModIntRuntime operator+(lint a, const ModIntRuntime &x) { return ModIntRuntime()._setval(a % mod + x.val); }
    friend ModIntRuntime operator-(lint a, const ModIntRuntime &x) { return ModIntRuntime()._setval(a % mod - x.val + mod); }
    friend ModIntRuntime operator*(lint a, const ModIntRuntime &x) { return ModIntRuntime()._setval(a % mod * x.val % mod); }
    friend ModIntRuntime operator/(lint a, const ModIntRuntime &x) { return ModIntRuntime()._setval(a % mod * x.inv() % mod); }
    bool operator==(const ModIntRuntime &x) const { return val == x.val; }
    bool operator!=(const ModIntRuntime &x) const { return val != x.val; }
    bool operator<(const ModIntRuntime &x) const { return val < x.val; } // To use std::map<ModIntRuntime, T>
    friend std::istream &operator>>(std::istream &is, ModIntRuntime &x) {
        lint t;
        return is >> t, x = ModIntRuntime(t), is;
    }
    friend std::ostream &operator<<(std::ostream &os, const ModIntRuntime &x) { return os << x.val; }

    lint power(lint n) const {
        lint ans = 1, tmp = this->val;
        while (n) {
            if (n & 1) ans = ans * tmp % mod;
            tmp = tmp * tmp % mod;
            n /= 2;
        }
        return ans;
    }
    ModIntRuntime pow(lint n) const { return power(n); }
    lint inv() const { return this->power(mod - 2); }

    ModIntRuntime fac() const {
        int l0 = facs().size();
        if (l0 > this->val) return facs()[this->val];

        facs().resize(this->val + 1);
        for (int i = l0; i <= this->val; i++) facs()[i] = (i == 0 ? ModIntRuntime(1) : facs()[i - 1] * ModIntRuntime(i));
        return facs()[this->val];
    }

    ModIntRuntime doublefac() const {
        lint k = (this->val + 1) / 2;
        return (this->val & 1) ? ModIntRuntime(k * 2).fac() / (ModIntRuntime(2).pow(k) * ModIntRuntime(k).fac()) : ModIntRuntime(k).fac() * ModIntRuntime(2).pow(k);
    }

    ModIntRuntime nCr(const ModIntRuntime &r) const { return (this->val < r.val) ? ModIntRuntime(0) : this->fac() / ((*this - r).fac() * r.fac()); }

    ModIntRuntime sqrt() const {
        if (val == 0) return 0;
        if (mod == 2) return val;
        if (power((mod - 1) / 2) != 1) return 0;
        ModIntRuntime b = 1;
        while (b.power((mod - 1) / 2) == 1) b += 1;
        int e = 0, m = mod - 1;
        while (m % 2 == 0) m >>= 1, e++;
        ModIntRuntime x = power((m - 1) / 2), y = (*this) * x * x;
        x *= (*this);
        ModIntRuntime z = b.power(m);
        while (y != 1) {
            int j = 0;
            ModIntRuntime t = y;
            while (t != 1) j++, t *= t;
            z = z.power(1LL << (e - j - 1));
            x *= z, z *= z, y *= z;
            e = j;
        }
        return ModIntRuntime(std::min(x.val, mod - x.val));
    }
};
int ModIntRuntime::mod = 1;
using mint = ModIntRuntime;
int main() {
    int N, K, M;
    cin >> N >> K >> M;
    mint::set_mod(M);
    vector V(4, vector<int>(N));
    cin >> V;
    for (auto &vec : V) sort(vec.begin(), vec.end());
    mint ret = 0;
    REP(i, N) {
        int lo = 1 << 30, hi = 0;
        REP(d, 4) chmin(lo, V[d][i]), chmax(hi, V[d][i]);
        ret += mint(hi - lo).pow(K);
    }
    cout << ret << '\n';
}

yukicoder

結果

テストケース

ソースコード