結果

問題 No.1514 Squared Matching
コンテスト
ユーザー vjudge1
提出日時 2025-07-07 11:30:50
言語 C++23
(gcc 13.3.0 + boost 1.87.0)
結果
TLE  
実行時間 -
コード長 2,899 bytes
コンパイル時間 2,814 ms
コンパイル使用メモリ 277,180 KB
実行使用メモリ 589,608 KB
最終ジャッジ日時 2025-07-07 11:32:19
合計ジャッジ時間 78,234 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
other AC * 10 TLE * 7 MLE * 9
権限があれば一括ダウンロードができます
コンパイルメッセージ
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:51:15: warning: bad option ‘-fwhole-program’ to attribute ‘optimize’ [-Wattributes]
   51 | int tinh(int x)
      |               ^
main.cpp:51:15: warning: bad option ‘-fstrict-overflow’ to attribute ‘optimize’ [-Wattributes]
main.cpp:51:15: warning: bad option ‘-fcse-skip-blocks’ to attribute ‘optimize’ [-Wattributes]
main.cpp:51:15: warning: bad option ‘-funsafe-loop-optimizations’ to attribute ‘optimize’ [-Wattributes]
main.cpp:69:10: warning: bad option ‘-fwhole-program’ to attribute ‘optimize’ [-Wattributes]
   69 | int main()
      |          ^
main.cpp:69:10: warning: bad option ‘-fstrict-overflow’ to attribute ‘optimize’ [-Wattributes]
main.cpp:69:10: warning: bad option ‘-fcse-skip-blocks’ to attribute ‘optimize’ [-Wattributes]
main.cpp:69:10: warning: bad option ‘-funsafe-loop-optimizations’ to attribute ‘optimize’ [-Wattributes]

ソースコード

diff # 

# 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,t,n,p,a[50000005],b[50000005],spf[50000005],m=5*1e7;
long long res;
int tinh(int x)
{
    g = 1;
    k =0;
    while (x > 1)
    {
        t = spf[x];
        k = 0;
        while (spf[x] == t)
        {
            k++;
            x /= spf[x];
        }
        if (k%2!=0) g *= t;
    }
    return g;
}

int main()
{
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    cin >> n;
    for (int i = 1; i <= m; i++) 
    {
        spf[i] = i;
    }
    for (int i = 2; i*i <= m; i++)
    {
        if (spf[i] == i)
        {
            for (int j = i*i; j <= m; j += i)
            {
                if (spf[j] == j) 
                {
                    spf[j] = i;
                }
            }
        }
    }
    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;

}
0