結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー | milanis48663220 |
提出日時 | 2021-01-22 21:47:15 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 376 ms / 2,000 ms |
コード長 | 2,821 bytes |
コンパイル時間 | 1,049 ms |
コンパイル使用メモリ | 99,608 KB |
実行使用メモリ | 6,448 KB |
最終ジャッジ日時 | 2023-08-27 18:33:42 |
合計ジャッジ時間 | 25,545 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 1 ms
4,376 KB |
testcase_02 | AC | 2 ms
4,376 KB |
testcase_03 | AC | 194 ms
4,692 KB |
testcase_04 | AC | 189 ms
4,692 KB |
testcase_05 | AC | 188 ms
4,688 KB |
testcase_06 | AC | 187 ms
4,692 KB |
testcase_07 | AC | 267 ms
5,484 KB |
testcase_08 | AC | 267 ms
5,484 KB |
testcase_09 | AC | 73 ms
4,380 KB |
testcase_10 | AC | 72 ms
4,380 KB |
testcase_11 | AC | 331 ms
5,900 KB |
testcase_12 | AC | 330 ms
5,960 KB |
testcase_13 | AC | 214 ms
4,908 KB |
testcase_14 | AC | 215 ms
4,956 KB |
testcase_15 | AC | 187 ms
4,580 KB |
testcase_16 | AC | 187 ms
4,696 KB |
testcase_17 | AC | 351 ms
5,956 KB |
testcase_18 | AC | 352 ms
5,896 KB |
testcase_19 | AC | 303 ms
5,748 KB |
testcase_20 | AC | 305 ms
5,744 KB |
testcase_21 | AC | 331 ms
6,088 KB |
testcase_22 | AC | 328 ms
5,652 KB |
testcase_23 | AC | 228 ms
4,912 KB |
testcase_24 | AC | 228 ms
4,960 KB |
testcase_25 | AC | 36 ms
4,384 KB |
testcase_26 | AC | 36 ms
4,388 KB |
testcase_27 | AC | 117 ms
4,380 KB |
testcase_28 | AC | 116 ms
4,376 KB |
testcase_29 | AC | 143 ms
4,384 KB |
testcase_30 | AC | 144 ms
4,380 KB |
testcase_31 | AC | 193 ms
4,700 KB |
testcase_32 | AC | 194 ms
4,696 KB |
testcase_33 | AC | 141 ms
4,384 KB |
testcase_34 | AC | 141 ms
4,428 KB |
testcase_35 | AC | 186 ms
4,584 KB |
testcase_36 | AC | 186 ms
4,688 KB |
testcase_37 | AC | 38 ms
4,380 KB |
testcase_38 | AC | 39 ms
4,380 KB |
testcase_39 | AC | 31 ms
4,380 KB |
testcase_40 | AC | 32 ms
4,380 KB |
testcase_41 | AC | 67 ms
4,380 KB |
testcase_42 | AC | 67 ms
4,376 KB |
testcase_43 | AC | 56 ms
4,384 KB |
testcase_44 | AC | 350 ms
6,012 KB |
testcase_45 | AC | 147 ms
4,384 KB |
testcase_46 | AC | 51 ms
4,384 KB |
testcase_47 | AC | 248 ms
5,156 KB |
testcase_48 | AC | 236 ms
5,176 KB |
testcase_49 | AC | 242 ms
5,220 KB |
testcase_50 | AC | 187 ms
4,692 KB |
testcase_51 | AC | 10 ms
4,380 KB |
testcase_52 | AC | 313 ms
5,692 KB |
testcase_53 | AC | 367 ms
6,200 KB |
testcase_54 | AC | 370 ms
6,140 KB |
testcase_55 | AC | 370 ms
6,340 KB |
testcase_56 | AC | 371 ms
6,284 KB |
testcase_57 | AC | 373 ms
6,232 KB |
testcase_58 | AC | 371 ms
6,276 KB |
testcase_59 | AC | 369 ms
6,280 KB |
testcase_60 | AC | 366 ms
6,272 KB |
testcase_61 | AC | 368 ms
6,344 KB |
testcase_62 | AC | 369 ms
6,276 KB |
testcase_63 | AC | 370 ms
6,144 KB |
testcase_64 | AC | 370 ms
6,172 KB |
testcase_65 | AC | 371 ms
6,344 KB |
testcase_66 | AC | 368 ms
6,272 KB |
testcase_67 | AC | 376 ms
6,268 KB |
testcase_68 | AC | 370 ms
6,300 KB |
testcase_69 | AC | 364 ms
6,196 KB |
testcase_70 | AC | 365 ms
6,284 KB |
testcase_71 | AC | 367 ms
6,144 KB |
testcase_72 | AC | 372 ms
6,404 KB |
testcase_73 | AC | 368 ms
6,312 KB |
testcase_74 | AC | 369 ms
6,172 KB |
testcase_75 | AC | 365 ms
6,224 KB |
testcase_76 | AC | 365 ms
6,448 KB |
testcase_77 | AC | 366 ms
6,140 KB |
ソースコード
#include <iostream> #include <algorithm> #include <iomanip> #include <vector> #include <queue> #include <set> #include <map> #include <cassert> #define debug_value(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << #x << "=" << x << endl; #define debug(x) cerr << "line" << __LINE__ << ":<" << __func__ << ">:" << x << endl; template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; } template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; } using namespace std; typedef long long ll; ll MOD = 1000000007; class ModInt{ public: ll v; ModInt(ll _v = 0){ if(_v >= MOD) _v %= MOD; v = _v; } ModInt operator+(ll n){ return ModInt((v+n)%MOD); } ModInt operator-(ll n){ return ModInt((v-n+MOD)%MOD); } ModInt operator*(ll n){ if(n >= MOD) n %= MOD; return ModInt((v*n)%MOD); } void operator+=(ll n){ v = (v+n)%MOD; } void operator-=(ll n){ v = (v-n+MOD)%MOD; } void operator*=(ll n){ v = (v*n+MOD)%MOD; } ModInt operator+(ModInt n){ return ModInt((v+n.v)%MOD); } ModInt operator-(ModInt n){ return ModInt((v-n.v+MOD)%MOD); } ModInt operator*(ModInt n){ return ModInt((v*n.v)%MOD); } void operator+=(ModInt n){ v = (v+n.v)%MOD; } void operator-=(ModInt n){ v = (v-n.v+MOD)%MOD; } void operator*=(ModInt n){ v = (v*n.v)%MOD; } void operator=(ModInt n){ v = n.v; } bool operator==(ModInt n){ return v == n.v; } bool operator!=(ModInt n){ return v != n.v; } void operator=(ll n){ v = n; } }; ostream& operator<<(ostream& os, const ModInt& m){ os << m.v; return os; } istream & operator >> (istream &in, ModInt &m){ in >> m.v; return in; } ModInt pow(ModInt a, ll n) { ModInt ans = 1; ModInt tmp = a; for (int i = 0; i <= 60; i++) { ll m = (ll)1 << i; if (m & n) { ans *= tmp; } tmp *= tmp; } return ans; } int main(){ ios::sync_with_stdio(false); cin.tie(0); cout << setprecision(10) << fixed; ll n, k, m; cin >> n >> k >> m; MOD = m; vector<int> 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(p.begin(), p.end()); sort(e.begin(), e.end()); sort(a.begin(), a.end()); sort(h.begin(), h.end()); ModInt ans = 0; for(int i = 0; i < n; i++){ ll x = min({p[i], e[i], a[i], h[i]}); ll y = max({p[i], e[i], a[i], h[i]}); ans += pow(ModInt(y-x), k); } cout << ans << endl; }