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

• 問題: No.1359 [Zelkova 3rd Tune] 四人セゾン
• ユーザー: firiexp
• 提出日時: 2021-01-22 21:31:49
• 言語: C++17 (gcc 12.3.0 + boost 1.83.0)
• 結果: AC
• 実行時間: 262 ms / 2,000 ms
• コード長: 2,095 bytes
• コンパイル時間: 1,000 ms
• コンパイル使用メモリ: 106,648 KB
• 実行使用メモリ: 6,656 KB
• 最終ジャッジ日時: 2024-06-08 13:25:18
• 合計ジャッジ時間: 20,284 ms
• ジャッジサーバーID （参考情報）: judge5 / judge1

入力	結果	実行時間; 実行使用メモリ
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	123 ms; 5,376 KB
testcase_04	AC	121 ms; 5,376 KB
testcase_05	AC	116 ms; 5,376 KB
testcase_06	AC	118 ms; 5,376 KB
testcase_07	AC	169 ms; 5,632 KB
testcase_08	AC	165 ms; 5,632 KB
testcase_09	AC	46 ms; 5,376 KB
testcase_10	AC	47 ms; 5,376 KB
testcase_11	AC	211 ms; 6,144 KB
testcase_12	AC	216 ms; 6,016 KB
testcase_13	AC	140 ms; 5,376 KB
testcase_14	AC	137 ms; 5,376 KB
testcase_15	AC	124 ms; 5,376 KB
testcase_16	AC	120 ms; 5,376 KB
testcase_17	AC	228 ms; 6,400 KB
testcase_18	AC	234 ms; 6,144 KB
testcase_19	AC	203 ms; 6,016 KB
testcase_20	AC	197 ms; 6,016 KB
testcase_21	AC	231 ms; 6,272 KB
testcase_22	AC	231 ms; 6,144 KB
testcase_23	AC	155 ms; 5,376 KB
testcase_24	AC	157 ms; 5,376 KB
testcase_25	AC	24 ms; 5,376 KB
testcase_26	AC	22 ms; 5,376 KB
testcase_27	AC	76 ms; 5,376 KB
testcase_28	AC	82 ms; 5,376 KB
testcase_29	AC	97 ms; 5,376 KB
testcase_30	AC	95 ms; 5,376 KB
testcase_31	AC	135 ms; 5,376 KB
testcase_32	AC	125 ms; 5,376 KB
testcase_33	AC	98 ms; 5,376 KB
testcase_34	AC	94 ms; 5,376 KB
testcase_35	AC	125 ms; 5,376 KB
testcase_36	AC	123 ms; 5,376 KB
testcase_37	AC	26 ms; 5,376 KB
testcase_38	AC	25 ms; 5,376 KB
testcase_39	AC	22 ms; 5,376 KB
testcase_40	AC	21 ms; 5,376 KB
testcase_41	AC	47 ms; 5,376 KB
testcase_42	AC	47 ms; 5,376 KB
testcase_43	AC	38 ms; 5,376 KB
testcase_44	AC	245 ms; 6,528 KB
testcase_45	AC	104 ms; 5,376 KB
testcase_46	AC	35 ms; 5,376 KB
testcase_47	AC	171 ms; 5,376 KB
testcase_48	AC	161 ms; 5,504 KB
testcase_49	AC	159 ms; 5,376 KB
testcase_50	AC	120 ms; 5,376 KB
testcase_51	AC	7 ms; 5,376 KB
testcase_52	AC	210 ms; 5,888 KB
testcase_53	AC	232 ms; 6,528 KB
testcase_54	AC	243 ms; 6,528 KB
testcase_55	AC	259 ms; 6,528 KB
testcase_56	AC	240 ms; 6,656 KB
testcase_57	AC	248 ms; 6,656 KB
testcase_58	AC	258 ms; 6,656 KB
testcase_59	AC	236 ms; 6,528 KB
testcase_60	AC	232 ms; 6,528 KB
testcase_61	AC	226 ms; 6,528 KB
testcase_62	AC	249 ms; 6,528 KB
testcase_63	AC	257 ms; 6,400 KB
testcase_64	AC	261 ms; 6,528 KB
testcase_65	AC	234 ms; 6,656 KB
testcase_66	AC	229 ms; 6,400 KB
testcase_67	AC	235 ms; 6,656 KB
testcase_68	AC	224 ms; 6,528 KB
testcase_69	AC	220 ms; 6,528 KB
testcase_70	AC	219 ms; 6,656 KB
testcase_71	AC	214 ms; 6,656 KB
testcase_72	AC	262 ms; 6,528 KB
testcase_73	AC	255 ms; 6,528 KB
testcase_74	AC	253 ms; 6,656 KB
testcase_75	AC	256 ms; 6,656 KB
testcase_76	AC	251 ms; 6,528 KB
testcase_77	AC	253 ms; 6,528 KB

ソースコード

#include <iostream>
#include <algorithm>
#include <map>
#include <set>
#include <queue>
#include <stack>
#include <numeric>
#include <bitset>
#include <cmath>

static const int MOD = 1000000007;
using ll = long long;
using u32 = unsigned;
using u64 = unsigned long long;
using namespace std;

template<class T> constexpr T INF = ::numeric_limits<T>::max() / 32 * 15 + 208;

class modint {
    static u32 &mod() { static u32 mod_ = 0; return mod_; }
public:
    u32 val;
    modint(const u32 x = 0) : val(x % M()) {}
    u32 &value() noexcept { return val; }
    const u32 &value() const noexcept { return val; }
    modint operator+(const modint b) const { return modint(*this) += b; }
    modint operator-(const modint b) const { return modint(*this) -= b; }
    modint operator*(const modint b) const { return modint(*this) *= b; }
    modint operator/(const modint b) const { return modint(*this) /= b; }
    modint &operator+=(const modint b) { val += b.val; if (val >= M()) val -= M(); return *this; }
    modint &operator-=(const modint b) { if (val < b.val) val += M(); val -= b.val; return *this; }
    modint &operator*=(const modint b) { val = (u64)val * b.val % M(); return *this; }
    modint pow(ll n) const { modint x = *this, r = 1; while(n){ if(n&1) r *= x; x *= x; n >>= 1; } return r; }
    modint &operator/=(modint b) { return *this *= b.pow(M()-2); }
    static void set_mod(const u32 x) { mod() = x; }
    static int M() { return mod(); }
};
using mint = modint;

int main() {
    int n, k, m;
    cin >> n >> k >> m;
    vector<int> a(n), b(n), c(n), d(n);
    for (auto &&i : a) scanf("%d", &i);
    for (auto &&i : b) scanf("%d", &i);
    for (auto &&i : c) scanf("%d", &i);
    for (auto &&i : d) scanf("%d", &i);
    sort(a.begin(),a.end());
    sort(b.begin(),b.end());
    sort(c.begin(),c.end());
    sort(d.begin(),d.end());
    mint::set_mod(m);
    mint ans = 0;
    for (int i = 0; i < n; ++i) {
        int l = min({a[i], b[i], c[i], d[i]}), r = max({a[i], b[i], c[i], d[i]});
        ans += mint(r-l).pow(k);
    }
    cout << ans.val << "\n";
    return 0;
}