結果
| 問題 | No.1514 Squared Matching |
| コンテスト | |
| ユーザー |
vjudge1
|
| 提出日時 | 2025-07-07 12:01:06 |
| 言語 | C++23 (gcc 13.3.0 + boost 1.89.0) |
| 結果 |
AC
|
| 実行時間 | 1,235 ms / 4,000 ms |
| コード長 | 2,767 bytes |
| 記録 | |
| コンパイル時間 | 3,353 ms |
| コンパイル使用メモリ | 278,096 KB |
| 実行使用メモリ | 443,128 KB |
| 最終ジャッジ日時 | 2025-07-07 12:01:43 |
| 合計ジャッジ時間 | 36,121 ms |
|
ジャッジサーバーID (参考情報) |
judge1 / judge2 |
(要ログイン)
| ファイルパターン | 結果 |
|---|---|
| other | AC * 26 |
コンパイルメッセージ
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:52:11: warning: bad option ‘-fwhole-program’ to attribute ‘optimize’ [-Wattributes]
52 | void sang()
| ^
main.cpp:52:11: warning: bad option ‘-fstrict-overflow’ to attribute ‘optimize’ [-Wattributes]
main.cpp:52:11: warning: bad option ‘-fcse-skip-blocks’ to attribute ‘optimize’ [-Wattributes]
main.cpp:52:11: warning: bad option ‘-funsafe-loop-optimizations’ to attribute ‘optimize’ [-Wattributes]
main.cpp:79:10: warning: bad option ‘-fwhole-program’ to attribute ‘optimize’ [-Wattributes]
79 | int main()
| ^
main.cpp:79:10: warning: bad option ‘-fstrict-overflow’ to attribute ‘optimize’ [-Wattributes]
main.cpp:79:10: warning: bad option ‘-fcse-skip-blocks’ to attribute ‘optimize’ [-Wattributes]
main.cpp:79: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 n,a[50000005],c[50000005],maxn=5*1e7,res;
bool b[50000005];
void sang()
{
for (int i = 1; i <= maxn; i++)
{
b[i] = true;
a[i] = i;
}
b[1] = false;
for (int i = 2; i <= sqrt(maxn); i++)
{
if (b[i])
{
for (int j = i*i; j <= maxn; j+= i)
{
b[j] = false;
}
for (int j = i*i; j <= maxn; j+=i*i)
{
while (a[j] % (i*i) == 0)
{
a[j] /= (i*i);
}
}
}
}
}
int main()
{
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
cin >> n;
sang();
for (int i = 1; i <= n; i++)
{
c[a[i]]++;
}
for (int i = 1; i <= n; i++)
{
res += (c[i]*c[i]);
}
cout << res;
}
vjudge1