結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー |
![]() |
提出日時 | 2021-01-22 21:43:15 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 243 ms / 2,000 ms |
コード長 | 7,619 bytes |
コンパイル時間 | 2,138 ms |
コンパイル使用メモリ | 201,480 KB |
最終ジャッジ日時 | 2025-01-18 04:04:25 |
ジャッジサーバーID (参考情報) |
judge2 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 75 |
ソースコード
#define LOCAL #include <bits/stdc++.h> using namespace std; #pragma region Macros typedef long long ll; typedef __int128_t i128; typedef unsigned int uint; typedef unsigned long long ull; #define ALL(x) (x).begin(), (x).end() template <typename T> istream& operator>>(istream& is, vector<T>& v) { for (T& x : v) is >> x; return is; } template <typename T> ostream& operator<<(ostream& os, const vector<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const pair<T, U>& p) { os << '(' << p.first << ',' << p.second << ')'; return os; } template <typename T, typename U, typename V> ostream& operator<<(ostream& os, const tuple<T, U, V>& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ')'; return os; } template <typename T, typename U, typename V, typename W> ostream& operator<<(ostream& os, const tuple<T, U, V, W>& t) { os << '(' << get<0>(t) << ',' << get<1>(t) << ',' << get<2>(t) << ',' << get<3>(t) << ')'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T, typename U> ostream& operator<<(ostream& os, const unordered_map<T, U>& m) { os << '{'; for (auto itr = m.begin(); itr != m.end();) { os << '(' << itr->first << ',' << itr->second << ')'; if (++itr != m.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const multiset<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const unordered_set<T>& s) { os << '{'; for (auto itr = s.begin(); itr != s.end();) { os << *itr; if (++itr != s.end()) os << ','; } os << '}'; return os; } template <typename T> ostream& operator<<(ostream& os, const deque<T>& v) { for (int i = 0; i < (int)v.size(); i++) { os << v[i] << (i + 1 == (int)v.size() ? "" : " "); } return os; } void debug_out() { cerr << '\n'; } template <class Head, class... Tail> void debug_out(Head&& head, Tail&&... tail) { cerr << head; if (sizeof...(Tail) > 0) cerr << ", "; debug_out(move(tail)...); } #ifdef LOCAL #define debug(...) \ cerr << " "; \ cerr << #__VA_ARGS__ << " :[" << __LINE__ << ":" << __FUNCTION__ << "]" << '\n'; \ cerr << " "; \ debug_out(__VA_ARGS__) #else #define debug(...) 42 #endif template <typename T> T gcd(T x, T y) { return y != 0 ? gcd(y, x % y) : x; } template <typename T> T lcm(T x, T y) { return x / gcd(x, y) * y; } template <class T1, class T2> inline bool chmin(T1& a, T2 b) { if (a > b) { a = b; return true; } return false; } template <class T1, class T2> inline bool chmax(T1& a, T2 b) { if (a < b) { a = b; return true; } return false; } #pragma endregion const int INF = 1e9; const long long IINF = 1e18; const int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1}; const char dir[4] = {'D', 'R', 'U', 'L'}; const long long MOD = 1000000007; // const long long MOD = 998244353; /** * @brief 実行時 modint * @docs docs/modulo/modint.md */ class dynamic_modint { using i64 = int64_t; using u32 = uint32_t; using u64 = uint64_t; static u32& mod() { static u32 mod_ = 0; return mod_; } public: u32 v; static void set_mod(const u32 x) { assert(x < (u32(1) << 31)); mod() = x; } static u32 get_mod() { return mod(); } dynamic_modint(const i64 x = 0) : v(x < 0 ? get_mod() - 1 - (-(x + 1) % get_mod()) : x % get_mod()) {} u32& value() noexcept { return v; } const u32& value() const noexcept { return v; } dynamic_modint operator+(const dynamic_modint& rhs) const { return dynamic_modint(*this) += rhs; } dynamic_modint operator-(const dynamic_modint& rhs) const { return dynamic_modint(*this) -= rhs; } dynamic_modint operator*(const dynamic_modint& rhs) const { return dynamic_modint(*this) *= rhs; } dynamic_modint operator/(const dynamic_modint& rhs) const { return dynamic_modint(*this) /= rhs; } dynamic_modint& operator+=(const dynamic_modint& rhs) { v += rhs.v; if (v >= get_mod()) v -= get_mod(); return *this; } dynamic_modint& operator-=(const dynamic_modint& rhs) { if (v < rhs.v) v += get_mod(); v -= rhs.v; return *this; } dynamic_modint& operator*=(const dynamic_modint& rhs) { v = (u64)v * rhs.v % get_mod(); return *this; } dynamic_modint& operator/=(const dynamic_modint& rhs) { return *this *= rhs.pow(get_mod() - 2); } dynamic_modint pow(u64 exp) const { dynamic_modint self(*this), res(1); while (exp > 0) { if (exp & 1) res *= self; self *= self; exp >>= 1; } return res; } dynamic_modint& operator++() { if (++v == get_mod()) v = 0; return *this; } dynamic_modint& operator--() { if (v == 0) v = get_mod(); return --v, *this; } dynamic_modint operator++(int) { dynamic_modint t = *this; return ++*this, t; } dynamic_modint operator--(int) { dynamic_modint t = *this; return --*this, t; } dynamic_modint operator-() { return dynamic_modint(get_mod() - v); } template <class T> friend dynamic_modint operator+(T x, dynamic_modint y) { return dynamic_modint(x) + y; } template <class T> friend dynamic_modint operator-(T x, dynamic_modint y) { return dynamic_modint(x) - y; } template <class T> friend dynamic_modint operator*(T x, dynamic_modint y) { return dynamic_modint(x) * y; } template <class T> friend dynamic_modint operator/(T x, dynamic_modint y) { return dynamic_modint(x) / y; } bool operator==(const dynamic_modint& rhs) { return v == rhs.v; } bool operator!=(const dynamic_modint& rhs) { return v != rhs.v; } bool operator!() { return !v; } friend istream& operator>>(istream& s, dynamic_modint& rhs) { i64 v; rhs = dynamic_modint{(s >> v, v)}; return s; } friend ostream& operator<<(ostream& s, const dynamic_modint& rhs) { return s << rhs.v; } }; using mint=dynamic_modint; int main() { cin.tie(0); ios::sync_with_stdio(false); int N,K,M; cin >> N >> K >> M; vector<vector<int>> A(4,vector<int>(N)); cin >> A; mint::set_mod(M); for (int i=0;i<4;i++) sort(ALL(A[i])); mint ans=0; for (int j=0;j<N;j++){ int mi=INF,ma=0; for (int i=0;i<4;i++){ chmin(mi,A[i][j]); chmax(ma,A[i][j]); } mint D=ma-mi; ans+=D.pow(K); } cout << ans << '\n'; return 0; }