結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー | suta28407928 |
提出日時 | 2021-01-22 22:38:04 |
言語 | C++14 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 494 ms / 2,000 ms |
コード長 | 3,065 bytes |
コンパイル時間 | 2,843 ms |
コンパイル使用メモリ | 187,252 KB |
実行使用メモリ | 11,216 KB |
最終ジャッジ日時 | 2023-08-27 20:38:52 |
合計ジャッジ時間 | 33,129 ms |
ジャッジサーバーID (参考情報) |
judge11 / judge12 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,380 KB |
testcase_01 | AC | 2 ms
4,376 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 249 ms
6,992 KB |
testcase_04 | AC | 249 ms
7,012 KB |
testcase_05 | AC | 236 ms
7,000 KB |
testcase_06 | AC | 234 ms
7,060 KB |
testcase_07 | AC | 345 ms
8,572 KB |
testcase_08 | AC | 346 ms
8,628 KB |
testcase_09 | AC | 94 ms
4,740 KB |
testcase_10 | AC | 96 ms
4,724 KB |
testcase_11 | AC | 439 ms
9,848 KB |
testcase_12 | AC | 438 ms
10,196 KB |
testcase_13 | AC | 284 ms
7,476 KB |
testcase_14 | AC | 281 ms
7,564 KB |
testcase_15 | AC | 245 ms
6,940 KB |
testcase_16 | AC | 246 ms
7,044 KB |
testcase_17 | AC | 464 ms
10,352 KB |
testcase_18 | AC | 469 ms
10,464 KB |
testcase_19 | AC | 402 ms
9,460 KB |
testcase_20 | AC | 401 ms
9,372 KB |
testcase_21 | AC | 434 ms
9,992 KB |
testcase_22 | AC | 434 ms
9,852 KB |
testcase_23 | AC | 299 ms
7,672 KB |
testcase_24 | AC | 298 ms
7,780 KB |
testcase_25 | AC | 47 ms
4,380 KB |
testcase_26 | AC | 47 ms
4,380 KB |
testcase_27 | AC | 154 ms
5,440 KB |
testcase_28 | AC | 154 ms
5,512 KB |
testcase_29 | AC | 190 ms
5,856 KB |
testcase_30 | AC | 191 ms
5,824 KB |
testcase_31 | AC | 254 ms
6,992 KB |
testcase_32 | AC | 253 ms
7,116 KB |
testcase_33 | AC | 188 ms
5,956 KB |
testcase_34 | AC | 189 ms
6,200 KB |
testcase_35 | AC | 248 ms
6,884 KB |
testcase_36 | AC | 247 ms
7,008 KB |
testcase_37 | AC | 50 ms
4,380 KB |
testcase_38 | AC | 50 ms
4,376 KB |
testcase_39 | AC | 41 ms
4,384 KB |
testcase_40 | AC | 41 ms
4,376 KB |
testcase_41 | AC | 88 ms
4,384 KB |
testcase_42 | AC | 88 ms
4,464 KB |
testcase_43 | AC | 72 ms
4,376 KB |
testcase_44 | AC | 462 ms
10,424 KB |
testcase_45 | AC | 195 ms
6,200 KB |
testcase_46 | AC | 66 ms
4,380 KB |
testcase_47 | AC | 330 ms
7,932 KB |
testcase_48 | AC | 314 ms
8,136 KB |
testcase_49 | AC | 319 ms
8,268 KB |
testcase_50 | AC | 243 ms
6,952 KB |
testcase_51 | AC | 13 ms
4,376 KB |
testcase_52 | AC | 414 ms
9,556 KB |
testcase_53 | AC | 477 ms
11,016 KB |
testcase_54 | AC | 490 ms
11,212 KB |
testcase_55 | AC | 487 ms
11,040 KB |
testcase_56 | AC | 492 ms
11,216 KB |
testcase_57 | AC | 493 ms
10,876 KB |
testcase_58 | AC | 491 ms
11,076 KB |
testcase_59 | AC | 494 ms
11,056 KB |
testcase_60 | AC | 483 ms
11,008 KB |
testcase_61 | AC | 469 ms
10,956 KB |
testcase_62 | AC | 488 ms
10,840 KB |
testcase_63 | AC | 491 ms
11,104 KB |
testcase_64 | AC | 490 ms
10,972 KB |
testcase_65 | AC | 485 ms
11,084 KB |
testcase_66 | AC | 487 ms
10,984 KB |
testcase_67 | AC | 494 ms
10,972 KB |
testcase_68 | AC | 481 ms
10,888 KB |
testcase_69 | AC | 469 ms
10,960 KB |
testcase_70 | AC | 468 ms
10,840 KB |
testcase_71 | AC | 459 ms
11,004 KB |
testcase_72 | AC | 493 ms
10,952 KB |
testcase_73 | AC | 485 ms
11,060 KB |
testcase_74 | AC | 493 ms
11,044 KB |
testcase_75 | AC | 482 ms
11,008 KB |
testcase_76 | AC | 482 ms
11,212 KB |
testcase_77 | AC | 483 ms
10,904 KB |
ソースコード
#pragma GCC target("avx2") #pragma GCC optimize("Ofast") #pragma GCC optimize("unroll-loops") #include <bits/stdc++.h> //#include <atcoder/all> using namespace std; //using namespace atcoder; #define DEBUG #ifdef DEBUG template <class T, class U> ostream &operator<<(ostream &os, const pair<T, U> &p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <class T> ostream &operator<<(ostream &os, const vector<T> &v) { os << '{'; for(int i = 0; i < (int)v.size(); i++) { if(i) { os << ','; } os << v[i]; } os << '}'; return os; } void debugg() { cerr << endl; } template <class T, class... Args> void debugg(const T &x, const Args &... args) { cerr << " " << x; debugg(args...); } #define debug(...) \ cerr << __LINE__ << " [" << #__VA_ARGS__ << "]: ", debugg(__VA_ARGS__) #define dump(x) cerr << __LINE__ << " " << #x << " = " << (x) << endl #else #define debug(...) (void(0)) #define dump(x) (void(0)) #endif using namespace std; typedef long long ll; typedef vector<ll> vl; typedef vector<vl> vvl; typedef vector<char> vc; typedef vector<string> vs; typedef vector<bool> vb; typedef vector<double> vd; typedef pair<ll,ll> P; typedef pair<int,int> pii; typedef vector<P> vpl; typedef tuple<ll,ll,ll> tapu; #define rep(i,n) for(int i=0; i<(n); i++) #define REP(i,a,b) for(int i=(a); i<(b); i++) #define all(x) (x).begin(), (x).end() #define rall(x) (x).rbegin(), (x).rend() const int inf = (1<<30) - 1; const ll linf = 1LL<<61; const int MAX = 510000; int dy[8] = {0,1,0,-1,1,-1,-1,1}; int dx[8] = {-1,0,1,0,1,-1,1,-1}; const double pi = acos(-1); const double eps = 1e-7; template<typename T1,typename T2> inline bool chmin(T1 &a,T2 b){ if(a>b){ a = b; return true; } else return false; } template<typename T1,typename T2> inline bool chmax(T1 &a,T2 b){ if(a<b){ a = b; return true; } else return false; } template<typename T> inline void print(T &a){ int sz = a.size(); for(auto itr = a.begin(); itr != a.end(); itr++){ cout << *itr; sz--; if(sz) cout << " "; } cout << "\n"; } template<typename T1,typename T2> inline void print2(T1 a, T2 b){ cout << a << " " << b << "\n"; } template<typename T1,typename T2,typename T3> inline void print3(T1 a, T2 b, T3 c){ cout << a << " " << b << " " << c << "\n"; } void mark() {cout << "#" << "\n";} ll pcount(ll x) {return __builtin_popcountll(x);} const int mod = 1e9 + 7; //const int mod = 998244353; ll modpow(ll x, ll n, ll mod){ ll res = 1; while(n > 0){ if(n & 1) res = res * x % mod; x = x * x % mod; n >>= 1; } return res; } int main(){ int n,k,m; cin >> n >> k >> m; vvl a(4,vl(n)); rep(i,4) rep(j,n) cin >> a[i][j]; rep(i,4) sort(all(a[i])); ll ans = 0; rep(i,n){ int mx = 0, mn = inf; rep(j,4){ chmax(mx, a[j][i]); chmin(mn, a[j][i]); } ans += modpow(mx-mn,k,m); } ans %= m; cout << ans << "\n"; }