結果

問題 No.854 公平なりんご分配
ユーザー chaemonchaemon
提出日時 2019-07-26 23:07:41
言語 Nim
(2.0.2)
結果
MLE  
実行時間 -
コード長 2,587 bytes
コンパイル時間 4,757 ms
コンパイル使用メモリ 67,088 KB
実行使用メモリ 414,592 KB
最終ジャッジ日時 2023-09-15 04:06:23
合計ジャッジ時間 22,905 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 2 ms
4,384 KB
testcase_01 AC 2 ms
4,380 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,380 KB
testcase_05 AC 2 ms
4,384 KB
testcase_06 AC 1 ms
4,380 KB
testcase_07 AC 2 ms
4,380 KB
testcase_08 AC 2 ms
4,380 KB
testcase_09 AC 2 ms
4,384 KB
testcase_10 AC 2 ms
4,380 KB
testcase_11 AC 2 ms
4,384 KB
testcase_12 AC 2 ms
4,384 KB
testcase_13 AC 2 ms
4,380 KB
testcase_14 AC 2 ms
4,384 KB
testcase_15 AC 2 ms
4,384 KB
testcase_16 AC 2 ms
4,380 KB
testcase_17 AC 2 ms
4,384 KB
testcase_18 AC 2 ms
4,380 KB
testcase_19 AC 2 ms
4,384 KB
testcase_20 AC 2 ms
4,380 KB
testcase_21 AC 2 ms
4,380 KB
testcase_22 AC 8 ms
6,060 KB
testcase_23 AC 7 ms
7,364 KB
testcase_24 AC 11 ms
8,792 KB
testcase_25 AC 6 ms
6,844 KB
testcase_26 AC 12 ms
8,996 KB
testcase_27 AC 9 ms
9,020 KB
testcase_28 AC 8 ms
5,896 KB
testcase_29 AC 4 ms
5,264 KB
testcase_30 AC 7 ms
6,712 KB
testcase_31 AC 11 ms
8,404 KB
testcase_32 AC 91 ms
91,476 KB
testcase_33 AC 102 ms
51,168 KB
testcase_34 AC 180 ms
125,088 KB
testcase_35 AC 125 ms
99,856 KB
testcase_36 AC 85 ms
9,648 KB
testcase_37 AC 88 ms
86,272 KB
testcase_38 AC 72 ms
72,032 KB
testcase_39 AC 269 ms
132,660 KB
testcase_40 AC 119 ms
44,528 KB
testcase_41 AC 129 ms
80,208 KB
testcase_42 AC 152 ms
121,912 KB
testcase_43 AC 191 ms
83,820 KB
testcase_44 AC 196 ms
113,444 KB
testcase_45 AC 204 ms
25,820 KB
testcase_46 AC 252 ms
112,244 KB
testcase_47 AC 103 ms
66,464 KB
testcase_48 AC 141 ms
120,604 KB
testcase_49 AC 139 ms
123,884 KB
testcase_50 AC 83 ms
87,100 KB
testcase_51 AC 247 ms
117,232 KB
testcase_52 AC 164 ms
54,508 KB
testcase_53 AC 91 ms
52,912 KB
testcase_54 AC 163 ms
63,996 KB
testcase_55 AC 64 ms
53,712 KB
testcase_56 AC 59 ms
55,896 KB
testcase_57 AC 91 ms
47,100 KB
testcase_58 AC 178 ms
21,432 KB
testcase_59 AC 51 ms
41,304 KB
testcase_60 AC 116 ms
45,860 KB
testcase_61 AC 59 ms
12,480 KB
testcase_62 AC 141 ms
39,356 KB
testcase_63 AC 100 ms
41,716 KB
testcase_64 AC 40 ms
16,804 KB
testcase_65 AC 109 ms
107,460 KB
testcase_66 AC 84 ms
32,196 KB
testcase_67 AC 135 ms
71,452 KB
testcase_68 AC 132 ms
31,224 KB
testcase_69 AC 109 ms
132,676 KB
testcase_70 AC 58 ms
45,140 KB
testcase_71 AC 66 ms
49,424 KB
testcase_72 AC 114 ms
9,664 KB
testcase_73 AC 90 ms
88,340 KB
testcase_74 AC 165 ms
105,684 KB
testcase_75 AC 95 ms
50,460 KB
testcase_76 AC 131 ms
84,092 KB
testcase_77 AC 142 ms
120,164 KB
testcase_78 AC 178 ms
37,828 KB
testcase_79 AC 164 ms
74,080 KB
testcase_80 AC 152 ms
76,920 KB
testcase_81 AC 116 ms
81,560 KB
testcase_82 MLE -
testcase_83 MLE -
testcase_84 MLE -
testcase_85 MLE -
testcase_86 MLE -
testcase_87 MLE -
testcase_88 MLE -
testcase_89 MLE -
testcase_90 MLE -
testcase_91 MLE -
testcase_92 MLE -
testcase_93 MLE -
権限があれば一括ダウンロードができます
コンパイルメッセージ
/home/judge/data/code/Main.nim(2, 57) Warning: imported and not used: 'strutils' [UnusedImport]
/home/judge/data/code/Main.nim(2, 45) Warning: imported and not used: 'math' [UnusedImport]
/home/judge/data/code/Main.nim(2, 29) Warning: imported and not used: 'tables' [UnusedImport]
/home/judge/data/code/Main.nim(2, 37) Warning: imported and not used: 'macros' [UnusedImport]

