結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー | fastmath |
提出日時 | 2021-01-22 21:47:05 |
言語 | C++17 (gcc 12.3.0 + boost 1.83.0) |
結果 |
AC
|
実行時間 | 313 ms / 2,000 ms |
コード長 | 3,538 bytes |
コンパイル時間 | 2,958 ms |
コンパイル使用メモリ | 208,508 KB |
実行使用メモリ | 11,160 KB |
最終ジャッジ日時 | 2023-08-27 18:32:36 |
合計ジャッジ時間 | 22,510 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge14 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 1 ms
4,376 KB |
testcase_01 | AC | 2 ms
4,380 KB |
testcase_02 | AC | 1 ms
4,376 KB |
testcase_03 | AC | 156 ms
6,940 KB |
testcase_04 | AC | 156 ms
7,148 KB |
testcase_05 | AC | 142 ms
6,936 KB |
testcase_06 | AC | 143 ms
6,940 KB |
testcase_07 | AC | 214 ms
8,868 KB |
testcase_08 | AC | 215 ms
8,544 KB |
testcase_09 | AC | 60 ms
4,648 KB |
testcase_10 | AC | 60 ms
4,612 KB |
testcase_11 | AC | 276 ms
10,240 KB |
testcase_12 | AC | 273 ms
10,320 KB |
testcase_13 | AC | 176 ms
7,568 KB |
testcase_14 | AC | 176 ms
7,476 KB |
testcase_15 | AC | 155 ms
7,068 KB |
testcase_16 | AC | 155 ms
6,948 KB |
testcase_17 | AC | 293 ms
10,452 KB |
testcase_18 | AC | 294 ms
10,356 KB |
testcase_19 | AC | 255 ms
9,412 KB |
testcase_20 | AC | 253 ms
9,312 KB |
testcase_21 | AC | 274 ms
9,828 KB |
testcase_22 | AC | 274 ms
9,848 KB |
testcase_23 | AC | 185 ms
8,000 KB |
testcase_24 | AC | 185 ms
8,264 KB |
testcase_25 | AC | 30 ms
4,380 KB |
testcase_26 | AC | 29 ms
4,376 KB |
testcase_27 | AC | 98 ms
5,512 KB |
testcase_28 | AC | 97 ms
5,360 KB |
testcase_29 | AC | 118 ms
6,156 KB |
testcase_30 | AC | 119 ms
6,280 KB |
testcase_31 | AC | 158 ms
7,204 KB |
testcase_32 | AC | 158 ms
7,204 KB |
testcase_33 | AC | 117 ms
5,980 KB |
testcase_34 | AC | 117 ms
5,884 KB |
testcase_35 | AC | 155 ms
7,076 KB |
testcase_36 | AC | 155 ms
7,024 KB |
testcase_37 | AC | 32 ms
4,380 KB |
testcase_38 | AC | 32 ms
4,380 KB |
testcase_39 | AC | 26 ms
4,376 KB |
testcase_40 | AC | 26 ms
4,380 KB |
testcase_41 | AC | 55 ms
4,376 KB |
testcase_42 | AC | 55 ms
4,376 KB |
testcase_43 | AC | 45 ms
4,376 KB |
testcase_44 | AC | 289 ms
10,544 KB |
testcase_45 | AC | 122 ms
6,144 KB |
testcase_46 | AC | 42 ms
4,376 KB |
testcase_47 | AC | 208 ms
8,436 KB |
testcase_48 | AC | 194 ms
8,028 KB |
testcase_49 | AC | 195 ms
8,340 KB |
testcase_50 | AC | 151 ms
7,024 KB |
testcase_51 | AC | 8 ms
4,376 KB |
testcase_52 | AC | 259 ms
9,680 KB |
testcase_53 | AC | 294 ms
11,032 KB |
testcase_54 | AC | 309 ms
11,160 KB |
testcase_55 | AC | 305 ms
11,036 KB |
testcase_56 | AC | 311 ms
11,008 KB |
testcase_57 | AC | 312 ms
11,156 KB |
testcase_58 | AC | 308 ms
11,032 KB |
testcase_59 | AC | 307 ms
11,032 KB |
testcase_60 | AC | 301 ms
11,112 KB |
testcase_61 | AC | 287 ms
10,944 KB |
testcase_62 | AC | 307 ms
11,000 KB |
testcase_63 | AC | 310 ms
10,884 KB |
testcase_64 | AC | 309 ms
10,932 KB |
testcase_65 | AC | 305 ms
11,000 KB |
testcase_66 | AC | 305 ms
10,888 KB |
testcase_67 | AC | 313 ms
10,936 KB |
testcase_68 | AC | 301 ms
10,888 KB |
testcase_69 | AC | 284 ms
10,888 KB |
testcase_70 | AC | 286 ms
11,036 KB |
testcase_71 | AC | 278 ms
11,072 KB |
testcase_72 | AC | 310 ms
11,000 KB |
testcase_73 | AC | 303 ms
10,896 KB |
testcase_74 | AC | 297 ms
11,060 KB |
testcase_75 | AC | 299 ms
10,936 KB |
testcase_76 | AC | 295 ms
11,000 KB |
testcase_77 | AC | 298 ms
10,916 KB |
ソースコード
#include<bits/stdc++.h> using namespace std; #define int long long #define ii pair <int, int> #define app push_back #define all(a) a.begin(), a.end() #define bp __builtin_popcountll #define ll long long #define mp make_pair #define x first #define y second #define Time (double)clock()/CLOCKS_PER_SEC #define debug(x) std::cout << #x << ": " << x << '\n'; #define FOR(i, n) for (int i = 0; i < n; ++i) #define pb push_back #define trav(a, x) for (auto& a : x) using vi = vector<int>; template <typename T> std::ostream& operator <<(std::ostream& output, const pair <T, T> & data) { output << "(" << data.x << "," << data.y << ")"; return output; } template <typename T> std::ostream& operator <<(std::ostream& output, const std::vector<T>& data) { for (const T& x : data) output << x << " "; return output; } ll div_up(ll a, ll b) { return a/b+((a^b)>0&&a%b); } // divide a by b rounded up ll div_down(ll a, ll b) { return a/b-((a^b)<0&&a%b); } // divide a by b rounded down #define tcT template<class T #define tcTU tcT, class U tcT> using V = vector<T>; tcT> void re(V<T>& x) { trav(a, x) cin >> a; } tcT> bool ckmin(T& a, const T& b) { return b < a ? a = b, 1 : 0; } // set a = min(a,b) tcT> bool ckmax(T& a, const T& b) { return a < b ? a = b, 1 : 0; } //need define int long long namespace Stuff { int MOD; int mod(int n) { n %= MOD; if (n < 0) return n + MOD; else return n; } int fp(int a, int p) { int ans = 1, c = a; for (int i = 0; (1ll << i) <= p; ++i) { if ((p >> i) & 1) ans = mod(ans * c); c = mod(c * c); } return ans; } int dv(int a, int b) { return mod(a * fp(b, MOD - 2)); } }; struct M { ll x; M (int x_) { x = Stuff::mod(x_); } M () { x = 0; } M operator + (M y) { int ans = x + y.x; if (ans >= Stuff::MOD) ans -= Stuff::MOD; return M(ans); } M operator - (M y) { int ans = x - y.x; if (ans < 0) ans += Stuff::MOD; return M(ans); } M operator * (M y) { return M(x * y.x % Stuff::MOD); } M operator / (M y) { return M(x * Stuff::fp(y.x, Stuff::MOD - 2) % Stuff::MOD); } M operator + (int y) { return (*this) + M(y); } M operator - (int y) { return (*this) - M(y); } M operator * (int y) { return (*this) * M(y); } M operator / (int y) { return (*this) / M(y); } M operator ^ (int p) { return M(Stuff::fp(x, p)); } void operator += (M y) { *this = *this + y; } void operator -= (M y) { *this = *this - y; } void operator *= (M y) { *this = *this * y; } void operator /= (M y) { *this = *this / y; } void operator += (int y) { *this = *this + y; } void operator -= (int y) { *this = *this - y; } void operator *= (int y) { *this = *this * y; } void operator /= (int y) { *this = *this / y; } void operator ^= (int p) { *this = *this ^ p; } bool operator == (M y) { return x == y.x; } }; std::ostream& operator << (std::ostream& o, const M& a) { cout << a.x; return o; } signed main() { #ifdef HOME freopen("input.txt", "r", stdin); #else #define endl '\n' ios_base::sync_with_stdio(0); cin.tie(0); #endif int n, k, m; cin >> n >> k >> m; Stuff::MOD = m; V < vi > a(4, vi (n)); M ans = 0; FOR (i, 4) { FOR (j, n) { cin >> a[i][j]; } sort(all(a[i])); } FOR (i, n) { vi b; FOR (j, 4) b.app(a[j][i]); sort(all(b)); ans += M(b.back() - b[0]) ^ k; } cout << ans << endl; }