結果

問題 No.1359 [Zelkova 3rd Tune] 四人セゾン
ユーザー rniyarniya
提出日時 2021-01-22 21:43:15
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 250 ms / 2,000 ms
コード長 7,619 bytes
コンパイル時間 2,267 ms
コンパイル使用メモリ 207,540 KB
実行使用メモリ 7,208 KB
最終ジャッジ日時 2023-08-27 18:20:29
合計ジャッジ時間 20,071 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 1 ms
4,380 KB
testcase_02 AC 2 ms
4,376 KB
testcase_03 AC 125 ms
5,176 KB
testcase_04 AC 126 ms
5,132 KB
testcase_05 AC 114 ms
5,156 KB
testcase_06 AC 115 ms
5,148 KB
testcase_07 AC 172 ms
5,904 KB
testcase_08 AC 172 ms
6,080 KB
testcase_09 AC 48 ms
4,380 KB
testcase_10 AC 48 ms
4,380 KB
testcase_11 AC 220 ms
6,428 KB
testcase_12 AC 221 ms
6,496 KB
testcase_13 AC 141 ms
5,432 KB
testcase_14 AC 142 ms
5,408 KB
testcase_15 AC 124 ms
5,000 KB
testcase_16 AC 124 ms
4,788 KB
testcase_17 AC 234 ms
6,748 KB
testcase_18 AC 234 ms
6,868 KB
testcase_19 AC 201 ms
6,204 KB
testcase_20 AC 203 ms
6,132 KB
testcase_21 AC 219 ms
6,664 KB
testcase_22 AC 219 ms
6,444 KB
testcase_23 AC 150 ms
5,460 KB
testcase_24 AC 149 ms
5,412 KB
testcase_25 AC 24 ms
4,380 KB
testcase_26 AC 24 ms
4,376 KB
testcase_27 AC 78 ms
4,404 KB
testcase_28 AC 78 ms
4,376 KB
testcase_29 AC 95 ms
4,616 KB
testcase_30 AC 95 ms
4,516 KB
testcase_31 AC 128 ms
5,076 KB
testcase_32 AC 128 ms
5,144 KB
testcase_33 AC 94 ms
4,648 KB
testcase_34 AC 93 ms
4,608 KB
testcase_35 AC 124 ms
5,064 KB
testcase_36 AC 124 ms
5,176 KB
testcase_37 AC 25 ms
4,376 KB
testcase_38 AC 25 ms
4,380 KB
testcase_39 AC 21 ms
4,376 KB
testcase_40 AC 21 ms
4,376 KB
testcase_41 AC 45 ms
4,388 KB
testcase_42 AC 45 ms
4,380 KB
testcase_43 AC 36 ms
4,376 KB
testcase_44 AC 235 ms
6,732 KB
testcase_45 AC 98 ms
4,664 KB
testcase_46 AC 33 ms
4,380 KB
testcase_47 AC 166 ms
5,668 KB
testcase_48 AC 157 ms
5,656 KB
testcase_49 AC 159 ms
5,584 KB
testcase_50 AC 121 ms
5,144 KB
testcase_51 AC 7 ms
4,380 KB
testcase_52 AC 208 ms
6,420 KB
testcase_53 AC 237 ms
6,988 KB
testcase_54 AC 246 ms
6,924 KB
testcase_55 AC 244 ms
7,028 KB
testcase_56 AC 247 ms
7,008 KB
testcase_57 AC 248 ms
6,924 KB
testcase_58 AC 247 ms
6,992 KB
testcase_59 AC 245 ms
6,904 KB
testcase_60 AC 241 ms
6,968 KB
testcase_61 AC 231 ms
7,012 KB
testcase_62 AC 246 ms
6,896 KB
testcase_63 AC 247 ms
6,952 KB
testcase_64 AC 247 ms
6,992 KB
testcase_65 AC 245 ms
7,208 KB
testcase_66 AC 247 ms
6,908 KB
testcase_67 AC 250 ms
7,020 KB
testcase_68 AC 241 ms
6,900 KB
testcase_69 AC 230 ms
7,024 KB
testcase_70 AC 231 ms
6,944 KB
testcase_71 AC 225 ms
6,948 KB
testcase_72 AC 250 ms
7,020 KB
testcase_73 AC 240 ms
7,036 KB
testcase_74 AC 240 ms
6,944 KB
testcase_75 AC 240 ms
6,996 KB
testcase_76 AC 238 ms
7,044 KB
testcase_77 AC 239 ms
7,024 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#define LOCAL
#include <bits/stdc++.h>
using namespace std;
#pragma region Macros
typedef long long ll;
typedef __int128_t i128;
typedef unsigned int uint;
typedef unsigned long long ull;
#define ALL(x) (x).begin(), (x).end()

