結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー | 👑 tute7627 |
提出日時 | 2021-01-22 21:53:34 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 282 ms / 2,000 ms |
コード長 | 3,301 bytes |
コンパイル時間 | 4,970 ms |
コンパイル使用メモリ | 208,508 KB |
実行使用メモリ | 11,168 KB |
最終ジャッジ日時 | 2023-08-27 18:44:06 |
合計ジャッジ時間 | 22,040 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 2 ms
4,356 KB |
testcase_01 | AC | 2 ms
4,356 KB |
testcase_02 | AC | 2 ms
4,352 KB |
testcase_03 | AC | 143 ms
7,020 KB |
testcase_04 | AC | 142 ms
6,936 KB |
testcase_05 | AC | 128 ms
7,040 KB |
testcase_06 | AC | 129 ms
6,936 KB |
testcase_07 | AC | 193 ms
8,880 KB |
testcase_08 | AC | 193 ms
8,508 KB |
testcase_09 | AC | 54 ms
4,656 KB |
testcase_10 | AC | 54 ms
4,616 KB |
testcase_11 | AC | 247 ms
10,092 KB |
testcase_12 | AC | 249 ms
10,204 KB |
testcase_13 | AC | 158 ms
7,588 KB |
testcase_14 | AC | 159 ms
7,504 KB |
testcase_15 | AC | 140 ms
6,928 KB |
testcase_16 | AC | 141 ms
7,140 KB |
testcase_17 | AC | 266 ms
10,484 KB |
testcase_18 | AC | 265 ms
10,360 KB |
testcase_19 | AC | 228 ms
9,420 KB |
testcase_20 | AC | 231 ms
9,492 KB |
testcase_21 | AC | 249 ms
9,956 KB |
testcase_22 | AC | 248 ms
9,884 KB |
testcase_23 | AC | 168 ms
8,080 KB |
testcase_24 | AC | 169 ms
8,076 KB |
testcase_25 | AC | 27 ms
4,356 KB |
testcase_26 | AC | 27 ms
4,356 KB |
testcase_27 | AC | 88 ms
5,444 KB |
testcase_28 | AC | 88 ms
5,392 KB |
testcase_29 | AC | 108 ms
6,264 KB |
testcase_30 | AC | 108 ms
6,232 KB |
testcase_31 | AC | 143 ms
7,184 KB |
testcase_32 | AC | 144 ms
7,304 KB |
testcase_33 | AC | 106 ms
5,976 KB |
testcase_34 | AC | 106 ms
5,936 KB |
testcase_35 | AC | 140 ms
7,120 KB |
testcase_36 | AC | 140 ms
7,048 KB |
testcase_37 | AC | 29 ms
4,352 KB |
testcase_38 | AC | 29 ms
4,352 KB |
testcase_39 | AC | 24 ms
4,356 KB |
testcase_40 | AC | 23 ms
4,360 KB |
testcase_41 | AC | 50 ms
4,356 KB |
testcase_42 | AC | 50 ms
4,376 KB |
testcase_43 | AC | 40 ms
4,376 KB |
testcase_44 | AC | 263 ms
10,372 KB |
testcase_45 | AC | 111 ms
6,136 KB |
testcase_46 | AC | 38 ms
4,356 KB |
testcase_47 | AC | 188 ms
8,244 KB |
testcase_48 | AC | 175 ms
7,980 KB |
testcase_49 | AC | 177 ms
8,260 KB |
testcase_50 | AC | 136 ms
7,032 KB |
testcase_51 | AC | 8 ms
4,352 KB |
testcase_52 | AC | 235 ms
9,584 KB |
testcase_53 | AC | 264 ms
10,896 KB |
testcase_54 | AC | 277 ms
11,000 KB |
testcase_55 | AC | 275 ms
11,012 KB |
testcase_56 | AC | 276 ms
11,000 KB |
testcase_57 | AC | 280 ms
10,880 KB |
testcase_58 | AC | 277 ms
10,948 KB |
testcase_59 | AC | 274 ms
10,900 KB |
testcase_60 | AC | 270 ms
10,944 KB |
testcase_61 | AC | 257 ms
11,024 KB |
testcase_62 | AC | 276 ms
11,004 KB |
testcase_63 | AC | 275 ms
10,992 KB |
testcase_64 | AC | 278 ms
11,168 KB |
testcase_65 | AC | 274 ms
10,900 KB |
testcase_66 | AC | 274 ms
11,160 KB |
testcase_67 | AC | 282 ms
10,908 KB |
testcase_68 | AC | 269 ms
10,948 KB |
testcase_69 | AC | 254 ms
11,116 KB |
testcase_70 | AC | 256 ms
10,900 KB |
testcase_71 | AC | 247 ms
10,896 KB |
testcase_72 | AC | 279 ms
10,988 KB |
testcase_73 | AC | 271 ms
10,992 KB |
testcase_74 | AC | 270 ms
11,116 KB |
testcase_75 | AC | 272 ms
11,024 KB |
testcase_76 | AC | 268 ms
10,992 KB |
testcase_77 | AC | 270 ms
10,948 KB |
ソースコード
//#define _GLIBCXX_DEBUG #include<bits/stdc++.h> using namespace std; #define endl '\n' #define lfs cout<<fixed<<setprecision(10) #define ALL(a) (a).begin(),(a).end() #define ALLR(a) (a).rbegin(),(a).rend() #define spa << " " << #define fi first #define se second #define MP make_pair #define MT make_tuple #define PB push_back #define EB emplace_back #define rep(i,n,m) for(ll i = (n); i < (ll)(m); i++) #define rrep(i,n,m) for(ll i = (ll)(m) - 1; i >= (ll)(n); i--) using ll = long long; using ld = long double; const ll MOD1 = 1e9+7; const ll MOD9 = 998244353; const ll INF = 1e18; using P = pair<ll, ll>; template<typename T1, typename T2>bool chmin(T1 &a,T2 b){if(a>b){a=b;return true;}else return false;} template<typename T1, typename T2>bool chmax(T1 &a,T2 b){if(a<b){a=b;return true;}else return false;} ll median(ll a,ll b, ll c){return a+b+c-max({a,b,c})-min({a,b,c});} void ans1(bool x){if(x) cout<<"Yes"<<endl;else cout<<"No"<<endl;} void ans2(bool x){if(x) cout<<"YES"<<endl;else cout<<"NO"<<endl;} void ans3(bool x){if(x) cout<<"Yay!"<<endl;else cout<<":("<<endl;} template<typename T1,typename T2>void ans(bool x,T1 y,T2 z){if(x)cout<<y<<endl;else cout<<z<<endl;} template<typename T>void debug(vector<vector<T>>&v,ll h,ll w){for(ll i=0;i<h;i++){cout<<v[i][0];for(ll j=1;j<w;j++)cout spa v[i][j];cout<<endl;}}; void debug(vector<string>&v,ll h,ll w){for(ll i=0;i<h;i++){for(ll j=0;j<w;j++)cout<<v[i][j];cout<<endl;}}; template<typename T>void debug(vector<T>&v,ll n){if(n!=0)cout<<v[0];for(ll i=1;i<n;i++)cout spa v[i];cout<<endl;}; template<typename T>vector<vector<T>>vec(ll x, ll y, T w){vector<vector<T>>v(x,vector<T>(y,w));return v;} ll gcd(ll x,ll y){ll r;while(y!=0&&(r=x%y)!=0){x=y;y=r;}return y==0?x:y;} vector<ll>dx={1,-1,0,0,1,1,-1,-1};vector<ll>dy={0,0,1,-1,1,-1,1,-1}; template<typename T>vector<T> make_v(size_t a,T b){return vector<T>(a,b);} template<typename... Ts>auto make_v(size_t a,Ts... ts){return vector<decltype(make_v(ts...))>(a,make_v(ts...));} template<typename T1, typename T2>ostream &operator<<(ostream &os, const pair<T1, T2>&p){return os << p.first << " " << p.second;} template<typename T>ostream &operator<<(ostream &os, const vector<T> &v){for(auto &z:v)os << z << " ";cout<<"|"; return os;} template<typename T>void rearrange(vector<ll>&ord, vector<T>&v){ auto tmp = v; for(int i=0;i<tmp.size();i++)v[i] = tmp[ord[i]]; } template<typename Head, typename... Tail>void rearrange(vector<ll>&ord,Head&& head, Tail&&... tail){ rearrange(ord, head); rearrange(ord, tail...); } //mt19937 mt(chrono::steady_clock::now().time_since_epoch().count()); int popcount(ll x){return __builtin_popcountll(x);}; int poplow(ll x){return __builtin_ctzll(x);}; int pophigh(ll x){return 63 - __builtin_clzll(x);}; ll modpow(ll x,ll k,ll m){ x%=m; ll now=x,ret=1; while(k){ if(k&1)ret=(ret*now)%m; now=(now*now)%m; k>>=1; } return ret; } int main(){ cin.tie(nullptr); ios_base::sync_with_stdio(false); ll res=0,buf=0; bool judge = true; ll n,k,m;cin>>n>>k>>m; auto a=vec(4,n,0LL); rep(i,0,4)rep(j,0,n)cin>>a[i][j]; rep(i,0,4)sort(ALL(a[i])); rep(i,0,n){ ll mx=0,mi=INF; rep(j,0,4){ chmax(mx,a[j][i]); chmin(mi,a[j][i]); } res+=modpow(mx-mi,k,m); res%=m; } cout<<res<<endl; return 0; }