結果

問題 No.1359 [Zelkova 3rd Tune] 四人セゾン
ユーザー kiyoshi0205kiyoshi0205
提出日時 2021-01-22 21:34:58
言語 C++14
(gcc 12.3.0 + boost 1.83.0)
結果
AC  
実行時間 264 ms / 2,000 ms
コード長 4,413 bytes
コンパイル時間 2,413 ms
コンパイル使用メモリ 187,756 KB
実行使用メモリ 7,932 KB
最終ジャッジ日時 2023-08-27 17:46:32
合計ジャッジ時間 20,767 ms
ジャッジサーバーID
(参考情報)
judge13 / judge14
このコードへのチャレンジ(β)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,380 KB
testcase_01 AC 2 ms
4,376 KB
testcase_02 AC 1 ms
4,376 KB
testcase_03 AC 125 ms
5,416 KB
testcase_04 AC 126 ms
5,396 KB
testcase_05 AC 118 ms
5,440 KB
testcase_06 AC 115 ms
5,444 KB
testcase_07 AC 174 ms
6,444 KB
testcase_08 AC 180 ms
6,424 KB
testcase_09 AC 48 ms
4,380 KB
testcase_10 AC 48 ms
4,376 KB
testcase_11 AC 231 ms
7,236 KB
testcase_12 AC 225 ms
7,260 KB
testcase_13 AC 148 ms
5,732 KB
testcase_14 AC 149 ms
5,676 KB
testcase_15 AC 127 ms
5,368 KB
testcase_16 AC 128 ms
5,416 KB
testcase_17 AC 242 ms
7,548 KB
testcase_18 AC 242 ms
7,612 KB
testcase_19 AC 218 ms
7,000 KB
testcase_20 AC 214 ms
7,036 KB
testcase_21 AC 227 ms
7,244 KB
testcase_22 AC 230 ms
7,304 KB
testcase_23 AC 158 ms
5,968 KB
testcase_24 AC 151 ms
6,000 KB
testcase_25 AC 25 ms
4,380 KB
testcase_26 AC 25 ms
4,380 KB
testcase_27 AC 81 ms
4,720 KB
testcase_28 AC 81 ms
4,632 KB
testcase_29 AC 99 ms
4,888 KB
testcase_30 AC 99 ms
4,916 KB
testcase_31 AC 134 ms
5,372 KB
testcase_32 AC 132 ms
5,440 KB
testcase_33 AC 101 ms
4,856 KB
testcase_34 AC 96 ms
4,908 KB
testcase_35 AC 129 ms
5,388 KB
testcase_36 AC 130 ms
5,428 KB
testcase_37 AC 27 ms
4,376 KB
testcase_38 AC 25 ms
4,380 KB
testcase_39 AC 21 ms
4,380 KB
testcase_40 AC 21 ms
4,376 KB
testcase_41 AC 47 ms
4,380 KB
testcase_42 AC 48 ms
4,380 KB
testcase_43 AC 39 ms
4,380 KB
testcase_44 AC 243 ms
7,512 KB
testcase_45 AC 102 ms
4,896 KB
testcase_46 AC 36 ms
4,376 KB
testcase_47 AC 174 ms
6,232 KB
testcase_48 AC 158 ms
6,180 KB
testcase_49 AC 161 ms
6,264 KB
testcase_50 AC 122 ms
5,556 KB
testcase_51 AC 7 ms
4,380 KB
testcase_52 AC 215 ms
7,024 KB
testcase_53 AC 244 ms
7,788 KB
testcase_54 AC 254 ms
7,772 KB
testcase_55 AC 246 ms
7,848 KB
testcase_56 AC 255 ms
7,772 KB
testcase_57 AC 262 ms
7,808 KB
testcase_58 AC 264 ms
7,796 KB
testcase_59 AC 253 ms
7,788 KB
testcase_60 AC 250 ms
7,880 KB
testcase_61 AC 239 ms
7,768 KB
testcase_62 AC 262 ms
7,812 KB
testcase_63 AC 256 ms
7,768 KB
testcase_64 AC 262 ms
7,768 KB
testcase_65 AC 259 ms
7,764 KB
testcase_66 AC 253 ms
7,764 KB
testcase_67 AC 263 ms
7,796 KB
testcase_68 AC 253 ms
7,816 KB
testcase_69 AC 239 ms
7,900 KB
testcase_70 AC 242 ms
7,888 KB
testcase_71 AC 231 ms
7,808 KB
testcase_72 AC 258 ms
7,808 KB
testcase_73 AC 244 ms
7,828 KB
testcase_74 AC 245 ms
7,792 KB
testcase_75 AC 245 ms
7,812 KB
testcase_76 AC 246 ms
7,788 KB
testcase_77 AC 250 ms
7,932 KB
権限があれば一括ダウンロードができます

ソースコード

diff #

