結果
問題 | No.1746 Sqrt Integer Segments |
ユーザー | chineristAC |
提出日時 | 2021-11-18 01:36:08 |
言語 | PyPy3 (7.3.15) |
結果 |
AC
|
実行時間 | 1,493 ms / 2,000 ms |
コード長 | 1,705 bytes |
コンパイル時間 | 348 ms |
コンパイル使用メモリ | 87,108 KB |
実行使用メモリ | 230,868 KB |
最終ジャッジ日時 | 2023-10-11 10:40:01 |
合計ジャッジ時間 | 31,737 ms |
ジャッジサーバーID (参考情報) |
judge13 / judge11 |
(要ログイン)
テストケース
テストケース表示入力 | 結果 | 実行時間 実行使用メモリ |
---|---|---|
testcase_00 | AC | 470 ms
184,052 KB |
testcase_01 | AC | 475 ms
183,888 KB |
testcase_02 | AC | 1,164 ms
216,156 KB |
testcase_03 | AC | 841 ms
201,932 KB |
testcase_04 | AC | 1,003 ms
207,724 KB |
testcase_05 | AC | 1,466 ms
230,520 KB |
testcase_06 | AC | 780 ms
197,748 KB |
testcase_07 | AC | 582 ms
187,208 KB |
testcase_08 | AC | 1,176 ms
215,836 KB |
testcase_09 | AC | 1,489 ms
230,372 KB |
testcase_10 | AC | 758 ms
196,320 KB |
testcase_11 | AC | 1,376 ms
225,132 KB |
testcase_12 | AC | 1,432 ms
230,380 KB |
testcase_13 | AC | 1,419 ms
230,688 KB |
testcase_14 | AC | 1,481 ms
230,868 KB |
testcase_15 | AC | 1,493 ms
230,684 KB |
testcase_16 | AC | 1,467 ms
230,504 KB |
testcase_17 | AC | 1,059 ms
212,132 KB |
testcase_18 | AC | 632 ms
219,528 KB |
testcase_19 | AC | 640 ms
219,476 KB |
testcase_20 | AC | 632 ms
219,320 KB |
testcase_21 | AC | 603 ms
202,640 KB |
testcase_22 | AC | 612 ms
203,024 KB |
testcase_23 | AC | 533 ms
193,448 KB |
testcase_24 | AC | 710 ms
224,600 KB |
testcase_25 | AC | 724 ms
223,736 KB |
testcase_26 | AC | 710 ms
224,412 KB |
testcase_27 | AC | 1,133 ms
226,356 KB |
testcase_28 | AC | 1,121 ms
226,248 KB |
testcase_29 | AC | 1,119 ms
226,432 KB |
ソースコード
import sys,random,bisect from collections import deque,defaultdict from heapq import heapify,heappop,heappush from itertools import permutations from math import log,gcd input = lambda :sys.stdin.readline() mi = lambda :map(int,input().split()) li = lambda :list(mi()) M = 10**6 spf = [i for i in range(M+1)] for i in range(2,M+1): if spf[i]==i: for j in range(i,M+1,i): spf[j] = i def factorize(n): res = [] while n!=1: p = spf[n] cnt = 0 while n%p==0: cnt += 1 n //= p if cnt&1: res.append(p) return res N = int(input()) A = [1] + li() K = 3 mod = 998244353 r = [random.randint(2,mod-2) for i in range(K)] pow_r = [[1 for j in range(K)] for i in range(M+1)] for i in range(1,M+1): for j in range(K): pow_r[i][j] = pow_r[i-1][j] * r[j] % mod dic = {} PS = [[0,0,0]] for i in range(N): tmp_p = factorize(A[i+1]) tmp_PS = [PS[-1][j] for j in range(K)] for p in tmp_p: if p not in dic: dic[p] = 0 for j in range(K): tmp_PS[j] += pow_r[p][j] * (1-2*dic[p]) % mod tmp_PS[j] %= mod dic[p] = 1 - dic[p] PS.append(tmp_PS) res = 0 PS.sort() val = PS[0] tmp = 1 for i in range(1,N+1): if val==PS[i]: tmp += 1 else: res += tmp * (tmp-1)//2 val = PS[i] tmp = 1 res += tmp * (tmp-1)//2 print(res) exit() check = 0 for i in range(N): dic = {} for j in range(i,N): for p in factorize(A[j+1]): if p not in dic: dic[p] = 0 dic[p] = 1 - dic[p] if all(dic[p]==0 for p in dic): check += 1 print(check)