結果

問題 No.1359 [Zelkova 3rd Tune] 四人セゾン
ユーザー nok0nok0
提出日時 2021-01-04 17:44:05
言語 C++17
(gcc 13.3.0 + boost 1.87.0)
結果
AC  
実行時間 319 ms / 2,000 ms
コード長 748 bytes
コンパイル時間 2,056 ms
コンパイル使用メモリ 195,212 KB
最終ジャッジ日時 2025-01-17 09:38:10
ジャッジサーバーID
(参考情報)
judge5 / judge5
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 75
権限があれば一括ダウンロードができます
コンパイルメッセージ
main.cpp: In function ‘int main()’:
main.cpp:17:14: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   17 |         scanf("%d%d%d", &n, &k, &m);
      |         ~~~~~^~~~~~~~~~~~~~~~~~~~~~
main.cpp:18:37: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   18 |         for(i = 0; i < n; i++) scanf("%d", &p[i]);
      |                                ~~~~~^~~~~~~~~~~~~
main.cpp:19:37: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   19 |         for(i = 0; i < n; i++) scanf("%d", &e[i]);
      |                                ~~~~~^~~~~~~~~~~~~
main.cpp:20:37: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   20 |         for(i = 0; i < n; i++) scanf("%d", &a[i]);
      |                                ~~~~~^~~~~~~~~~~~~
main.cpp:21:37: warning: ignoring return value of ‘int scanf(const char*, ...)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
   21 |         for(i = 0; i < n; i++) scanf("%d", &h[i]);
      |                                ~~~~~^~~~~~~~~~~~~

ソースコード

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

#include <bits/stdc++.h>
int i, n, k, m, res, p[200000], e[200000], a[200000], h[200000];
int modpow(long long x) {
long long ret = 1;
int p = k;
while(p) {
if(p & 1) (ret *= x) %= m;
(x *= x) %= m;
p >>= 1;
}
return (int)ret;
}
int main() {
scanf("%d%d%d", &n, &k, &m);
for(i = 0; i < n; i++) scanf("%d", &p[i]);
for(i = 0; i < n; i++) scanf("%d", &e[i]);
for(i = 0; i < n; i++) scanf("%d", &a[i]);
for(i = 0; i < n; i++) scanf("%d", &h[i]);
std::sort(p, p + n);
std::sort(e, e + n);
std::sort(a, a + n);
std::sort(h, h + n);
for(i = 0; i < n; i++) {
int MAX = std::max({p[i], e[i], a[i], h[i]});
int MIN = std::min({p[i], e[i], a[i], h[i]});
(res += modpow(MAX - MIN)) %= m;
}
printf("%d\n", res);
return 0;
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0