結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー |
![]() |
提出日時 | 2021-01-22 21:39:34 |
言語 | C++14 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,270 ms / 2,000 ms |
コード長 | 2,588 bytes |
コンパイル時間 | 1,705 ms |
コンパイル使用メモリ | 176,092 KB |
実行使用メモリ | 11,136 KB |
最終ジャッジ日時 | 2024-07-04 17:12:05 |
合計ジャッジ時間 | 70,390 ms |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 75 |
ソースコード
#include <bits/stdc++.h>using namespace std;using ll = long long;struct Edge{ll to;ll cost;};using Graph = vector<vector<Edge>>;using P = pair<ll, ll>;#define mp make_pair#define REP(i, n) for (int i = 0; i < (n); ++i)#define SORT(v) sort((v).begin(), (v).end())#define RSORT(v) sort((v).rbegin(), (v).rend())#define ALL(v) (v).begin(), v.end()ll MOD = 1000000007;const ll nmax = 8;const ll INF = 1e10;const int MAX = 510000;bool graph[nmax][nmax];long long fac[MAX], finv[MAX], inv[MAX];void COMinit(){fac[0] = fac[1] = 1;finv[0] = finv[1] = 1;inv[1] = 1;for (int i = 2; i < MAX; i++){fac[i] = fac[i - 1] * i % MOD;inv[i] = MOD - inv[MOD % i] * (MOD / i) % MOD;finv[i] = finv[i - 1] * inv[i] % MOD;}}ll COM(int n, int k){if (n < k)return 0;if (n < 0 || k < 0)return 0;return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD;}vector<vector<ll>> dist = vector<vector<ll>>(nmax, vector<ll>(nmax, INF));void warshall_floyd(ll n){for (size_t i = 0; i < n; i++){for (size_t j = 0; j < n; j++){for (size_t k = 0; k < n; k++){dist[j][k] = min(dist[j][k], dist[j][i] + dist[i][k]);}}}}ll gcd(ll a, ll b){if (b == 0)return a;return gcd(b, a % b);}ll lcm(ll a, ll b){ll g = gcd(a, b);return a / g * b;}ll mulMod(ll a, ll b){return (((a % MOD) * (b % MOD)) % MOD);}ll powMod(ll a, ll p){if (p == 0){return 1;}else if (p % 2 == 0){ll half = powMod(a, p / 2);return mulMod(half, half);}else{return mulMod(powMod(a, p - 1), a);}}ll ceil(ll a, ll b){return (a + b - 1) / b;}int main(){ll N, K;cin >> N >> K >> MOD;vector<ll> a(N), b(N), c(N), d(N);for (int i = 0; i < N; i++){cin >> a[i];}for (int i = 0; i < N; i++){cin >> b[i];}for (int i = 0; i < N; i++){cin >> c[i];}for (int i = 0; i < N; i++){cin >> d[i];}SORT(a);SORT(b);SORT(c);SORT(d);vector<ll> num(N);for (int i = 0; i < N; i++){num[i] = max({a[i], b[i], c[i], d[i]}) - min({a[i], b[i], c[i], d[i]});}ll ans = 0;for (int i = 0; i < N; i++){cerr << num[i] << " ";ans += powMod(num[i], K);ans %= MOD;}cerr << endl;cout << ans << endl;return 0;}