結果

問題 No.1359 [Zelkova 3rd Tune] 四人セゾン
ユーザー tokusakuraitokusakurai
提出日時 2021-01-22 21:54:48
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 273 ms / 2,000 ms
コード長 3,336 bytes
コンパイル時間 2,104 ms
コンパイル使用メモリ 206,308 KB
最終ジャッジ日時 2025-01-18 04:12:48
ジャッジサーバーID
(参考情報)
judge2 / judge2
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 75
権限があれば一括ダウンロードができます

ソースコード

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

#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define each(e, v) for(auto &e: v)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define rall(x) x.rbegin(), x.rend()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
const int MOD = 1000000007;
//const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};
struct io_setup{
io_setup(){
ios_base::sync_with_stdio(false);
cin.tie(NULL);
cout << fixed << setprecision(15);
}
} io_setup;
struct Random_Number_Generator{
mt19937_64 mt;
Random_Number_Generator() : mt(chrono::steady_clock::now().time_since_epoch().count()) {}
int64_t operator () (int64_t l, int64_t r){
uniform_int_distribution<int64_t> dist(l, r-1);
return dist(mt);
}
int64_t operator () (int64_t r){
return (*this)(0, r);
}
};
ll modpow(ll x, ll n, const int &m){
ll ret = 1;
for(; n; n >>= 1, x *= x, x %= m){
if(n&1) ret *= x, ret %= m;
}
return ret;
}
template<typename T> T Euler_Totient(T m){ //φ(xmx^φ(m)≡1(mod m))
T ret = m;
for(T i = 2; i*i <= m; i++){
if(m%i == 0) ret /= i, ret *= i-1;
while(m%i == 0) m /= i;
}
if(m > 1) ret /= m, ret *= m-1;
return ret;
}
int modlog(const int &x, ll y, const int &m){ //x^k=y(mod m)k(xm)
unordered_map<int, int> mp;
int n = 0; ll now = 1;
for(; n*n < m; n++){
if(!mp.count(now)) mp[now] = n;
now *= x, now %= m;
}
now = modpow(now, Euler_Totient(m)-1, m);
rep(i, n){
if(mp.count(y)) return n*i+mp[y];
y *= now, y %= m;
}
return -1;
}
template<typename T> T order(T x, const T &m){ //x^k=1(mod m)k(xm)
T n = Euler_Totient(m);
vector<T> ds;
for(T i = 1; i*i <= n; i++){
if(n%i == 0) ds.pb(i), ds.pb(n/i);
}
sort(all(ds));
for(auto &e: ds){
if(modpow(x, e, m) == 1) return e;
}
return -1;
}
template<typename T> T primitive_root(const T &m){ //m
vector<T> ds;
for(T i = 1; i*i <= m-1; i++){
if((m-1)%i == 0) ds.pb(i), ds.pb((m-1)/i);
}
sort(all(ds));
Random_Number_Generator rnd;
while(true){
T r = rnd(1, m);
for(auto &e: ds){
if(e == m-1) return r;
if(modpow(r, e, m) == 1) break;
}
}
}
int main(){
int N; ll K, M; cin >> N >> K >> M;
vector<vector<ll>> A(4, vector<ll>(N));
rep(i, 4){
rep(j, N) cin >> A[i][j];
}
rep(i, 4) sort(all(A[i]));
ll ans = 0;
rep(i, N){
ll p = -INF, m = INF;
rep(j, 4) chmax(p, A[j][i]), chmin(m, A[j][i]);
ans += modpow(p-m, K, M);
ans %= M;
}
cout << ans << '\n';
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0