template <typename T> istream& operator>>(istream& is, vector<T>& v) {
    for (T& x : v) is >> x;
    return is;
}
template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) {
    os << '(' << p.first << ',' << p.second << ')';
    return os;
}
template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')';
    return os;
}
template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) {
    os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) {
    os << '{';
    for (auto itr = m.begin(); itr != m.end();) {
        os << '(' << itr->first << ',' << itr->second << ')';
        if (++itr != m.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) {
    os << '{';
    for (auto itr = s.begin(); itr != s.end();) {
        os << *itr;
        if (++itr != s.end()) os << ',';
    }
    os << '}';
    return os;
}
template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) {
    for (int i = 0; i < (int)v.size(); i++) {
        os << v[i] << (i + 1 == (int)v.size() ? "" : " ");
    }
    return os;
}

void debug_out() { cerr << '\n'; }
template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) {
    cerr << head;
    if (sizeof...(Tail) > 0) cerr << ", ";
    debug_out(move(tail)...);
}
#ifdef LOCAL
#define debug(...)                                                                   \
    cerr << " ";                                                                     \
    cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \
    cerr << " ";                                                                     \
    debug_out(__VA_ARGS__)
#else
#define debug(...) 42
#endif

template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; }
template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; }

template <class T1, class T2> inline bool chmin(T1& a, T2 b) {
    if (a > b) {
        a = b;
        return true;
    }
    return false;
}
template <class T1, class T2> inline bool chmax(T1& a, T2 b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}
#pragma endregion

const int INF = 1e9;
const long long IINF = 1e18;
const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};
const char dir[4] = {'D', 'R', 'U', 'L'};
const long long MOD = 1000000007;
// const long long MOD = 998244353;

/**
 * @brief 実行時 modint
 * @docs docs/modulo/modint.md
 */
class dynamic_modint {
    using i64 = int64_t;
    using u32 = uint32_t;
    using u64 = uint64_t;
    static u32& mod() {
        static u32 mod_ = 0;
        return mod_;
    }

public:
    u32 v;
    static void set_mod(const u32 x) {
        assert(x < (u32(1) << 31));
        mod() = x;
    }
    static u32 get_mod() { return mod(); }
    dynamic_modint(const i64 x = 0) : v(x < 0 ? get_mod() - 1 - (-(x + 1) % get_mod()) : x % get_mod()) {}
    u32& value() noexcept { return v; }
    const u32& value() const noexcept { return v; }
    dynamic_modint operator+(const dynamic_modint& rhs) const { return dynamic_modint(*this) += rhs; }
    dynamic_modint operator-(const dynamic_modint& rhs) const { return dynamic_modint(*this) -= rhs; }
    dynamic_modint operator*(const dynamic_modint& rhs) const { return dynamic_modint(*this) *= rhs; }
    dynamic_modint operator/(const dynamic_modint& rhs) const { return dynamic_modint(*this) /= rhs; }
    dynamic_modint& operator+=(const dynamic_modint& rhs) {
        v += rhs.v;
        if (v >= get_mod()) v -= get_mod();
        return *this;
    }
    dynamic_modint& operator-=(const dynamic_modint& rhs) {
        if (v < rhs.v) v += get_mod();
        v -= rhs.v;
        return *this;
    }
    dynamic_modint& operator*=(const dynamic_modint& rhs) {
        v = (u64)v * rhs.v % get_mod();
        return *this;
    }
    dynamic_modint& operator/=(const dynamic_modint& rhs) { return *this *= rhs.pow(get_mod() - 2); }
    dynamic_modint pow(u64 exp) const {
        dynamic_modint self(*this), res(1);
        while (exp > 0) {
            if (exp & 1) res *= self;
            self *= self;
            exp >>= 1;
        }
        return res;
    }
    dynamic_modint& operator++() {
        if (++v == get_mod()) v = 0;
        return *this;
    }
    dynamic_modint& operator--() {
        if (v == 0) v = get_mod();
        return --v, *this;
    }
    dynamic_modint operator++(int) {
        dynamic_modint t = *this;
        return ++*this, t;
    }
    dynamic_modint operator--(int) {
        dynamic_modint t = *this;
        return --*this, t;
    }
    dynamic_modint operator-() { return dynamic_modint(get_mod() - v); }
    template <class T> friend dynamic_modint operator+(T x, dynamic_modint y) { return dynamic_modint(x) + y; }
    template <class T> friend dynamic_modint operator-(T x, dynamic_modint y) { return dynamic_modint(x) - y; }
    template <class T> friend dynamic_modint operator*(T x, dynamic_modint y) { return dynamic_modint(x) * y; }
    template <class T> friend dynamic_modint operator/(T x, dynamic_modint y) { return dynamic_modint(x) / y; }
    bool operator==(const dynamic_modint& rhs) { return v == rhs.v; }
    bool operator!=(const dynamic_modint& rhs) { return v != rhs.v; }
    bool operator!() { return !v; }
    friend istream& operator>>(istream& s, dynamic_modint& rhs) {
        i64 v;
        rhs = dynamic_modint{(s >> v, v)};
        return s;
    }
    friend ostream& operator<<(ostream& s, const dynamic_modint& rhs) { return s << rhs.v; }
};

using mint=dynamic_modint;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,K,M; cin >> N >> K >> M;
    vector<vector<int>> A(4,vector<int>(N)); cin >> A;

    mint::set_mod(M);
    for (int i=0;i<4;i++) sort(ALL(A[i]));
    mint ans=0;
    for (int j=0;j<N;j++){
        int mi=INF,ma=0;
        for (int i=0;i<4;i++){
            chmin(mi,A[i][j]);
            chmax(ma,A[i][j]);
        }
        mint D=ma-mi;
        ans+=D.pow(K);
    }

    cout << ans << '\n';
    return 0;
}
0