結果
| 問題 | No.505 カードの数式2 |
| コンテスト | |
| ユーザー |
Ronlynes
|
| 提出日時 | 2017-08-23 12:41:36 |
| 言語 | C++11 (gcc 15.2.0 + boost 1.89.0) |
| 結果 |
WA
|
| 実行時間 | - |
| コード長 | 1,097 bytes |
| 記録 | |
| コンパイル時間 | 348 ms |
| コンパイル使用メモリ | 72,688 KB |
| 実行使用メモリ | 6,400 KB |
| 最終ジャッジ日時 | 2026-05-04 10:19:32 |
| 合計ジャッジ時間 | 1,443 ms |
|
ジャッジサーバーID (参考情報) |
judge1_1 / judge2_0 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| sample | AC * 3 |
| other | AC * 25 WA * 4 |
コンパイルメッセージ
In file included from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/string:53,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/locale_classes.h:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ios_base.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ios:46,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/ostream.h:43,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/ostream:42,
from /home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/iostream:43,
from main.cpp:1:
In function 'const _Tp& std::max(const _Tp&, const _Tp&) [with _Tp = long long int]',
inlined from 'int main()' at main.cpp:29:16:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_algobase.h:263:7: warning: 'tmp_ma' may be used uninitialized [-Wmaybe-uninitialized]
263 | if (__a < __b)
| ^~
main.cpp: In function 'int main()':
main.cpp:17:15: note: 'tmp_ma' was declared here
17 | long long tmp_ma, tmp_mi;
| ^~~~~~
In function 'const _Tp& std::max(const _Tp&, const _Tp&) [with _Tp = long long int]',
inlined from 'int main()' at main.cpp:29:16:
/home/linuxbrew/.linuxbrew/Cellar/gcc/15.2.0_1/include/c++/15/bits/stl_algobase.h:263:7: warning: 'tmp_mi' may be used uninitialized [-Wmaybe-uninitialized]
263 | if (__a < __b)
| ^~
main.cpp: In function 'int main()':
main.cpp:17:23: note: 'tmp_mi' was declared here
17 | long long tmp_ma, tmp_mi;
| ^~~~~~
ソースコード
#include <iostream>
using namespace std;
int main(void){
int n, a[100];
cin >> n;
for(int i=0; i<n; i++){
cin >> a[i];
}
long long sum, ma, mi;
if(a[1] != 0){
ma = max(max(max(a[0]*a[1],a[0]+a[1]), a[0]-a[1]),a[0]/a[1]);
mi = min(min(min(a[0]*a[1],a[0]+a[1]), a[0]-a[1]), a[0]/a[1]);
}else{
ma = max(max(a[0]*a[1],a[0]+a[1]), a[0]-a[1]);
mi = min(min(a[0]*a[1],a[0]+a[1]), a[0]-a[1]);
}
long long tmp_ma, tmp_mi;
for(int i=2; i<n; i++){
if(a[i] != 0){
tmp_ma = max(max(max(max(ma*a[i],ma+a[i]), ma-a[i]),ma/a[i]), max(max(max(mi*a[i],mi+a[i]), mi-a[i]),mi/a[i]));
tmp_mi = min(min(min(min(ma*a[i],ma+a[i]), ma-a[i]),ma/a[i]), min(min(min(mi*a[i],mi+a[i]), mi-a[i]),mi/a[i]));
}else{
ma = max(max(max(ma*a[i],ma+a[i]), ma-a[i]), max(max(mi*a[i],mi+a[i]), mi-a[i]));
mi = min(min(min(ma*a[i],ma+a[i]), ma-a[i]), min(min(mi*a[i],mi+a[i]), mi-a[i]));
}
ma = tmp_ma;
mi = tmp_mi;
}
cout << max(ma, mi) << endl;
return 0;
}
Ronlynes