結果
| 問題 | No.171 スワップ文字列(Med) |
| ユーザー |
 te-sh
|
| 提出日時 | 2020-02-21 18:38:23 |
| 言語 | D (dmd 2.106.1) |
| 結果 |
CE
(最新)
AC
(最初)
|
| 実行時間 | - |
| コード長 | 9,683 bytes |
| コンパイル時間 | 453 ms |
| コンパイル使用メモリ | 147,720 KB |
| 最終ジャッジ日時 | 2024-04-27 03:04:53 |
| 合計ジャッジ時間 | 793 ms |
|
ジャッジサーバーID （参考情報） |
judge4 / judge3 |
（要ログイン）
コンパイルエラー時のメッセージ・ソースコードは、提出者また管理者しか表示できないようにしております。（リジャッジ後のコンパイルエラーは公開されます）
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
ただし、clay言語の場合は開発者のデバッグのため、公開されます。
コンパイルメッセージ
Main.d(424): Deprecation: function `Main.IO!(makeGlobal, makeGlobal).IO.put!("{}", ModInt!(573, false)).put.putMain!(c, ModInt!(573, false)).putMain` function requires a dual-context, which is deprecated
Main.d-mixin-394(394): instantiated from here: `putMain!(c, ModInt!(573, false))`
Main.d(27): instantiated from here: `put!("{}", ModInt!(573, false))`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/internal/write.d(143): Error: cannot implicitly convert expression `obj` of type `const(ModInt!(573, false))` to `int`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(1239): Error: template instance `std.format.internal.write.formatValueImpl!(LockingTextWriter, ModInt!(573, false), char)` error instantiating
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/format/write.d(632): instantiated from here: `formatValue!(LockingTextWriter, ModInt!(573, false), char)`
/home/linuxbrew/.linuxbrew/opt/dmd/include/dlang/dmd/std/stdio.d(1759): instantiated from here: `formattedWrite!(LockingTextWriter, char, ModInt!(573, false))`
Main.d(439): instantiated from here: `write!(ModInt!(573, false))`
Main.d(427): ... (1 instantiations, -v to show) ...
Main.d-mixin-394(394): instantiated from here: `putMain!(c, ModInt!(573, false))`
Main.d(27): instantiated from here: `put!("{}", ModInt!(573, false))`
ソースコード
// URL: https://yukicoder.me/problems/no/171
import std.algorithm, std.array, std.bitmanip, std.container, std.conv, std.format,
std.functional, std.math, std.range, std.traits, std.typecons, std.stdio, std.string;
version(unittest) {} else
void main()
{
string S; io.getV(S);
auto c = new int[](26);
foreach (Si; S) ++c[Si-'A'];
auto cn = 1000, pf = primeFactorSqrtOf(cn);
auto f = new int[](cn+1), n = cast(int)S.length;
foreach (i; 2..n+1)
foreach (e; pf.div(i)) f[e.prime] += e.exp;
foreach (ci; c)
foreach (i; 2..ci+1)
foreach (e; pf.div(i)) f[e.prime] -= e.exp;
auto r = mint(1);
foreach (i, fi; f)
r *= mint(i)^^fi;
io.put(r-1);
}
pure nothrow @nogc @safe
{
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;
}
}
struct PrimeFactor
{
struct Factor(T)
{
T prime;
int exp;
}
const int n;
int[] primes;
pure nothrow
{
this(int n)
{
this.n = n;
auto sieve = BitArray();
sieve.length((n+1)/2);
sieve = ~sieve;
foreach (p; 1..(n.isqrt-1)/2+1)
if (sieve[p])
for (auto q = p*3+1; q < (n+1)/2; q += p*2+1)
sieve[q] = false;
primes = sieve.bitsSet.map!(p => cast(int)p*2+1).array;
primes[0] = 2;
}
}
pure nothrow @safe
{
Factor!T[] div(T)(T x) const
if (isIntegral!T)
in { assert(x > 0 && x.isqrt <= n); }
do
{
Factor!T[] factors;
auto t = isqrt(x);
foreach (p; primes) {
if (p > t) break;
auto c = 0;
for (; x%p == 0; x /= p) ++c;
if (c > 0) factors ~= Factor!T(p, c);
if (x == 1) break;
}
if (x > 1) factors ~= [Factor!T(x, 1)];
return factors;
}
T[] divisors(T)(T x) const
if (isIntegral!T)
in { assert(x > 0 && x.isqrt <= n); }
do
{
auto factors = div(x);
auto r = divisorsProc(factors, 0, 1);
r.sort();
return r;
}
}
private
{
pure nothrow @safe
{
T[] divisorsProc(T)(const Factor!T[] factors, int i, T c) const
{
if (i == factors.length) return [c];
T[] r;
foreach (j; 0..factors[i].exp+1)
r ~= divisorsProc(factors, i+1, c*factors[i].prime^^j);
return r;
}
}
}
}
pure nothrow
{
auto primeFactor(int n)
{
return PrimeFactor(n);
}
auto primeFactorSqrtOf(T)(T n)
if (isIntegral!T)
{
return PrimeFactor(cast(int)n.isqrt);
}
}
const mod = 573;
alias mint = ModInt!mod;
pure nothrow @safe
{
T powr(alias pred = "a*b", T, U)(const T a, U n, T one)
if (isIntegral!U)
{
auto b = T(a);
alias predFun = binaryFun!pred;
if (n == 0) return one;
auto r = one;
for (; n > 0; n >>= 1) {
if (n&1) r = predFun(r, b);
b = predFun(b, b);
}
return r;
}
T powr(alias pred = "a*b", T, U)(const T a, U n)
if (isIntegral!U)
{
return powr!(pred, T, U)(a, n, T(1));
}
}
pure nothrow @nogc @safe
{
T cdiv(T)(const T a, const T b)
{
return (a+b-1)/b;
}
T pmod(T)(const T a, const T b)
{
return a >= 0 ? a%b : a%b+b;
}
ExtGcdResult!T extGcd(T)(const T a, const T b)
{
if (a == 0) {
return ExtGcdResult!T(b, T(0), T(1));
} else {
auto r = extGcd(b%a, a);
return ExtGcdResult!T(r.gcd, r.y-(b/a)*r.x, r.x);
}
}
private struct ExtGcdResult(T)
{
T gcd, x, y;
}
}
struct ModInt(int m, bool pos = false)
{
pure nothrow @nogc @safe
{
@property int value() { return i; }
@property void value(int v) { i = nm(v); }
alias value this;
this(T)(T v)
if (isIntegral!T)
{
i = nm(v);
}
this(ref return scope const Mint v)
{
i = v.i;
}
ref Mint opAssign(T)(T v)
if (isIntegral!T)
{
i = nm(v);
return this;
}
ref Mint opAssign(const Mint v)
{
i = v.i;
return this;
}
static if (!pos) {
Mint opUnary(string op: "-")() const
{
return Mint(-i);
}
}
static if (m < int.max / 2) {
Mint opBinary(string op, T)(T r) const
if ((op == "+" || (!pos && op == "-")) && isIntegral!T)
{
return Mint(mixin("i"~op~"r"));
}
ref Mint opOpAssign(string op, T)(T r)
if ((op == "+" || (!pos && op == "-")) && isIntegral!T)
{
i = nm(mixin("i"~op~"r"));
return this;
}
} else {
Mint opBinary(string op, T)(T r) const
if ((op == "+" || (!pos && op == "-")) && isIntegral!T)
{
return Mint(mixin("l"~op~"r"));
}
ref Mint opOpAssign(string op, T)(T r)
if ((op == "+" || (!pos && op == "-")) && isIntegral!T)
{
i = nm(mixin("l"~op~"r"));
return this;
}
}
Mint opBinary(string op: "*", T)(T r) const
if (isIntegral!T)
{
return Mint(l*r);
}
ref Mint opOpAssign(string op: "*", T)(T r)
if (isIntegral!T)
{
i = nm(l*r);
return this;
}
Mint opBinary(string op)(const Mint r) const
if (op == "+" || !pos && op == "-" || op == "*")
{
return opBinary!op(r.i);
}
ref Mint opOpAssign(string op)(const Mint r)
if (op == "+"|| !pos && op == "-" || op == "*")
{
return opOpAssign!op(r.i);
}
Mint opBinary(string op: "^^", T)(T n)
if (isIntegral!T)
{
return powr(this, n, Mint(1));
}
static if (!pos) {
Mint opBinary(string op: "/")(const Mint r) const
{
return Mint(l*r.inv.i);
}
ref Mint opOpAssign(string op: "/")(const Mint r)
{
i = nm(l*r.inv.i);
return this;
}
Mint opBinary(string op: "/", T)(T r) const
if (isIntegral!T)
{
return opBinary!op(Mint(r));
}
Mint opOpAssign(string op: "/", T)(T r)
if (isIntegral!T)
{
return opOpAssign!op(Mint(r));
}
Mint inv() const
{
return Mint(extGcd(i, m).x);
}
}
}
private
{
alias Mint = ModInt!(m, pos);
version(BigEndian) union { long l; struct { int i2; int i; } }
else union { long l; int i; }
pure nothrow @nogc @safe
{
int nm(T)(T v) const
if (isIntegral!T)
{
static if (pos) return cast(int)(v%m);
else return cast(int)pmod(v, m);
}
}
}
}
auto io = IO!()();
import std.stdio;
struct IO(alias IN = stdin, alias OUT = stdout)
{
import std.meta : allSatisfy;
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)
{
mixin("const PutConf c = "~conf~"; putMain!c(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(PutConf c, T...)(T v)
{
foreach (i, w; v) {
putOne!c(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(PutConf c, T)(T v)
{
static if (isInputRange!T && !isSomeString!T) putRange!c(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(PutConf c, T)(T v)
{
auto w = v;
while (!w.empty) {
putOne!c(w.front); w.popFront();
if (!w.empty) OUT.write(c.delimiter);
}
}
}
}