結果

問題 No.854 公平なりんご分配
ユーザー pekempeypekempey
提出日時 2019-08-01 19:11:26
言語 F#
(F# 4.0)
結果
AC  
実行時間 1,885 ms / 3,153 ms
コード長 1,381 bytes
コンパイル時間 4,916 ms
コンパイル使用メモリ 165,756 KB
実行使用メモリ 48,284 KB
最終ジャッジ日時 2023-09-18 17:51:17
合計ジャッジ時間 50,200 ms
ジャッジサーバーID
(参考情報)
judge11 / judge15
このコードへのチャレンジ
(要ログイン)

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 85 ms
24,852 KB
testcase_01 AC 87 ms
25,000 KB
testcase_02 AC 85 ms
24,876 KB
testcase_03 AC 84 ms
22,828 KB
testcase_04 AC 85 ms
24,880 KB
testcase_05 AC 86 ms
24,884 KB
testcase_06 AC 84 ms
22,832 KB
testcase_07 AC 86 ms
22,808 KB
testcase_08 AC 86 ms
22,888 KB
testcase_09 AC 87 ms
22,888 KB
testcase_10 AC 87 ms
22,852 KB
testcase_11 AC 87 ms
24,892 KB
testcase_12 AC 87 ms
20,880 KB
testcase_13 AC 88 ms
24,976 KB
testcase_14 AC 86 ms
22,832 KB
testcase_15 AC 85 ms
22,776 KB
testcase_16 AC 86 ms
22,936 KB
testcase_17 AC 84 ms
22,836 KB
testcase_18 AC 86 ms
22,828 KB
testcase_19 AC 86 ms
24,900 KB
testcase_20 AC 84 ms
20,884 KB
testcase_21 AC 85 ms
22,836 KB
testcase_22 AC 94 ms
22,812 KB
testcase_23 AC 92 ms
20,856 KB
testcase_24 AC 100 ms
24,852 KB
testcase_25 AC 90 ms
22,992 KB
testcase_26 AC 99 ms
24,964 KB
testcase_27 AC 93 ms
22,852 KB
testcase_28 AC 95 ms
24,908 KB
testcase_29 AC 88 ms
22,896 KB
testcase_30 AC 91 ms
25,048 KB
testcase_31 AC 99 ms
24,896 KB
testcase_32 AC 232 ms
42,504 KB
testcase_33 AC 275 ms
43,524 KB
testcase_34 AC 405 ms
43,824 KB
testcase_35 AC 307 ms
42,692 KB
testcase_36 AC 264 ms
29,236 KB
testcase_37 AC 228 ms
42,888 KB
testcase_38 AC 194 ms
44,576 KB
testcase_39 AC 593 ms
46,248 KB
testcase_40 AC 299 ms
39,052 KB
testcase_41 AC 312 ms
42,356 KB
testcase_42 AC 361 ms
44,180 KB
testcase_43 AC 448 ms
42,436 KB
testcase_44 AC 459 ms
43,384 KB
testcase_45 AC 483 ms
31,108 KB
testcase_46 AC 574 ms
41,364 KB
testcase_47 AC 262 ms
41,004 KB
testcase_48 AC 341 ms
43,656 KB
testcase_49 AC 320 ms
44,140 KB
testcase_50 AC 212 ms
43,052 KB
testcase_51 AC 564 ms
43,712 KB
testcase_52 AC 508 ms
43,736 KB
testcase_53 AC 309 ms
41,440 KB
testcase_54 AC 492 ms
42,412 KB
testcase_55 AC 222 ms
43,448 KB
testcase_56 AC 191 ms
42,612 KB
testcase_57 AC 277 ms
41,096 KB
testcase_58 AC 473 ms
33,936 KB
testcase_59 AC 182 ms
37,704 KB
testcase_60 AC 356 ms
39,060 KB
testcase_61 AC 233 ms
31,240 KB
testcase_62 AC 401 ms
37,872 KB
testcase_63 AC 370 ms
39,916 KB
testcase_64 AC 176 ms
31,656 KB
testcase_65 AC 292 ms
42,560 KB
testcase_66 AC 279 ms
35,316 KB
testcase_67 AC 426 ms
44,532 KB
testcase_68 AC 447 ms
37,628 KB
testcase_69 AC 264 ms
41,764 KB
testcase_70 AC 205 ms
42,992 KB
testcase_71 AC 229 ms
42,208 KB
testcase_72 AC 334 ms
29,284 KB
testcase_73 AC 271 ms
42,588 KB
testcase_74 AC 496 ms
45,048 KB
testcase_75 AC 287 ms
40,212 KB
testcase_76 AC 448 ms
42,588 KB
testcase_77 AC 432 ms
45,912 KB
testcase_78 AC 494 ms
36,856 KB
testcase_79 AC 499 ms
45,064 KB
testcase_80 AC 459 ms
41,028 KB
testcase_81 AC 382 ms
44,292 KB
testcase_82 AC 1,878 ms
46,216 KB
testcase_83 AC 1,822 ms
48,284 KB
testcase_84 AC 1,828 ms
46,232 KB
testcase_85 AC 1,885 ms
48,180 KB
testcase_86 AC 1,476 ms
48,168 KB
testcase_87 AC 1,800 ms
48,200 KB
testcase_88 AC 1,793 ms
48,116 KB
testcase_89 AC 1,804 ms
48,112 KB
testcase_90 AC 1,809 ms
46,092 KB
testcase_91 AC 1,803 ms
46,092 KB
testcase_92 AC 1,811 ms
46,292 KB
testcase_93 AC 1,795 ms
46,084 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) F# Compiler version 11.0.0.0 for F# 5.0
Copyright (c) Microsoft Corporation. All Rights Reserved.

ソースコード

diff #

open System
open System.Text
open System.Collections.Generic

let read f = 
  while stdin.Peek () <= int ' ' do stdin.Read () |> ignore
  [|while stdin.Peek () > int ' ' do yield char (stdin.Read ())|] |> System.String |> f

let N = read int
let A = Array.init N (fun _ -> read int)
let Q = read int

let P = Array.zeroCreate Q
let L = Array.zeroCreate Q
let R = Array.zeroCreate Q
let zero = Array.zeroCreate (N+1)
for i in 0..Q-1 do
  P.[i] <- read int
  L.[i] <- read int - 1
  R.[i] <- read int
for i in 0..N-1 do zero.[i+1] <- zero.[i] + (if A.[i] = 0 then 1 else 0)
for i in 0..Q-1 do if zero.[R.[i]] - zero.[L.[i]] > 0 then P.[i] <- 1

let table = Array.create 2001 true
let primes = new ResizeArray<int>()
table.[0] <- false
table.[1] <- false
for i in 2..2000 do
  if table.[i] then
    primes.Add(i)
    for j in 2*i..i..2000 do table.[j] <- false
let ans = Array.create Q true
for p in primes do
  let cnt = Array.zeroCreate (N+1)
  for i in 0..N-1 do
    let mutable k = 0
    while A.[i] <> 0 && A.[i] % p = 0 do
      A.[i] <- A.[i] / p
      k <- k + 1
    cnt.[i+1] <- cnt.[i] + k
  for i in 0..Q-1 do
    let mutable k = 0
    while P.[i] % p = 0 do
      P.[i] <- P.[i] / p
      k <- k + 1
    if cnt.[R.[i]] - cnt.[L.[i]] < k then
      ans.[i] <- false

for i in 0..Q-1 do
  if P.[i] <> 1 then ans.[i] <- false
  printfn "%s" (if ans.[i] then "Yes" else "NO")
0