結果

問題 No.1514 Squared Matching
ユーザー te-shte-sh
提出日時 2021-06-16 17:39:55
言語 D
(dmd 2.107.1)
結果
AC  
実行時間 1,258 ms / 4,000 ms
コード長 3,986 bytes
コンパイル時間 2,227 ms
コンパイル使用メモリ 171,352 KB
実行使用メモリ 447,132 KB
最終ジャッジ日時 2023-09-04 12:57:48
合計ジャッジ時間 23,851 ms
ジャッジサーバーID
（参考情報） 		judge11 / judge15
このコードへのチャレンジ（β）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 1 ms
4,384 KB
testcase_01 AC 1,258 ms
444,872 KB
testcase_02 AC 2 ms
4,380 KB
testcase_03 AC 2 ms
4,380 KB
testcase_04 AC 1 ms
4,384 KB
testcase_05 AC 2 ms
4,384 KB
testcase_06 AC 18 ms
10,664 KB
testcase_07 AC 226 ms
91,548 KB
testcase_08 AC 1,191 ms
429,800 KB
testcase_09 AC 1,032 ms
377,508 KB
testcase_10 AC 1,116 ms
406,428 KB
testcase_11 AC 1,164 ms
427,528 KB
testcase_12 AC 1,246 ms
436,496 KB
testcase_13 AC 1,203 ms
442,540 KB
testcase_14 AC 1,215 ms
444,500 KB
testcase_15 AC 1,210 ms
444,032 KB
testcase_16 AC 1,219 ms
445,872 KB
testcase_17 AC 1,213 ms
444,960 KB
testcase_18 AC 1,210 ms
446,524 KB
testcase_19 AC 1,210 ms
447,132 KB
testcase_20 AC 1,233 ms
445,684 KB
testcase_21 AC 1,217 ms
446,980 KB
testcase_22 AC 234 ms
93,760 KB
testcase_23 AC 473 ms
181,732 KB
testcase_24 AC 718 ms
269,764 KB
testcase_25 AC 967 ms
358,960 KB
権限があれば一括ダウンロードができます

ソースコード

diff # 

// URL: https://yukicoder.me/problems/no/1514

import std;

version(unittest) {} else
void main()
{
  int N; io.getV(N);

  auto a = new bool[](N+1), b = new int[](N+1);
  a[2..$] = true;
  foreach (i; 1..N+1) b[i] = i;

  foreach (i; 2..isqrt(N)+1) {
    if (!a[i]) continue;
    for (auto j = i*2; j <= N; j += i) a[i] = false;
    auto i2 = i*i;
    for (auto j = i2; j <= N; j += i*i)
      while (b[j] % i2 == 0) b[j] /= i2;
  }

  auto c = new int[](N+1);
  foreach (bi; b[1..N+1]) ++c[bi];

  io.put(c.map!"a*a".sum);
}

pragma(inline)
{
  auto lowerBoundBy(alias conv = "a", alias comp = "a<b", R, T)(const R a, const T v)
  {
    return a.sortedTuple!(conv, comp).lowerBound(tuple(a.front, v)).map!"a[0]";
  }

  auto upperBoundBy(alias conv = "a", alias comp = "a<b", R, T)(const R a, const T v)
  {
    return a.sortedTuple!(conv, comp).upperBound(tuple(a.front, v)).map!"a[0]";
  }

  auto sortedTuple(alias conv = "a", alias comp = "a<b", R)(const R a)
  {
    alias convFun = unaryFun!conv, compFun = binaryFun!comp;
    return a.map!(e => tuple(e, convFun(e))).assumeSorted!((a, b) => compFun(a[1], b[1]));
  }
}

pure nothrow @nogc @safe
{
  T isqrt(T)(T n)
    if (is(T == int) || is(T == long))
  {
    static if (is(T == int)) auto max = 46_341;
    else static if (is(T == long)) auto max = 3_037_000_500L;
    return iota(T(0), max).lowerBoundBy!("a^^2", "a<=b")(n).back;
  }
  T icbrt(T)(T n)
    if (is(T == int) || is(T == long))
  {
    static if (is(T == int)) auto max = 1_291;
    else static if (is(T == long)) auto max = 2_097_152L;
    return iota(T(0), max).lowerBoundBy!("a^^3", "a<=b")(n).back;
  }
}

auto io = IO!()();
struct IO(alias IN = stdin, alias OUT = stdout)
{
  import core.stdc.stdlib : exit;

  void getV(T...)(ref T v)
  {
    foreach (ref w; v) get(w);
  }
  void getA(T)(size_t n, ref T v)
    if (hasAssignableElements!T)
  {
    v = new T(n);
    foreach (ref w; v) get(w);
  }
  void getC(T...)(size_t n, ref T v)
    if (allSatisfy!(hasAssignableElements, T))
  {
    foreach (ref w; v) w = new typeof(w)(n);
    foreach (i; 0..n) foreach (ref w; v) get(w[i]);
  }
  void getM(T)(size_t r, size_t c, ref T v)
    if (hasAssignableElements!T && hasAssignableElements!(ElementType!T))
  {
    v = new T(r);
    foreach (ref w; v) getA(c, w);
  }
  template getS(E...)
  {
    void getS(T)(size_t n, ref T v)
    {
      v = new T(n);
      foreach (ref w; v) foreach (e; E) mixin("get(w."~e~");");
    }
  }

  const struct PutConf
  {
    bool newline = true, flush, exit;
    string floatFormat = "%.10f", delimiter = " ";
  }

  void put(alias conf = "{}", T...)(T v)
  {
    putMain!conf(v);
  }
  void putB(alias conf = "{}", S, T)(bool c, S t, T f)
  {
    if (c) put!conf(t);
    else put!conf(f);
  }
  void putRaw(T...)(T v)
  {
    OUT.write(v);
    OUT.writeln;
  }

  private
  {
    dchar[] buf;
    auto sp = (new dchar[](0)).splitter;

    void nextLine()
    {
      IN.readln(buf);
      sp = buf.splitter;
    }
    void get(T)(ref T v)
    {
      if (sp.empty) nextLine();
      v = sp.front.to!T;
      sp.popFront();
    }

    void putMain(alias conf, T...)(T v)
    {
      mixin("const PutConf c = "~conf~";");
      foreach (i, w; v) {
        putOne!conf(w);
        if (i+1 < v.length) OUT.write(c.delimiter);
      }
      static if (c.newline) OUT.writeln;
      static if (c.flush) OUT.flush();
      static if (c.exit) exit(0);
    }
    void putOne(alias conf, T)(T v)
    {
      mixin("const PutConf c = "~conf~";");
      static if (isInputRange!T && !isSomeString!T) putRange!conf(v);
      else static if (isFloatingPoint!T) OUT.write(format(c.floatFormat, v));
      else static if (hasMember!(T, "fprint")) v.fprint(OUT);
      else OUT.write(v);
    }
    void putRange(alias conf, T)(T v)
    {
      mixin("const PutConf c = "~conf~";");
      auto w = v;
      while (!w.empty) {
        putOne!conf(w.front); w.popFront();
        if (!w.empty) OUT.write(c.delimiter);
      }
    }
  }
}
0