結果

問題 No.1359 [Zelkova 3rd Tune] 四人セゾン
ユーザー ningenMeningenMe
提出日時 2021-01-22 23:34:06
言語 C++17
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 292 ms / 2,000 ms
コード長 6,892 bytes
コンパイル時間 3,665 ms
コンパイル使用メモリ 209,728 KB
実行使用メモリ 9,532 KB
最終ジャッジ日時 2023-08-27 23:05:50
合計ジャッジ時間 22,186 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge14
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,376 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 145 ms
6,152 KB
testcase_04 AC 145 ms
6,180 KB
testcase_05 AC 132 ms
6,228 KB
testcase_06 AC 131 ms
6,196 KB
testcase_07 AC 198 ms
7,516 KB
testcase_08 AC 198 ms
7,576 KB
testcase_09 AC 56 ms
4,380 KB
testcase_10 AC 55 ms
4,416 KB
testcase_11 AC 254 ms
8,512 KB
testcase_12 AC 255 ms
8,668 KB
testcase_13 AC 163 ms
6,796 KB
testcase_14 AC 163 ms
6,724 KB
testcase_15 AC 144 ms
6,196 KB
testcase_16 AC 144 ms
6,228 KB
testcase_17 AC 272 ms
8,908 KB
testcase_18 AC 272 ms
8,832 KB
testcase_19 AC 234 ms
8,068 KB
testcase_20 AC 234 ms
7,984 KB
testcase_21 AC 256 ms
8,516 KB
testcase_22 AC 254 ms
8,636 KB
testcase_23 AC 173 ms
6,980 KB
testcase_24 AC 173 ms
7,144 KB
testcase_25 AC 27 ms
4,376 KB
testcase_26 AC 28 ms
4,376 KB
testcase_27 AC 90 ms
5,160 KB
testcase_28 AC 89 ms
5,160 KB
testcase_29 AC 111 ms
5,356 KB
testcase_30 AC 110 ms
5,348 KB
testcase_31 AC 148 ms
6,136 KB
testcase_32 AC 148 ms
6,220 KB
testcase_33 AC 109 ms
5,348 KB
testcase_34 AC 109 ms
5,424 KB
testcase_35 AC 144 ms
6,180 KB
testcase_36 AC 143 ms
6,220 KB
testcase_37 AC 29 ms
4,380 KB
testcase_38 AC 29 ms
4,376 KB
testcase_39 AC 24 ms
4,376 KB
testcase_40 AC 24 ms
4,376 KB
testcase_41 AC 51 ms
4,380 KB
testcase_42 AC 51 ms
4,376 KB
testcase_43 AC 41 ms
4,376 KB
testcase_44 AC 269 ms
9,048 KB
testcase_45 AC 113 ms
5,496 KB
testcase_46 AC 39 ms
4,380 KB
testcase_47 AC 191 ms
7,204 KB
testcase_48 AC 180 ms
6,984 KB
testcase_49 AC 181 ms
7,188 KB
testcase_50 AC 140 ms
6,152 KB
testcase_51 AC 8 ms
4,380 KB
testcase_52 AC 240 ms
8,368 KB
testcase_53 AC 273 ms
9,388 KB
testcase_54 AC 286 ms
9,364 KB
testcase_55 AC 282 ms
9,320 KB
testcase_56 AC 287 ms
9,352 KB
testcase_57 AC 289 ms
9,344 KB
testcase_58 AC 286 ms
9,452 KB
testcase_59 AC 284 ms
9,380 KB
testcase_60 AC 279 ms
9,384 KB
testcase_61 AC 263 ms
9,396 KB
testcase_62 AC 284 ms
9,432 KB
testcase_63 AC 285 ms
9,532 KB
testcase_64 AC 286 ms
9,528 KB
testcase_65 AC 282 ms
9,396 KB
testcase_66 AC 283 ms
9,388 KB
testcase_67 AC 292 ms
9,456 KB
testcase_68 AC 279 ms
9,360 KB
testcase_69 AC 263 ms
9,348 KB
testcase_70 AC 266 ms
9,396 KB
testcase_71 AC 255 ms
9,388 KB
testcase_72 AC 287 ms
9,516 KB
testcase_73 AC 281 ms
9,392 KB
testcase_74 AC 275 ms
9,308 KB
testcase_75 AC 277 ms
9,312 KB
testcase_76 AC 275 ms
9,320 KB
testcase_77 AC 277 ms
9,308 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

