結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー |
👑 ![]() |
提出日時 | 2021-01-22 22:01:45 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 367 ms / 2,000 ms |
コード長 | 4,696 bytes |
コンパイル時間 | 3,208 ms |
コンパイル使用メモリ | 201,816 KB |
最終ジャッジ日時 | 2025-01-18 04:20:11 |
ジャッジサーバーID (参考情報) |
judge2 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 75 |
ソースコード
#define _USE_MATH_DEFINES#include <bits/stdc++.h>using namespace std;#define FOR(i,m,n) for(int i=(m);i<(n);++i)#define REP(i,n) FOR(i,0,n)#define ALL(v) (v).begin(),(v).end()using ll = long long;constexpr int INF = 0x3f3f3f3f;constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;constexpr double EPS = 1e-8;constexpr int MOD = 1000000007;// constexpr int MOD = 998244353;constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }struct IOSetup {IOSetup() {std::cin.tie(nullptr);std::ios_base::sync_with_stdio(false);std::cout << fixed << setprecision(20);}} iosetup;struct ModInt {unsigned val;ModInt(): val(0) {}ModInt(long long x) : val(x >= 0 ? x % mod() : x % mod() + mod()) {}static int get_mod() { return mod(); }static void set_mod(int divisor) { mod() = divisor; }ModInt pow(long long exponent) const {ModInt tmp = *this, res = 1;while (exponent > 0) {if (exponent & 1) res *= tmp;tmp *= tmp;exponent >>= 1;}return res;}ModInt &operator+=(const ModInt &x) { if((val += x.val) >= mod()) val -= mod(); return *this; }ModInt &operator-=(const ModInt &x) { if((val += mod() - x.val) >= mod()) val -= mod(); return *this; }ModInt &operator*=(const ModInt &x) { val = static_cast<unsigned long long>(val) * x.val % mod(); return *this; }ModInt &operator/=(const ModInt &x) {// assert(std::__gcd(static_cast<int>(x.val), mod()) == 1);unsigned a = x.val, b = mod(); int u = 1, v = 0;while (b) {unsigned tmp = a / b;std::swap(a -= tmp * b, b);std::swap(u -= tmp * v, v);}return *this *= u;}bool operator==(const ModInt &x) const { return val == x.val; }bool operator!=(const ModInt &x) const { return val != x.val; }bool operator<(const ModInt &x) const { return val < x.val; }bool operator<=(const ModInt &x) const { return val <= x.val; }bool operator>(const ModInt &x) const { return val > x.val; }bool operator>=(const ModInt &x) const { return val >= x.val; }ModInt &operator++() { if (++val == mod()) val = 0; return *this; }ModInt operator++(int) { ModInt res = *this; ++*this; return res; }ModInt &operator--() { val = (val == 0 ? mod() : val) - 1; return *this; }ModInt operator--(int) { ModInt res = *this; --*this; return res; }ModInt operator+() const { return *this; }ModInt operator-() const { return ModInt(val ? mod() - val : 0); }ModInt operator+(const ModInt &x) const { return ModInt(*this) += x; }ModInt operator-(const ModInt &x) const { return ModInt(*this) -= x; }ModInt operator*(const ModInt &x) const { return ModInt(*this) *= x; }ModInt operator/(const ModInt &x) const { return ModInt(*this) /= x; }friend std::ostream &operator<<(std::ostream &os, const ModInt &x) { return os << x.val; }friend std::istream &operator>>(std::istream &is, ModInt &x) { long long val; is >> val; x = ModInt(val); return is; }private:static int &mod() { static int divisor = 0; return divisor; }};namespace std { ModInt abs(const ModInt &x) { return x; } }struct Combinatorics {int val; // "val!" and "mod" must be disjoint.std::vector<ModInt> fact, fact_inv, inv;Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {fact[0] = 1;for (int i = 1; i <= val; ++i) fact[i] = fact[i - 1] * i;fact_inv[val] = ModInt(1) / fact[val];for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;for (int i = 1; i <= val; ++i) inv[i] = fact[i - 1] * fact_inv[i];}ModInt nCk(int n, int k) const {if (n < 0 || n < k || k < 0) return 0;assert(n <= val && k <= val);return fact[n] * fact_inv[k] * fact_inv[n - k];}ModInt nPk(int n, int k) const {if (n < 0 || n < k || k < 0) return 0;assert(n <= val);return fact[n] * fact_inv[n - k];}ModInt nHk(int n, int k) const {if (n < 0 || k < 0) return 0;return k == 0 ? 1 : nCk(n + k - 1, k);}};int main() {int n, k, m; cin >> n >> k >> m;ModInt::set_mod(m);vector<vector<int>> peah(4, vector<int>(n)); REP(i, 4) REP(j, n) cin >> peah[i][j];REP(i, 4) sort(ALL(peah[i]));ModInt ans = 0;REP(j, n) {int mn = 1000000000, mx = 0;REP(i, 4) {chmin(mn, peah[i][j]);chmax(mx, peah[i][j]);}ans += ModInt(mx - mn).pow(k);}cout << ans << '\n';return 0;}