結果
問題 | No.1514 Squared Matching |
ユーザー | vwxyz |
提出日時 | 2023-11-21 04:13:13 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,576 ms / 4,000 ms |
コード長 | 3,447 bytes |
コンパイル時間 | 227 ms |
コンパイル使用メモリ | 81,700 KB |
実行使用メモリ | 475,892 KB |
最終ジャッジ日時 | 2023-11-21 04:13:44 |
合計ジャッジ時間 | 29,624 ms |
ジャッジサーバーID (参考情報) |
judge12 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 155 ms
88,560 KB |
testcase_01 | AC | 1,576 ms
475,888 KB |
testcase_02 | AC | 151 ms
88,688 KB |
testcase_03 | AC | 146 ms
88,560 KB |
testcase_04 | AC | 144 ms
88,560 KB |
testcase_05 | AC | 155 ms
89,200 KB |
testcase_06 | AC | 179 ms
95,272 KB |
testcase_07 | AC | 452 ms
164,192 KB |
testcase_08 | AC | 1,494 ms
461,640 KB |
testcase_09 | AC | 1,335 ms
414,388 KB |
testcase_10 | AC | 1,433 ms
441,816 KB |
testcase_11 | AC | 1,470 ms
456,724 KB |
testcase_12 | AC | 1,509 ms
467,024 KB |
testcase_13 | AC | 1,559 ms
472,116 KB |
testcase_14 | AC | 1,536 ms
474,212 KB |
testcase_15 | AC | 1,541 ms
475,160 KB |
testcase_16 | AC | 1,534 ms
475,604 KB |
testcase_17 | AC | 1,550 ms
475,824 KB |
testcase_18 | AC | 1,550 ms
475,876 KB |
testcase_19 | AC | 1,544 ms
475,892 KB |
testcase_20 | AC | 1,546 ms
475,880 KB |
testcase_21 | AC | 1,566 ms
475,884 KB |
testcase_22 | AC | 440 ms
167,728 KB |
testcase_23 | AC | 751 ms
245,836 KB |
testcase_24 | AC | 999 ms
320,144 KB |
testcase_25 | AC | 1,285 ms
397,768 KB |
ソースコード
import bisect import copy import decimal import fractions import heapq import itertools import math import random import sys import time from collections import Counter,deque,defaultdict from functools import lru_cache,reduce from heapq import heappush,heappop,heapify,heappushpop,_heappop_max,_heapify_max def _heappush_max(heap,item): heap.append(item) heapq._siftdown_max(heap, 0, len(heap)-1) def _heappushpop_max(heap, item): if heap and item < heap[0]: item, heap[0] = heap[0], item heapq._siftup_max(heap, 0) return item from math import gcd as GCD read=sys.stdin.read readline=sys.stdin.readline readlines=sys.stdin.readlines write=sys.stdout.write #import pypyjit #pypyjit.set_param('max_unroll_recursion=-1') #sys.set_int_max_str_digits(10**9) class Prime: def __init__(self,N): assert N<=10**8 self.smallest_prime_factor=[None]*(N+1) for i in range(2,N+1,2): self.smallest_prime_factor[i]=2 n=int(N**.5)+1 for p in range(3,n,2): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p for i in range(p**2,N+1,2*p): if self.smallest_prime_factor[i]==None: self.smallest_prime_factor[i]=p for p in range(n,N+1): if self.smallest_prime_factor[p]==None: self.smallest_prime_factor[p]=p self.primes=[p for p in range(N+1) if p==self.smallest_prime_factor[p]] def Factorize(self,N): assert N>=1 factors=defaultdict(int) if N<=len(self.smallest_prime_factor)-1: while N!=1: factors[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] else: for p in self.primes: while N%p==0: N//=p factors[p]+=1 if N<p*p: if N!=1: factors[N]+=1 break if N<=len(self.smallest_prime_factor)-1: while N!=1: factors[self.smallest_prime_factor[N]]+=1 N//=self.smallest_prime_factor[N] break else: if N!=1: factors[N]+=1 return factors def Divisors(self,N): assert N>0 divisors=[1] for p,e in self.Factorize(N).items(): pow_p=[1] for _ in range(e): pow_p.append(pow_p[-1]*p) divisors=[i*j for i in divisors for j in pow_p] return divisors def Is_Prime(self,N): return N==self.smallest_prime_factor[N] def Totient(self,N): for p in self.Factorize(N).keys(): N*=p-1 N//=p return N def Mebius(self,N): fact=self.Factorize(N) for e in fact.values(): if e>=2: return 0 else: if len(fact)%2==0: return 1 else: return -1 N=int(readline()) ans=0 Pr=Prime(int(N**.5)) lst=[i for i in range(N+1)] for p in Pr.primes: for i in range(p*p,N+1,p*p): while lst[i]%(p*p)==0: lst[i]//=(p*p) for i in range(1,N+1): if lst[i]==i: lst[i]=1 else: lst[lst[i]]+=1 lst[i]=0 for i in range(1,N+1): ans+=lst[i]*lst[i] print(ans)