#include <bits/stdc++.h>
using namespace std;
using int128  = __int128_t;
using int64   = long long;
using int32   = int;
using uint128 = __uint128_t;
using uint64  = unsigned long long;
using uint32  = unsigned int;

#define ALL(obj) (obj).begin(),(obj).end()
template<class T> using priority_queue_reverse = priority_queue<T,vector<T>,greater<T>>;

constexpr int64 MOD = 1'000'000'000LL + 7; //'
constexpr int64 MOD2 = 998244353;
constexpr int64 HIGHINF = 1'000'000'000'000'000'000LL;
constexpr int64 LOWINF = 1'000'000'000'000'000LL; //'
constexpr long double PI = 3.1415926535897932384626433L;

template <class T> vector<T> multivector(size_t N,T init){return vector<T>(N,init);}
template <class... T> auto multivector(size_t N,T... t){return vector<decltype(multivector(t...))>(N,multivector(t...));}
template <class T> void corner(bool flg, T hoge) {if (flg) {cout << hoge << endl; exit(0);}}
template <class T, class U>ostream &operator<<(ostream &o, const map<T, U>&obj) {o << "{"; for (auto &x : obj) o << " {" << x.first << " : " << x.second << "}" << ","; o << " }"; return o;}
template <class T>ostream &operator<<(ostream &o, const set<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const multiset<T>&obj) {o << "{"; for (auto itr = obj.begin(); itr != obj.end(); ++itr) o << (itr != obj.begin() ? ", " : "") << *itr; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const vector<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T>ostream &operator<<(ostream &o, const deque<T>&obj) {o << "{"; for (int i = 0; i < (int)obj.size(); ++i)o << (i > 0 ? ", " : "") << obj[i]; o << "}"; return o;}
template <class T, class U>ostream &operator<<(ostream &o, const pair<T, U>&obj) {o << "{" << obj.first << ", " << obj.second << "}"; return o;}
void print(void) {cout << endl;}
template <class Head> void print(Head&& head) {cout << head;print();}
template <class Head, class... Tail> void print(Head&& head, Tail&&... tail) {cout << head << " ";print(forward<Tail>(tail)...);}
template <class T> void chmax(T& a, const T b){a=max(a,b);}
template <class T> void chmin(T& a, const T b){a=min(a,b);}
vector<string> split(const string &str, const char delemiter) {vector<string> res;stringstream ss(str);string buffer; while( getline(ss, buffer, delemiter) ) res.push_back(buffer); return res;}
inline constexpr int msb(int x) {return x?31-__builtin_clz(x):-1;}
inline constexpr int64 ceil_div(const int64 a,const int64 b) {return (a+(b-1))/b;}// return ceil(a/b)
void YN(bool flg) {cout << (flg ? "YES" : "NO") << endl;}
void Yn(bool flg) {cout << (flg ? "Yes" : "No") << endl;}
void yn(bool flg) {cout << (flg ? "yes" : "no") << endl;}

/*
 * @title RuntimeModInt - 実行時ModInt
 * @docs md/util/RuntimeModInt.md
 */
template<long long& mod> class RuntimeModInt {
public:
    long long x;
    constexpr RuntimeModInt():x(0) {}
    constexpr RuntimeModInt(long long y) : x(y>=0?(y%mod): (mod - (-y)%mod)%mod) {}
    RuntimeModInt &operator+=(const RuntimeModInt &p) {if((x += p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator+=(const long long y) {RuntimeModInt p(y);if((x += p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator+=(const int y) {RuntimeModInt p(y);if((x += p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator-=(const RuntimeModInt &p) {if((x += mod - p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator-=(const long long y) {RuntimeModInt p(y);if((x += mod - p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator-=(const int y) {RuntimeModInt p(y);if((x += mod - p.x) >= mod) x -= mod;return *this;}
    RuntimeModInt &operator*=(const RuntimeModInt &p) {x = (x * p.x % mod);return *this;}
    RuntimeModInt &operator*=(const long long y) {RuntimeModInt p(y);x = (x * p.x % mod);return *this;}
    RuntimeModInt &operator*=(const int y) {RuntimeModInt p(y);x = (x * p.x % mod);return *this;}
    RuntimeModInt &operator^=(const RuntimeModInt &p) {x = (x ^ p.x) % mod;return *this;}
    RuntimeModInt &operator^=(const long long y) {RuntimeModInt p(y);x = (x ^ p.x) % mod;return *this;}
    RuntimeModInt &operator^=(const int y) {RuntimeModInt p(y);x = (x ^ p.x) % mod;return *this;}
    RuntimeModInt &operator/=(const RuntimeModInt &p) {*this *= p.inv();return *this;}
    RuntimeModInt &operator/=(const long long y) {RuntimeModInt p(y);*this *= p.inv();return *this;}
    RuntimeModInt &operator/=(const int y) {RuntimeModInt p(y);*this *= p.inv();return *this;}
    RuntimeModInt operator=(const int y) {RuntimeModInt p(y);*this = p;return *this;}
    RuntimeModInt operator=(const long long y) {RuntimeModInt p(y);*this = p;return *this;}
    RuntimeModInt operator-() const {return RuntimeModInt(-x); }
    RuntimeModInt operator++() {x++;if(x>=mod) x-=mod;return *this;}
    RuntimeModInt operator--() {x--;if(x<0) x+=mod;return *this;}
    RuntimeModInt operator+(const RuntimeModInt &p) const { return RuntimeModInt(*this) += p; }
    RuntimeModInt operator-(const RuntimeModInt &p) const { return RuntimeModInt(*this) -= p; }
    RuntimeModInt operator*(const RuntimeModInt &p) const { return RuntimeModInt(*this) *= p; }
    RuntimeModInt operator/(const RuntimeModInt &p) const { return RuntimeModInt(*this) /= p; }
    RuntimeModInt operator^(const RuntimeModInt &p) const { return RuntimeModInt(*this) ^= p; }
    bool operator==(const RuntimeModInt &p) const { return x == p.x; }
    bool operator!=(const RuntimeModInt &p) const { return x != p.x; }
    RuntimeModInt inv() const {int a=x,b=mod,u=1,v=0,t;while(b > 0) {t = a / b;swap(a -= t * b, b);swap(u -= t * v, v);} return RuntimeModInt(u);}
    RuntimeModInt pow(long long n) const {RuntimeModInt ret(1), mul(x);for(;n > 0;mul *= mul,n >>= 1) if(n & 1) ret *= mul;return ret;}
    friend ostream &operator<<(ostream &os, const RuntimeModInt &p) {return os << p.x;}
    friend istream &operator>>(istream &is, RuntimeModInt &a) {long long t;is >> t;a = RuntimeModInt<mod>(t);return (is);}
};
long long runtime_mod;
using modint = RuntimeModInt<runtime_mod>;

/**
 * @url 
 * @est
 */ 
int main() {
    cin.tie(0);ios::sync_with_stdio(false);
    int N,K,M; cin >> N >> K >> M;
    runtime_mod = M;
    vector<int64> P(N),E(N),A(N),H(N);
    for(int i=0;i<N;++i) cin >> P[i];
    for(int i=0;i<N;++i) cin >> E[i];
    for(int i=0;i<N;++i) cin >> A[i];
    for(int i=0;i<N;++i) cin >> H[i];
    sort(ALL(P));
    sort(ALL(E));
    sort(ALL(A));
    sort(ALL(H));
    modint ans = 0;
    for(int i=0;i<N;++i) {
        vector<int64> tmp = {P[i],E[i],A[i],H[i]};
        sort(ALL(tmp));
        ans += modint(tmp.back()-tmp.front()).pow(K);
    }
    cout << ans << endl;
    return 0;
}
0