結果
問題 |
No.1233 割り切れない気持ち
|
ユーザー |
![]() |
提出日時 | 2025-08-15 15:16:48 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
WA
|
実行時間 | - |
コード長 | 2,727 bytes |
コンパイル時間 | 2,016 ms |
コンパイル使用メモリ | 199,704 KB |
実行使用メモリ | 7,720 KB |
最終ジャッジ日時 | 2025-08-15 15:16:53 |
合計ジャッジ時間 | 3,904 ms |
ジャッジサーバーID (参考情報) |
judge4 / judge3 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | WA * 2 |
other | WA * 39 |
コンパイルメッセージ
main.cpp:23:39: warning: bad option ‘-fwhole-program’ to pragma ‘optimize’ [-Wpragmas] 23 | #pragma GCC optimize("-fwhole-program") | ^ main.cpp:30:41: warning: bad option ‘-fstrict-overflow’ to pragma ‘optimize’ [-Wpragmas] 30 | #pragma GCC optimize("-fstrict-overflow") | ^ main.cpp:32:41: warning: bad option ‘-fcse-skip-blocks’ to pragma ‘optimize’ [-Wpragmas] 32 | #pragma GCC optimize("-fcse-skip-blocks") | ^ main.cpp:46:51: warning: bad option ‘-funsafe-loop-optimizations’ to pragma ‘optimize’ [-Wpragmas] 46 | #pragma GCC optimize("-funsafe-loop-optimizations") | ^ main.cpp:49:32: warning: bad option ‘-funroll 8’ to pragma ‘optimize’ [-Wpragmas] 49 | #pragma GCC optimize("unroll 8") | ^ main.cpp:57:10: warning: bad option ‘-fwhole-program’ to attribute ‘optimize’ [-Wattributes] 57 | int main() { | ^ main.cpp:57:10: warning: bad option ‘-fstrict-overflow’ to attribute ‘optimize’ [-Wattributes] main.cpp:57:10: warning: bad option ‘-fcse-skip-blocks’ to attribute ‘optimize’ [-Wattributes] main.cpp:57:10: warning: bad option ‘-funsafe-loop-optimizations’ to attribute ‘optimize’ [-Wattributes] main.cpp:57:10: warning: bad option ‘-funroll 8’ to attribute ‘optimize’ [-Wattributes] main.cpp: In function ‘int main()’: main.cpp:58:10: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result] 58 | freopen("mod.in", "r", stdin); | ~~~~~~~^~~~~~~~~~~~~~~~~~~~~~ main.cpp:59:10: warning: ignoring return value of ‘FILE* freopen(const char*, const char*, FILE*)’ declared with attribute ‘warn_unused_result’ [-Wunused-result]
ソースコード
#include <bits/stdc++.h> #pragma GCC optimize(8) #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma") #pragma GCC optimize("Ofast") #pragma GCC optimize("inline") #pragma GCC optimize("-fgcse") #pragma GCC optimize("-fgcse-lm") #pragma GCC optimize("-fipa-sra") #pragma GCC optimize("-ftree-pre") #pragma GCC optimize("-ftree-vrp") #pragma GCC optimize("-fpeephole") #pragma GCC optimize("-ffast-math") #pragma GCC optimize("-fsched-spec") #pragma GCC optimize("unroll-loops") #pragma GCC optimize("-falign-jumps") #pragma GCC optimize("-falign-loops") #pragma GCC optimize("-falign-labels") #pragma GCC optimize("-fdevirtualize") #pragma GCC optimize("-fcaller-saves") #pragma GCC optimize("-fcrossjumping") #pragma GCC optimize("-fthread-jumps") #pragma GCC optimize("-funroll-loops") #pragma GCC optimize("-fwhole-program") #pragma GCC optimize("-freorder-blocks") #pragma GCC optimize("-fschedule-insns") #pragma GCC optimize("inline-functions") #pragma GCC optimize("-ftree-tail-merge") #pragma GCC optimize("-fschedule-insns2") #pragma GCC optimize("-fstrict-aliasing") #pragma GCC optimize("-fstrict-overflow") #pragma GCC optimize("-falign-functions") #pragma GCC optimize("-fcse-skip-blocks") #pragma GCC optimize("-fcse-follow-jumps") #pragma GCC optimize("-fsched-interblock") #pragma GCC optimize("-fpartial-inlining") #pragma GCC optimize("no-stack-protector") #pragma GCC optimize("-freorder-functions") #pragma GCC optimize("-findirect-inlining") #pragma GCC optimize("-fhoist-adjacent-loads") #pragma GCC optimize("-frerun-cse-after-loop") #pragma GCC optimize("inline-small-functions") #pragma GCC optimize("-finline-small-functions") #pragma GCC optimize("-ftree-switch-conversion") #pragma GCC optimize("-foptimize-sibling-calls") #pragma GCC optimize("-fexpensive-optimizations") #pragma GCC optimize("-funsafe-loop-optimizations") #pragma GCC optimize("inline-functions-called-once") #pragma GCC optimize("-fdelete-null-pointer-checks") #pragma GCC optimize("unroll 8") using namespace std; using ll = long long; const int MAXN = 2e5 + 10, INF = 2e9; ll n, a[MAXN], s[MAXN]; int main() { freopen("mod.in", "r", stdin); freopen("mod.out", "w", stdout); cin.tie(0)->sync_with_stdio(0); cin >> n; for (int i = 1; i <= n; i++) { cin >> a[i]; } sort(a + 1, a + n + 1); for (int i = 1; i <= n; i++) { s[i] = s[i - 1] + a[i]; } ll ans = 0; for (int i = 1; i <= n; i++) { ll sum = a[i] * n; for (int l = 1, r; l <= n; l = r + 1) { int val = a[i] / a[l] == 0 ? INF : a[i] / (a[i] / a[l]); r = upper_bound(a + 1, a + n + 1, val) - a - 1; sum -= (s[r] - s[l - 1]) * (a[i] / a[l]); } ans += sum; } cout << ans; return 0; }