結果
問題 | No.1359 [Zelkova 3rd Tune] 四人セゾン |
ユーザー |
![]() |
提出日時 | 2021-01-22 23:32:13 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 298 ms / 2,000 ms |
コード長 | 9,775 bytes |
コンパイル時間 | 4,077 ms |
コンパイル使用メモリ | 257,932 KB |
最終ジャッジ日時 | 2025-01-18 06:19:52 |
ジャッジサーバーID (参考情報) |
judge4 / judge1 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 3 |
other | AC * 75 |
コンパイルメッセージ
main.cpp: In function ‘void scanner::scan(char*)’: main.cpp:83:33: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 83 | void scan(char a[]) { std::scanf("%s", a); } | ~~~~~~~~~~^~~~~~~~~
ソースコード
#ifdef LOCAL#define _GLIBCXX_DEBUG#endif#include <bits/stdc++.h>using namespace std;#if __has_include(<atcoder/all>)#include <atcoder/all>using namespace atcoder;#endif#pragma region Macros// rep macro#define fi first#define se second#define foa(v, a) for(auto &v : a)#define REPname(a, b, c, d, e, ...) e#define REP(...) REPname(__VA_ARGS__, REP3, REP2, REP1, REP0)(__VA_ARGS__)#define REP0(x) for(int i = 0; i < (x); ++i)#define REP1(i, x) for(int i = 0; i < (x); ++i)#define REP2(i, l, r) for(int i = (l); i < (r); ++i)#define REP3(i, l, r, c) for(int i = (l); i < (r); i += (c))#define REPSname(a, b, c, ...) c#define REPS(...) REPSname(__VA_ARGS__, REPS1, REPS0)(__VA_ARGS__)#define REPS0(x) for(int i = 1; i <= (x); ++i)#define REPS1(i, x) for(int i = 1; i <= (x); ++i)#define RREPname(a, b, c, d, e, ...) e#define RREP(...) RREPname(__VA_ARGS__, RREP3, RREP2, RREP1, RREP0)(__VA_ARGS__)#define RREP0(x) for(int i = (x)-1; i >= 0; --i)#define RREP1(i, x) for(int i = (x)-1; i >= 0; --i)#define RREP2(i, l, r) for(int i = (r)-1; i >= (l); --i)#define RREP3(i, l, r, c) for(int i = (r)-1; i >= (l); i -= (c))#define RREPSname(a, b, c, ...) c#define RREPS(...) RREPSname(__VA_ARGS__, RREPS1, RREPS0)(__VA_ARGS__)#define RREPS0(x) for(int i = (x); i >= 1; --i)#define RREPS1(i, x) for(int i = (x); i >= 1; --i)// name macro#define pb push_back#define eb emplace_back#define SZ(x) ((int)(x).size())#define all(x) (x).begin(), (x).end()#define rall(x) (x).rbegin(), (x).rend()#define popcnt(x) __builtin_popcountll(x)template <class T = int>using V = std::vector<T>;template <class T = int>using VV = std::vector<std::vector<T>>;template <class T>using pqup = std::priority_queue<T, std::vector<T>, std::greater<T>>;using ll = long long;using ld = long double;using int128 = __int128_t;using pii = std::pair<int, int>;using pll = std::pair<long long, long long>;// input macrotemplate <class T, class U>std::istream &operator>>(std::istream &is, std::pair<T, U> &p) {is >> p.first >> p.second;return is;}template <class T>std::istream &operator>>(std::istream &is, std::vector<T> &v) {for(T &i : v) is >> i;return is;}std::istream &operator>>(std::istream &is, __int128_t &a) {std::string s;is >> s;__int128_t ret = 0;for(int i = 0; i < s.length(); i++)if('0' <= s[i] and s[i] <= '9')ret = 10 * ret + s[i] - '0';a = ret * (s[0] == '-' ? -1 : 1);return is;}namespace scanner {void scan(int &a) { std::cin >> a; }void scan(long long &a) { std::cin >> a; }void scan(std::string &a) { std::cin >> a; }void scan(char &a) { std::cin >> a; }void scan(char a[]) { std::scanf("%s", a); }void scan(double &a) { std::cin >> a; }void scan(long double &a) { std::cin >> a; }template <class T, class U>void scan(std::pair<T, U> &p) { std::cin >> p; }template <class T>void scan(std::vector<T> &a) { std::cin >> a; }void INPUT() {}template <class Head, class... Tail>void INPUT(Head &head, Tail &... tail) {scan(head);INPUT(tail...);}} // namespace scanner#define VEC(type, name, size) \std::vector<type> name(size); \scanner::INPUT(name)#define VVEC(type, name, h, w) \std::vector<std::vector<type>> name(h, std::vector<type>(w)); \scanner::INPUT(name)#define INT(...) \int __VA_ARGS__; \scanner::INPUT(__VA_ARGS__)#define LL(...) \long long __VA_ARGS__; \scanner::INPUT(__VA_ARGS__)#define STR(...) \std::string __VA_ARGS__; \scanner::INPUT(__VA_ARGS__)#define CHAR(...) \char __VA_ARGS__; \scanner::INPUT(__VA_ARGS__)#define DOUBLE(...) \double __VA_ARGS__; \scanner::INPUT(__VA_ARGS__)#define LD(...) \long double __VA_ARGS__; \scanner::INPUT(__VA_ARGS__)// output-macrotemplate <class T, class U>std::ostream &operator<<(std::ostream &os, const std::pair<T, U> &p) {os << p.first << " " << p.second;return os;}template <class T>std::ostream &operator<<(std::ostream &os, const std::vector<T> &a) {for(int i = 0; i < int(a.size()); ++i) {if(i) os << " ";os << a[i];}return os;}std::ostream &operator<<(std::ostream &dest, __int128_t &value) {std::ostream::sentry s(dest);if(s) {__uint128_t tmp = value < 0 ? -value : value;char buffer[128];char *d = std::end(buffer);do {--d;*d = "0123456789"[tmp % 10];tmp /= 10;} while(tmp != 0);if(value < 0) {--d;*d = '-';}int len = std::end(buffer) - d;if(dest.rdbuf()->sputn(d, len) != len) {dest.setstate(std::ios_base::badbit);}}return dest;}template <class T>void print(const T a) { std::cout << a << '\n'; }template <class Head, class... Tail>void print(Head H, Tail... T) {std::cout << H << ' ';print(T...);}template <class T>void printel(const T a) { std::cout << a << '\n'; }template <class T>void printel(const std::vector<T> &a) {for(const auto &v : a)std::cout << v << '\n';}template <class Head, class... Tail>void printel(Head H, Tail... T) {std::cout << H << '\n';printel(T...);}void Yes(const bool b = true) { std::cout << (b ? "Yes\n" : "No\n"); }void No() { std::cout << "No\n"; }void YES(const bool b = true) { std::cout << (b ? "YES\n" : "NO\n"); }void NO() { std::cout << "No\n"; }void err(const bool b = true) {if(b) {std::cout << "-1\n", exit(0);}}//debug macronamespace debugger {template <class T>void view(const std::vector<T> &a) {std::cerr << "{ ";for(const auto &v : a) {std::cerr << v << ", ";}std::cerr << "\b\b }";}template <class T>void view(const std::vector<std::vector<T>> &a) {std::cerr << "{\n";for(const auto &v : a) {std::cerr << "\t";view(v);std::cerr << "\n";}std::cerr << "}";}template <class T, class U>void view(const std::vector<std::pair<T, U>> &a) {std::cerr << "{\n";for(const auto &p : a) std::cerr << "\t(" << p.first << ", " << p.second << ")\n";std::cerr << "}";}template <class T, class U>void view(const std::map<T, U> &m) {std::cerr << "{\n";for(const auto &p : m) std::cerr << "\t[" << p.first << "] : " << p.second << "\n";std::cerr << "}";}template <class T, class U>void view(const std::pair<T, U> &p) { std::cerr << "(" << p.first << ", " << p.second << ")"; }template <class T>void view(const std::set<T> &s) {std::cerr << "{ ";for(auto &v : s) {view(v);std::cerr << ", ";}std::cerr << "\b\b }";}template <class T>void view(const T &e) { std::cerr << e; }} // namespace debugger#ifdef LOCALvoid debug_out() {}template <typename Head, typename... Tail>void debug_out(Head H, Tail... T) {debugger::view(H);std::cerr << ", ";debug_out(T...);}#define debug(...) \do { \std::cerr << __LINE__ << " [" << #__VA_ARGS__ << "] : ["; \debug_out(__VA_ARGS__); \std::cerr << "\b\b]\n"; \} while(false)#else#define debug(...) (void(0))#endif// vector macrotemplate <class T>int lb(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::lower_bound((a).begin(), (a).end(), (x))); }template <class T>int ub(const std::vector<T> &a, const T x) { return std::distance((a).begin(), std::upper_bound((a).begin(), (a).end(), (x))); }template <class T>void UNIQUE(std::vector<T> &a) {std::sort(a.begin(), a.end());a.erase(std::unique(a.begin(), a.end()), a.end());}template <class T>std::vector<T> press(std::vector<T> &a) {auto res = a;UNIQUE(res);for(auto &v : a)v = lb(res, v);return res;}#define SORTname(a, b, c, ...) c#define SORT(...) SORTname(__VA_ARGS__, SORT1, SORT0, ...)(__VA_ARGS__)#define SORT0(a) std::sort((a).begin(), (a).end())#define SORT1(a, c) std::sort((a).begin(), (a).end(), [](const auto x, const auto y) { return x c y; })template <class T>void ADD(std::vector<T> &a, const T x) {for(auto &v : a) v += x;}template <class T>void SUB(std::vector<T> &a, const T x = 1) {for(auto &v : a) v -= x;}template <class T>void MUL(std::vector<T> &a, const T x) {for(auto &v : a) v *= x;}template <class T>void DIV(std::vector<T> &a, const T x) {for(auto &v : a) v /= x;}// math macrotemplate <class T, class U>inline bool chmin(T &a, const U &b) { return a > b ? a = b, true : false; }template <class T, class U>inline bool chmax(T &a, const U &b) { return a < b ? a = b, true : false; }template <class T>T divup(T x, T y) { return (x + y - 1) / y; }template <class T>T POW(T a, long long n) {T ret = 1;while(n) {if(n & 1) ret *= a;a *= a;n >>= 1;}return ret;}// modpowlong long POW(long long a, long long n, const int mod) {long long ret = 1;while(n) {if(n & 1) (ret *= a) %= mod;(a *= a) %= mod;n >>= 1;}return ret;}// othersstruct fast_io {fast_io() {ios::sync_with_stdio(false);cin.tie(nullptr);cout << fixed << setprecision(15);}} fast_io_;const int inf = 1e9;const ll INF = 1e18;#pragma endregioninline int topbit(unsigned long long x){return x?63-__builtin_clzll(x):-1;}inline int popcount(unsigned long long x){return __builtin_popcountll(x);}inline int parity(unsigned long long x){//popcount%2return __builtin_parity(x);}void main_() {LL(N,K,M);VEC(ll,P,N);VEC(ll,E,N);VEC(ll,A,N);VEC(ll,H,N);sort(all(P));sort(all(E));sort(all(A));sort(all(H));ll ans=0;REP(i,N){ll MX=max({P[i],E[i],A[i],H[i]});ll mn=min({P[i],E[i],A[i],H[i]});ll d=MX-mn;ans+=POW(d,K,M);ans%=M;}cout << ans << endl;}int main() {int t = 1;//cin >> t;while(t--) main_();return 0;}