結果

問題 No.1359 [Zelkova 3rd Tune] 四人セゾン
ユーザー ゆにぽけゆにぽけ
提出日時 2024-02-23 05:32:14
言語 C++17(gcc12)
(gcc 12.3.0 + boost 1.87.0)
結果
AC  
実行時間 301 ms / 2,000 ms
コード長 3,003 bytes
コンパイル時間 1,385 ms
コンパイル使用メモリ 135,588 KB
実行使用メモリ 7,296 KB
最終ジャッジ日時 2024-09-29 04:47:59
合計ジャッジ時間 23,232 ms
ジャッジサーバーID
(参考情報)
judge5 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 75
権限があれば一括ダウンロードができます

ソースコード

diff #
プレゼンテーションモードにする

#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
struct modint
{
private:
unsigned int value;
static int &mod()
{
static int m = 0;
return m;
}
public:
static void setmod(const int m)
{
mod() = m;
}
modint(const long long x = 0) noexcept
{
long long y = x;
if(y < 0 || y >= mod())
{
y %= mod();
if(y < 0) y += mod();
}
value = (unsigned int)y;
}
unsigned int val() noexcept {return value;}
modint &operator+=(const modint &other) noexcept
{
value += other.value;
if(value >= mod()) value -= mod();
return *this;
}
modint &operator-=(const modint &other) noexcept
{
unsigned int x = value;
if(x < other.value) x += mod();
x -= other.value;
value = x;
return *this;
}
modint &operator*=(const modint &other) noexcept
{
unsigned long long x = value;
x *= other.value;
value = (unsigned int) (x % mod());
return *this;
}
modint &operator/=(const modint &other) noexcept
{
return *this *= other.inverse();
}
modint inverse() const noexcept
{
assert(value);
long long a = value,b = mod(),x = 1,y = 0;
while(b)
{
long long q = a/b;
a -= q*b; swap(a,b);
x -= q*y; swap(x,y);
}
return modint(x);
}
modint power(long long N) const noexcept
{
assert(N >= 0);
modint p = *this,ret = 1;
while(N)
{
if(N & 1) ret *= p;
p *= p;
N >>= 1;
}
return ret;
}
modint operator+() {return *this;}
modint operator-() {return modint() - *this;}
modint &operator++(int) noexcept {return *this += 1;}
modint &operator--(int) noexcept {return *this -= 1;}
friend modint operator+(const modint& lhs, const modint& rhs) {return modint(lhs) += rhs;}
friend modint operator-(const modint& lhs, const modint& rhs) {return modint(lhs) -= rhs;}
friend modint operator*(const modint& lhs, const modint& rhs) {return modint(lhs) *= rhs;}
friend modint operator/(const modint& lhs, const modint& rhs) {return modint(lhs) /= rhs;}
friend ostream &operator<<(ostream &os,const modint &x) {return os << x.value;}
};
using mint = modint;
void Main()
{
int N,K,M;
cin >> N >> K >> M;
mint::setmod(M);
vector<vector<int>> A(4,vector<int>(N));
for(int i = 0;i < 4;i++)
{
for(int j = 0;j < N;j++)
{
cin >> A[i][j];
}
sort(A[i].begin(),A[i].end());
}
mint ans = 0;
for(int i = 0;i < N;i++)
{
int x = 0,y = (int)1e9;
for(int j = 0;j < 4;j++)
{
x = max(x,A[j][i]);
y = min(y,A[j][i]);
}
ans += mint(x - y).power(K);
}
cout << ans << "\n";
}
int main()
{
ios::sync_with_stdio(false);
cin.tie(nullptr);
int tt = 1;
/* cin >> tt; */
while(tt--) Main();
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0