結果
問題 |
No.1514 Squared Matching
|
ユーザー |
![]() |
提出日時 | 2025-07-07 11:14:50 |
言語 | C++23 (gcc 13.3.0 + boost 1.87.0) |
結果 |
TLE
|
実行時間 | - |
コード長 | 2,556 bytes |
コンパイル時間 | 6,669 ms |
コンパイル使用メモリ | 275,724 KB |
実行使用メモリ | 16,200 KB |
最終ジャッジ日時 | 2025-07-07 11:15:03 |
合計ジャッジ時間 | 9,446 ms |
ジャッジサーバーID (参考情報) |
judge1 / judge5 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
other | AC * 1 TLE * 1 -- * 24 |
コンパイルメッセージ
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:50:15: warning: bad option ‘-fwhole-program’ to attribute ‘optimize’ [-Wattributes] 50 | int tinh(int x) | ^ main.cpp:50:15: warning: bad option ‘-fstrict-overflow’ to attribute ‘optimize’ [-Wattributes] main.cpp:50:15: warning: bad option ‘-fcse-skip-blocks’ to attribute ‘optimize’ [-Wattributes] main.cpp:50:15: warning: bad option ‘-funsafe-loop-optimizations’ to attribute ‘optimize’ [-Wattributes] main.cpp:70:10: warning: bad option ‘-fwhole-program’ to attribute ‘optimize’ [-Wattributes] 70 | int main() | ^ main.cpp:70:10: warning: bad option ‘-fstrict-overflow’ to attribute ‘optimize’ [-Wattributes] main.cpp:70:10: warning: bad option ‘-fcse-skip-blocks’ to attribute ‘optimize’ [-Wattributes] main.cpp:70:10: warning: bad option ‘-funsafe-loop-optimizations’ to attribute ‘optimize’ [-Wattributes]
ソースコード
# include <bits/stdc++.h> using namespace std; #pragma GCC target("avx") #pragma GCC optimize("O2") #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("-fpeephole2") #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") int g,k; int tinh(int x) { g = 1; for (int i = 2; i*i <= x; i++) { int cnt = 0; while (x%i==0) { cnt++; x /= i; } if (cnt%2!=0) g *= i; } if (x > 1) g *= x; return g; } int n,p,a[50000005],b[50000005]; long long res; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin >> n; for (int i = 1; i <= n; i++) { a[i] = tinh(i); } for (int i = 1; i <= n; i++) { b[a[i]]++; } for (int i = 1; i <= n; i++) { res += (b[i]*b[i]); } cout << res; }