#pragma GCC target("avx")
#pragma GCC optimize("O3")
#pragma GCC optimize("unroll-loops")
#include<bits/stdc++.h>
// #include<ext/pb_ds/assoc_container.hpp>
// #include<ext/pb_ds/tree_policy.hpp>
// #include<ext/pb_ds/tag_and_trait.hpp>
// using namespace __gnu_pbds;
// #include<boost/multiprecision/cpp_int.hpp>
// namespace multiprecisioninteger = boost::multiprecision;
// using cint=multiprecisioninteger::cpp_int;
using namespace std;
using ll=long long;
#define double long double
using datas=pair<ll,ll>;
using ddatas=pair<double,double>;
using tdata=pair<ll,datas>;
using vec=vector<ll>;
using mat=vector<vec>;
using pvec=vector<datas>;
using pmat=vector<pvec>;
// using llset=tree<ll,null_type,less<ll>,rb_tree_tag,tree_order_statistics_node_update>;
#define For(i,a,b) for(i=a;i<(ll)b;++i)
#define bFor(i,b,a) for(i=b,--i;i>=(ll)a;--i)
#define rep(i,N) For(i,0,N)
#define rep1(i,N) For(i,1,N)
#define brep(i,N) bFor(i,N,0)
#define brep1(i,N) bFor(i,N,1)
#define all(v) (v).begin(),(v).end()
#define allr(v) (v).rbegin(),(v).rend()
#define vsort(v) sort(all(v))
#define vrsort(v) sort(allr(v))
#define uniq(v) vsort(v);(v).erase(unique(all(v)),(v).end())
#define endl "\n"
#define eb emplace_back
#define print(x) cout<<x<<endl
#define printyes print("Yes")
#define printno print("No")
#define printYES print("YES")
#define printNO print("NO")
#define output(v) do{bool f=0;for(auto outi:v){cout<<(f?" ":"")<<outi;f=1;}cout<<endl;}while(0)
#define matoutput(v) do{for(auto outimat:v)output(outimat);}while(0)
constexpr ll mod=1000000007;
// constexpr ll mod=998244353;
constexpr ll inf=1LL<<60;
constexpr double eps=1e-9;
const double PI=acos(-1);
template<class T,class E> ostream& operator<<(ostream& os,const pair<T,E>& p){return os<<"("<<p.first<<","<<p.second<<")";}
template<class T> ostream& operator<<(ostream& os,const vector<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> ostream& operator<<(ostream& os,const set<T>& v){
  os<<"{";bool f=false;
  for(auto& x:v){if(f)os<<",";os<<x;f=true;}
  os<<"}";
  return os;
}
template<class T> inline bool chmax(T& a,T b){bool x=a<b;if(x)a=b;return x;}
template<class T> inline bool chmin(T& a,T b){bool x=a>b;if(x)a=b;return x;}
#ifdef DEBUG
void debugg(){cout<<endl;}
template<class T,class... Args>void debugg(const T& x,const Args&... args){cout<<" "<<x;debugg(args...);}
#define debug(...) cout<<__LINE__<<" ["<<#__VA_ARGS__<<"]:",debugg(__VA_ARGS__)
#else
#define debug(...) (void(0))
#endif

void startupcpp(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  cout<<fixed<<setprecision(15);
}

double distance(ddatas x,ddatas y){
  double a=x.first-y.first,b=x.second-y.second;
  return sqrt(a*a+b*b);
}

ll modinv(ll a,ll m=mod) {
  ll b=m,u=1,v=0,t;
  while(b){
    t=a/b;
    a-=t*b; swap(a,b);
    u-=t*v; swap(u,v);
  }
  return (u+m)%m;
}

ll moddevide(ll a,ll b){return (a*modinv(b))%mod;}

vec modncrlistp,modncrlistm;

ll modncr(ll n,ll r){
  if(n<r)return 0;
  ll i,size=modncrlistp.size();
  if(size<=n){
    modncrlistp.resize(n+1);
    modncrlistm.resize(n+1);
    if(!size){
      modncrlistp[0]=modncrlistm[0]=1;
      size++;
    }
    For(i,size,n+1){
      modncrlistp[i]=modncrlistp[i-1]*i%mod;
      modncrlistm[i]=modinv(modncrlistp[i]);
    }
  }
  return modncrlistp[n]*modncrlistm[r]%mod*modncrlistm[n-r]%mod;
}

ll modpow(ll a,ll n,ll m=mod){
  ll res=1;
  while(n>0){
    if(n&1)res=res*a%m;
    a=a*a%m;
    n>>=1;
  }
  return res;
}

ll gcd(ll a,ll b){if(!b)return abs(a);return (a%b==0)?abs(b):gcd(b,a%b);}
ll lcm(ll a,ll b){return a/gcd(a,b)*b;}

ll countdigits(ll n,ll k=10){
  ll ans=0;
  while(n){n/=k;ans++;}
  return ans;
}

ll sumdigits(ll n,ll k=10){
  ll ans=0;
  while(n){ans+=n%k;n/=k;}
  return ans;
}

ll N,M,K,H,W,A,B,C,D;
string s,t;
ll ans=0;
int main(){
  startupcpp();
  // int codeforces;cin>>codeforces;while(codeforces--){
  ll i,j;
  cin>>N>>K>>M;
  vec a(N,inf),b(N,-inf),v(N);
  rep(i,N)cin>>v[i];
  vsort(v);
  rep(i,N){
    chmin(a[i],v[i]);
    chmax(b[i],v[i]);
  }
  rep(i,N)cin>>v[i];
  vsort(v);
  rep(i,N){
    chmin(a[i],v[i]);
    chmax(b[i],v[i]);
  }
  rep(i,N)cin>>v[i];
  vsort(v);
  rep(i,N){
    chmin(a[i],v[i]);
    chmax(b[i],v[i]);
  }
  rep(i,N)cin>>v[i];
  vsort(v);
  rep(i,N){
    chmin(a[i],v[i]);
    chmax(b[i],v[i]);
  }
  rep(i,N){
    ans+=modpow(b[i]-a[i],K,M);
  }
  print(ans%M);
// }
}
0