ソースコード

diff # 

#{{{ header
import algorithm, sequtils, tables, macros, math, sets, strutils
when defined(MYDEBUG):
  import header

proc scanf(formatstr: cstring){.header: "<stdio.h>", varargs.}
proc getchar(): char {.header: "<stdio.h>", varargs.}
proc nextInt(): int = scanf("%lld",addr result)
proc nextFloat(): float = scanf("%lf",addr result)
proc nextString(): string =
  var get = false
  result = ""
  while true:
    var c = getchar()
    if int(c) > int(' '):
      get = true
      result.add(c)
    else:
      if get: break
      get = false
template `max=`*(x,y:typed):void = x = max(x,y)
template `min=`*(x,y:typed):void = x = min(x,y)
template infty(T): untyped = ((T(1) shl T(sizeof(T)*8-2)) - 1)
#}}}

var pdiv: seq[int]

proc sieve_of_eratosthenes(n:int):void =
  pdiv = newSeq[int](n)
  for i in 2..<n:
    pdiv[i] = i
  for i in 2..<n:
    if i * i >= n: break
    if pdiv[i] == i:
      for j in countup(i*i,n-1,i):
        pdiv[j] = i

proc is_prime(n:int):bool =
  return n!=1 and pdiv[n]==n

proc main():void =
  sieve_of_eratosthenes(2000)
  var
    N = nextInt()
    A = newSeqWith(N,nextInt())
    pid = newSeq[int](2000)
    zero_ct = newSeqWith(N+1,0)
    ct = 0
  for p in 2..<2000:
    if pdiv[p]==p:
      pid[p] = ct
      ct += 1
  var
    t = newSeqWith(N+1,newSeq[int](ct))
  zero_ct[0] = 0
  for i in 0..<N:
    var a = A[i]
    for j in 0..<ct:
      t[i+1][j] = t[i][j]
    zero_ct[i+1] = zero_ct[i]
    if a == 0:
      zero_ct[i+1] += 1
    else:
      for p in 2..a:
        if p*p > a: break
        while a mod p==0:
          a = a div p
          t[i+1][pid[p]] += 1
      if a > 1:
        t[i+1][pid[a]] += 1
  var
    Q = nextInt()
  for _ in 0..<Q:
    var
      P = nextInt()
      L = nextInt()
      R = nextInt()
      tt = newSeq[int](ct)
      u = newSeq[int](ct)
    L -= 1
    if zero_ct[R] - zero_ct[L] > 0:
      echo "Yes"
    else:
      var valid = true
      for j in 0..<ct:
        tt[j] += t[R][j] - t[L][j]
      var a = P
      for p in 2..a:
        if p*p > a: break
        if a mod p == 0:
          if p >= 2000:
            valid = false
            break
          while a mod p == 0:
            a = a div p
            u[pid[p]] += 1
        if not valid:
          break
      if not valid:
        echo "NO"
        continue
      if a > 1:
        if a >= 2000:
          valid = false
          echo "NO"
          continue
        else:
          u[pid[a]] += 1
      for i in 0..<ct:
        if tt[i] < u[i]:
          valid = false
      if valid:
        echo "Yes"
      else:
        echo "NO"
  discard


main()
0