結果

問題 No.2732 Similar Permutations
ユーザー KumaTachiRenKumaTachiRen
提出日時 2024-04-19 22:28:05
言語 C#
(.NET 8.0.203)
結果
AC  
実行時間 109 ms / 2,000 ms
コード長 19,583 bytes
コンパイル時間 8,278 ms
コンパイル使用メモリ 168,724 KB
実行使用メモリ 189,956 KB
最終ジャッジ日時 2024-10-11 16:00:32
合計ジャッジ時間 28,338 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge1
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 52 ms
28,288 KB
testcase_01 AC 49 ms
28,928 KB
testcase_02 AC 74 ms
34,016 KB
testcase_03 AC 84 ms
38,144 KB
testcase_04 AC 68 ms
32,512 KB
testcase_05 AC 67 ms
32,128 KB
testcase_06 AC 65 ms
30,976 KB
testcase_07 AC 79 ms
34,832 KB
testcase_08 AC 71 ms
32,896 KB
testcase_09 AC 65 ms
31,744 KB
testcase_10 AC 104 ms
44,928 KB
testcase_11 AC 65 ms
31,360 KB
testcase_12 AC 105 ms
45,056 KB
testcase_13 AC 106 ms
45,312 KB
testcase_14 AC 105 ms
44,928 KB
testcase_15 AC 104 ms
45,168 KB
testcase_16 AC 91 ms
39,804 KB
testcase_17 AC 91 ms
39,808 KB
testcase_18 AC 100 ms
44,224 KB
testcase_19 AC 103 ms
45,440 KB
testcase_20 AC 104 ms
45,184 KB
testcase_21 AC 107 ms
45,168 KB
testcase_22 AC 86 ms
38,272 KB
testcase_23 AC 105 ms
44,928 KB
testcase_24 AC 87 ms
38,528 KB
testcase_25 AC 109 ms
44,928 KB
testcase_26 AC 96 ms
39,116 KB
testcase_27 AC 103 ms
45,056 KB
testcase_28 AC 93 ms
40,448 KB
testcase_29 AC 104 ms
44,928 KB
testcase_30 AC 92 ms
39,936 KB
testcase_31 AC 105 ms
45,312 KB
testcase_32 AC 100 ms
44,160 KB
testcase_33 AC 104 ms
45,180 KB
testcase_34 AC 89 ms
39,424 KB
testcase_35 AC 104 ms
45,056 KB
testcase_36 AC 99 ms
44,160 KB
testcase_37 AC 105 ms
45,056 KB
testcase_38 AC 99 ms
43,904 KB
testcase_39 AC 103 ms
44,800 KB
testcase_40 AC 99 ms
43,520 KB
testcase_41 AC 104 ms
44,928 KB
testcase_42 AC 92 ms
40,192 KB
testcase_43 AC 102 ms
45,312 KB
testcase_44 AC 82 ms
37,888 KB
testcase_45 AC 103 ms
45,056 KB
testcase_46 AC 99 ms
44,092 KB
testcase_47 AC 103 ms
45,056 KB
testcase_48 AC 89 ms
38,784 KB
testcase_49 AC 103 ms
45,056 KB
testcase_50 AC 86 ms
38,784 KB
testcase_51 AC 101 ms
45,056 KB
testcase_52 AC 95 ms
43,612 KB
testcase_53 AC 109 ms
45,184 KB
testcase_54 AC 104 ms
44,928 KB
testcase_55 AC 103 ms
45,184 KB
testcase_56 AC 104 ms
45,184 KB
testcase_57 AC 84 ms
38,016 KB
testcase_58 AC 94 ms
39,936 KB
testcase_59 AC 88 ms
39,296 KB
testcase_60 AC 84 ms
38,400 KB
testcase_61 AC 83 ms
37,632 KB
testcase_62 AC 95 ms
39,368 KB
testcase_63 AC 49 ms
28,924 KB
testcase_64 AC 49 ms
29,016 KB
testcase_65 AC 48 ms
29,056 KB
testcase_66 AC 48 ms
28,800 KB
testcase_67 AC 49 ms
29,440 KB
testcase_68 AC 49 ms
29,056 KB
testcase_69 AC 52 ms
28,672 KB
testcase_70 AC 52 ms
28,416 KB
testcase_71 AC 54 ms
28,288 KB
testcase_72 AC 53 ms
28,288 KB
testcase_73 AC 53 ms
28,416 KB
testcase_74 AC 52 ms
28,160 KB
testcase_75 AC 53 ms
28,544 KB
testcase_76 AC 52 ms
28,412 KB
testcase_77 AC 52 ms
28,416 KB
testcase_78 AC 52 ms
28,416 KB
testcase_79 AC 52 ms
28,544 KB
testcase_80 AC 52 ms
28,160 KB
testcase_81 AC 53 ms
28,288 KB
testcase_82 AC 52 ms
28,412 KB
testcase_83 AC 52 ms
28,416 KB
testcase_84 AC 52 ms
28,416 KB
testcase_85 AC 51 ms
28,160 KB
testcase_86 AC 52 ms
28,288 KB
testcase_87 AC 52 ms
28,288 KB
testcase_88 AC 53 ms
28,288 KB
testcase_89 AC 53 ms
28,288 KB
testcase_90 AC 52 ms
28,160 KB
testcase_91 AC 52 ms
28,416 KB
testcase_92 AC 52 ms
28,416 KB
testcase_93 AC 52 ms
28,416 KB
testcase_94 AC 53 ms
28,416 KB
testcase_95 AC 52 ms
28,160 KB
testcase_96 AC 52 ms
28,288 KB
testcase_97 AC 52 ms
28,416 KB
testcase_98 AC 53 ms
28,412 KB
testcase_99 AC 53 ms
28,416 KB
testcase_100 AC 54 ms
28,412 KB
testcase_101 AC 53 ms
28,416 KB
testcase_102 AC 54 ms
189,956 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (93 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
/home/judge/data/code/Main.cs(161,4102): warning CS8632: '#nullable' 注釈コンテキスト内のコードでのみ、Null 許容参照型の注釈を使用する必要があります。 [/home/judge/data/code/main.csproj]
  main -> /home/judge/data/code/bin/Release/net8.0/main.dll
  main -> /home/judge/data/code/bin/Release/net8.0/publish/

ソースコード

diff # 

using System;
using System.ComponentModel;
using System.Collections;
using System.Collections.Generic;
using System.Diagnostics;
using System.Diagnostics.Contracts;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Text;
using static Functions;
using static OutputLib;

using ModInt = StaticModInt<Mod998244353>;

static class Program
{
    static public void Main(string[] args)
    {
        Console.SetOut(new StreamWriter(Console.OpenStandardOutput()) { AutoFlush = false });
        new Solver();
        Console.Out.Flush();
    }
}

public class Solver
{
    public Solver()
    {

        Solve();
    }

    void Check()
    {
        int n = ri;
        var a = new int[n];
        for (int i = 0; i < n; i++) a[i] = i;
        var p = new int[n];
        for (int i = 0; i < n; i++) p[i] = ri;
        var q = new int[n];
        for (int i = 0; i < n; i++) q[i] = ri;
        int v = 0;
        for (int i = 0; i < n; i++) v ^= p[i] + a[i];
        int w = 0;
        for (int i = 0; i < n; i++) w ^= q[i] + a[i];
        Write((v, w));
    }

    void Solve()
    {
        int n = ri;
        var a = new int[n];
        for (int i = 0; i < n; i++) a[i] = ri;

        if (n <= 10)
        {
            var p = new Permutation(n);
            var dic = new Dictionary<int, long>();
            do
            {
                int z = 0;
                for (int i = 0; i < n; i++) z ^= p[i] + 1 + a[i];
                if (dic.ContainsKey(z))
                {
                    var ans = new int[n];
                    for (int i = 0; i < n; i++) ans[i] = p[i] + 1;
                    WriteJoin(" ", ans);
                    long x = dic[z];
                    for (int i = 0; i < n; i++, x /= 10) ans[i] = (int)(x % 10) + 1;
                    WriteJoin(" ", ans);
                    return;
                }
                else
                {
                    long v = 0;
                    for (int i = n - 1; i >= 0; i--) v = v * 10 + p[i];
                    dic.Add(z, v);
                }
            } while (p.Next());
            Write(-1);
        }
        else
        {
            var p = new int[n];
            for (int i = 0; i < n; i++) p[i] = i + 1;
            var rnd = new XORShift.XORShift32();

            ModInt w = 0;
            var pow = new ModInt[n];
            pow[0] = 1;
            for (int i = 0; i + 1 < n; i++) pow[i + 1] = pow[i] * 11872653;
            for (int i = 0; i < n; i++) w += p[i] * pow[i];

            int z = 0;
            for (int i = 0; i < n; i++) z ^= p[i] + a[i];

            var dic = new Dictionary<int, int>();
            var dic_hash = new Dictionary<int, ModInt>();
            dic.Add(z, 0);
            dic_hash.Add(z, w);
            var st = new Stack<(int i, int j)>();

            while (true)
            {
                int x = (int)SafeMod(rnd.Next(), n);
                int y = (int)SafeMod(rnd.Next(), n - 1);
                if (y == x) y = n - 1;
                z ^= p[x] + a[x]; w -= p[x] * pow[x];
                z ^= p[y] + a[y]; w -= p[y] * pow[y];
                (p[x], p[y]) = (p[y], p[x]);
                z ^= p[x] + a[x]; w += p[x] * pow[x];
                z ^= p[y] + a[y]; w += p[y] * pow[y];
                st.Push((x, y));

                if (dic.ContainsKey(z))
                {
                    if (w == dic_hash[z]) continue;
                    int v = dic[z];
                    WriteJoin(" ", p);
                    while (st.Count > v)
                    {
                        (x, y) = st.Pop();
                        (p[x], p[y]) = (p[y], p[x]);
                    }
                    WriteJoin(" ", p);
                    return;
                }
                else
                {
                    dic.Add(z, st.Count);
                    dic_hash.Add(z, w);
                }
            }
        }
    }

    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    (int, int) ri2 { [MethodImpl(256)] get => (ri, ri); }
    (int, int, int) ri3 { [MethodImpl(256)] get => (ri, ri, ri); }
    (int, int, int, int) ri4 { [MethodImpl(256)] get => (ri, ri, ri, ri); }
    (int, int, int, int, int) ri5 { [MethodImpl(256)] get => (ri, ri, ri, ri, ri); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    (long, long) rl2 { [MethodImpl(256)] get => (rl, rl); }
    (long, long, long) rl3 { [MethodImpl(256)] get => (rl, rl, rl); }
    (long, long, long, long) rl4 { [MethodImpl(256)] get => (rl, rl, rl, rl); }
    (long, long, long, long, long) rl5 { [MethodImpl(256)] get => (rl, rl, rl, rl, rl); }
    uint rui { [MethodImpl(256)] get => (uint)sc.UInteger(); }
    ulong rul { [MethodImpl(256)] get => sc.UInteger(); }
    double rd { [MethodImpl(256)] get => sc.Double(); }
    string rs { [MethodImpl(256)] get => sc.Scan(); }
    string rline { [MethodImpl(256)] get => sc.Line(); }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());
}
public static class Functions { [MethodImpl(256)] public static int Popcount(ulong x) { x = (x & 0x5555555555555555UL) + ((x >> 1) & 0x5555555555555555UL); x = (x & 0x3333333333333333UL) + ((x >> 2) & 0x3333333333333333UL); x = (x & 0x0f0f0f0f0f0f0f0fUL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fUL); x = (x & 0x00ff00ff00ff00ffUL) + ((x >> 8) & 0x00ff00ff00ff00ffUL); x = (x & 0x0000ffff0000ffffUL) + ((x >> 16) & 0x0000ffff0000ffffUL); x = (x & 0x00000000ffffffffUL) + ((x >> 32) & 0x00000000ffffffffUL); return (int)x; } [MethodImpl(256)] public static int Popcount(long x) { x = (x & 0x5555555555555555L) + ((x >> 1) & 0x5555555555555555L); x = (x & 0x3333333333333333L) + ((x >> 2) & 0x3333333333333333L); x = (x & 0x0f0f0f0f0f0f0f0fL) + ((x >> 4) & 0x0f0f0f0f0f0f0f0fL); x = (x & 0x00ff00ff00ff00ffL) + ((x >> 8) & 0x00ff00ff00ff00ffL); x = (x & 0x0000ffff0000ffffL) + ((x >> 16) & 0x0000ffff0000ffffL); x = (x & 0x00000000ffffffffL) + ((x >> 32) & 0x00000000ffffffffL); return (int)x; } [MethodImpl(256)] public static int Popcount(int x) { x = (x & 0x55555555) + ((x >> 1) & 0x55555555); x = (x & 0x33333333) + ((x >> 2) & 0x33333333); x = (x & 0x0f0f0f0f) + ((x >> 4) & 0x0f0f0f0f); x = (x & 0x00ff00ff) + ((x >> 8) & 0x00ff00ff); x = (x & 0x0000ffff) + ((x >> 16) & 0x0000ffff); return x; } [MethodImpl(256)] public static int Ctz(long x) { if (x == 0) return -1; return Popcount((ulong)((x & -x) - 1)); } [MethodImpl(256)] public static int CeilPow2(int n) { int x = 0; while ((1 << x) < n) x++; return x; } [MethodImpl(256)] public static int SafeMod(int x, int m) { int r = x % m; return r < 0 ? r + Math.Abs(m) : r; } [MethodImpl(256)] public static long SafeMod(long x, long m) { long r = x % m; return r < 0 ? r + Math.Abs(m) : r; } [MethodImpl(256)] public static bool IsIncreasing(long a, long b, long c) => a <= b && b <= c; [MethodImpl(256)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1); [MethodImpl(256)] public static int Sign(double x) => x == 0 ? 0 : (x < 0 ? -1 : 1); [MethodImpl(256)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; } [MethodImpl(256)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1; [MethodImpl(256)] public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b; [MethodImpl(256)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static uint Gcd(uint a, uint b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static ulong Gcd(ulong a, ulong b) => b == 0 ? a : Gcd(b, a % b); [MethodImpl(256)] public static (long x, long y, long g) ExtGcd(long a, long b) { if (b == 0) return (Sign(a), 0, Math.Abs(a)); long c = SafeMod(a, b); var (x2, y2, g) = ExtGcd(b, c); long x = SafeMod(y2, b); long y = (g - a * x) / b; return (x, y, g); } [MethodImpl(256)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; } [MethodImpl(256)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; } [MethodImpl(256)] public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; } [MethodImpl(256)] public static T Clamp<T>(T x, T l, T r) where T : IComparable<T> => x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r); [MethodImpl(256)] public static T Clamp<T>(ref T x, T l, T r) where T : IComparable<T> => x = x.CompareTo(l) <= 0 ? l : (x.CompareTo(r) <= 0 ? x : r); [MethodImpl(256)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; } [MethodImpl(256)] public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; } [MethodImpl(256)] public static int LowerBound(long[] arr, long val, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), t => Sign(t - val), l, r); [MethodImpl(256)] public static int LowerBound(int[] arr, int val, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), t => t - val, l, r); [MethodImpl(256)] public static int LowerBound<T>(T[] arr, T val, int l = -1, int r = -1) where T : IComparable<T> => LowerBound(arr.AsSpan(), t => t.CompareTo(val), l, r); [MethodImpl(256)] public static int LowerBound<T>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound(arr.AsSpan(), comp, l, r); [MethodImpl(256)] public static int LowerBound<T>(Span<T> data, Func<T, int> comp, int l = -1, int r = -1) { if (data.Length == 0) return -1; if (l == -1) l = 0; if (r == -1) r = data.Length; while (l < r) { int x = (l + r) / 2; if (comp(data[x]) < 0) l = x + 1; else r = x; } return l; } [MethodImpl(256)] public static int RangeCount<T>(T[] arr, T geq, T lt, int l = -1, int r = -1) where T : IComparable<T> => Math.Max(0, LowerBound(arr.AsSpan(), t => t.CompareTo(lt), l, r) - LowerBound(arr.AsSpan(), t => t.CompareTo(geq), l, r)); [MethodImpl(256)] public static string ToBase2(long v, int digit = -1) { if (digit == -1) { digit = 0; while ((v >> digit) > 0) digit++; } var c = new string[digit]; for (int i = 0; i < digit; i++) c[digit - 1 - i] = ((v >> i) & 1) == 0 ? "0" : "1"; return string.Join("", c); } [MethodImpl(256)] public static string ToBaseN(long v, int n, int digit = -1) { if (digit == -1) { digit = 0; long pow = 1; while (v >= pow) { digit++; pow *= n; } } var c = new int[digit]; for (int i = 0; i < digit; i++, v /= n) c[digit - 1 - i] = (int)(v % n); return string.Join("", c); } }
public partial class StreamScanner { public StreamScanner(Stream stream) { str = stream; } private readonly Stream str; private readonly byte[] buf = new byte[1024]; private int len, ptr; public bool isEof = false; public bool IsEndOfStream { get { return isEof; } } [MethodImpl(256)] private byte read() { if (isEof) throw new EndOfStreamException(); if (ptr >= len) { ptr = 0; if ((len = str.Read(buf, 0, 1024)) <= 0) { isEof = true; return 0; } } return buf[ptr++]; } [MethodImpl(256)] public char Char() { byte b = 0; do b = read(); while (b < 33 || 126 < b); return (char)b; } [MethodImpl(256)] public string Line() { var sb = new StringBuilder(); for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b); return sb.ToString(); } [MethodImpl(256)] public string Scan() { var sb = new StringBuilder(); for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b); return sb.ToString(); } [MethodImpl(256)] public long Integer() { long ret = 0; byte b = 0; var ng = false; do b = read(); while (b != '-' && (b < '0' || '9' < b)); if (b == '-') { ng = true; b = read(); } for (; true; b = read()) { if (b < '0' || '9' < b) return ng ? -ret : ret; else ret = ret * 10 + b - '0'; } } [MethodImpl(256)] public ulong UInteger() { ulong ret = 0; byte b = 0; do b = read(); while (b < '0' || '9' < b); for (; true; b = read()) { if (b < '0' || '9' < b) return ret; else ret = ret * 10 + b - '0'; } } [MethodImpl(256)] public double Double() => double.Parse(Scan()); } 
public static class OutputLib { [MethodImpl(256)] public static void WriteJoin<T>(string s, IEnumerable<T> t) => Console.WriteLine(string.Join(s, t)); [MethodImpl(256)] public static void WriteMat<T>(T[,] a, string sep = " ") { int sz1 = a.GetLength(0), sz2 = a.GetLength(1); var b = new T[sz2]; for (int i = 0; i < sz1; i++) { for (int j = 0; j < sz2; j++) b[j] = a[i, j]; WriteJoin(sep, b); } } [MethodImpl(256)] public static void WriteMat<T>(T[][] a, string sep = " ") { for (int i = 0; i < a.Length; i++) WriteJoin(sep, a[i]); } [MethodImpl(256)] public static void WriteMat<T>(T[][] a, Func<T, string> map, string sep = " ") { for (int i = 0; i < a.Length; i++) WriteJoin(sep, a[i].Select(x => map(x))); } [MethodImpl(256)] public static void Write(object t) => Console.WriteLine(t.ToString()); [MethodImpl(256)] public static void Write(params object[] arg) => Console.WriteLine(string.Join(" ", arg.Select(x => x.ToString()))); [MethodImpl(256)] public static void Write(string str) => Console.WriteLine(str); [MethodImpl(256)] public static void WriteFlush(object t) { Console.WriteLine(t.ToString()); Console.Out.Flush(); } [MethodImpl(256)] public static void WriteError(object t) => Console.Error.WriteLine(t.ToString()); [MethodImpl(256)] public static void Flush() => Console.Out.Flush(); [MethodImpl(256)] public static void YN(bool t) => Console.WriteLine(t ? "YES" : "NO"); [MethodImpl(256)] public static void Yn(bool t) => Console.WriteLine(t ? "Yes" : "No"); [MethodImpl(256)] public static void yn(bool t) => Console.WriteLine(t ? "yes" : "no"); [MethodImpl(256)] public static void DeleteLine() => Console.Write("\x1b[1A\x1b[2K"); [MethodImpl(256)] public static void ProgressBar(long now, long total, int blocks = 50) { int x = (int)((2 * now * blocks + 1) / (2 * total)); Console.Write($"\x1b[G[\x1b[42m{string.Concat(Enumerable.Repeat("_", x))}\x1b[0m{string.Concat(Enumerable.Repeat("_", blocks - x))}] : {now} / {total}"); } } 
public interface IStaticMod { uint Mod { get; } bool IsPrime { get; } } public readonly struct Mod1000000007 : IStaticMod { public uint Mod => 1000000007; public bool IsPrime => true; } public readonly struct Mod998244353 : IStaticMod { public uint Mod => 998244353; public bool IsPrime => true; } public readonly struct StaticModInt<T> : IEquatable<StaticModInt<T>> where T : struct, IStaticMod { internal readonly uint _v; private static readonly T op = default; public int Value => (int)_v; public static int Mod => (int)op.Mod; public static StaticModInt<T> Zero => default; public static StaticModInt<T> One => new StaticModInt<T>(1u); [MethodImpl(256)] public static StaticModInt<T> Raw(int v) { var u = unchecked((uint)v); return new StaticModInt<T>(u); } [MethodImpl(256)] public StaticModInt(long v) : this(Round(v)) { } [MethodImpl(256)] public StaticModInt(ulong v) : this((uint)(v % op.Mod)) { } [MethodImpl(256)] private StaticModInt(uint v) => _v = v; [MethodImpl(256)] private static uint Round(long v) { var x = v % op.Mod; if (x < 0) x += op.Mod; return (uint)x; } [MethodImpl(256)] public static StaticModInt<T> operator ++(StaticModInt<T> v) { var x = v._v + 1; if (x == op.Mod) x = 0; return new StaticModInt<T>(x); } [MethodImpl(256)] public static StaticModInt<T> operator --(StaticModInt<T> v) { var x = v._v; if (x == 0) x = op.Mod; return new StaticModInt<T>(x - 1); } [MethodImpl(256)] public static StaticModInt<T> operator +(StaticModInt<T> lhs, StaticModInt<T> rhs) { var v = lhs._v + rhs._v; if (v >= op.Mod) v -= op.Mod; return new StaticModInt<T>(v); } [MethodImpl(256)] public static StaticModInt<T> operator -(StaticModInt<T> lhs, StaticModInt<T> rhs) { unchecked { var v = lhs._v - rhs._v; if (v >= op.Mod) v += op.Mod; return new StaticModInt<T>(v); } } [MethodImpl(256)] public static StaticModInt<T> operator *(StaticModInt<T> lhs, StaticModInt<T> rhs) => new StaticModInt<T>((uint)((ulong)lhs._v * rhs._v % op.Mod)); [MethodImpl(256)] public static StaticModInt<T> operator /(StaticModInt<T> lhs, StaticModInt<T> rhs) => new StaticModInt<T>((uint)((ulong)lhs._v * Inv(rhs._v) % op.Mod)); [MethodImpl(256)] public static StaticModInt<T> operator +(StaticModInt<T> v) => v; [MethodImpl(256)] public static StaticModInt<T> operator -(StaticModInt<T> v) => new StaticModInt<T>(v._v == 0 ? 0 : op.Mod - v._v); [MethodImpl(256)] public static bool operator ==(StaticModInt<T> lhs, StaticModInt<T> rhs) => lhs._v == rhs._v; [MethodImpl(256)] public static bool operator !=(StaticModInt<T> lhs, StaticModInt<T> rhs) => lhs._v != rhs._v; [MethodImpl(256)] public static implicit operator StaticModInt<T>(int v) => new StaticModInt<T>(v); [MethodImpl(256)] public static implicit operator StaticModInt<T>(uint v) => new StaticModInt<T>((long)v); [MethodImpl(256)] public static implicit operator StaticModInt<T>(long v) => new StaticModInt<T>(v); [MethodImpl(256)] public static implicit operator StaticModInt<T>(ulong v) => new StaticModInt<T>(v); [MethodImpl(256)] public static implicit operator long(StaticModInt<T> v) => v._v; [MethodImpl(256)] public static implicit operator ulong(StaticModInt<T> v) => v._v; [MethodImpl(256)] public StaticModInt<T> Pow(long n) { var x = this; var r = new StaticModInt<T>(1U); if (n < 0) (x, n) = (x.Inv(), -n); while (n > 0) { if ((n & 1) > 0) r *= x; x *= x; n >>= 1; } return r; } [MethodImpl(256)] public StaticModInt<T> Inv() => new StaticModInt<T>(Inv(_v)); [MethodImpl(256)] static ulong Inv(ulong x) { long u = op.Mod, xu = 1, yu = 0, v = (long)x, xv = 0, yv = 1; while (v != 0) { long w = SafeMod(u, v); long q = (u - w) / v; long xw = xu - xv * q; long yw = yu - yv * q; u = v; xu = xv; yu = yv; v = w; xv = xw; yv = yw; } return (ulong)(yu < 0 ? yu + op.Mod : yu); } [MethodImpl(256)] static long SafeMod(long x, long m) { long r = x % m; if (r < 0) r += m; return r; } [MethodImpl(256)] public override string ToString() => _v.ToString(); [MethodImpl(256)] public string ToString(string format, IFormatProvider formatProvider) => _v.ToString(format, formatProvider); [MethodImpl(256)] public override bool Equals(object? obj) => obj is StaticModInt<T> m && Equals(m); [MethodImpl(256)] public bool Equals(StaticModInt<T> other) => _v == other._v; [MethodImpl(256)] public override int GetHashCode() => _v.GetHashCode(); } 
public class Permutation { int n; int[] p; public Permutation(int[] _p) { n = _p.Length; p = (int[])_p.Clone(); } public Permutation(int _n) { n = _n; p = new int[n]; for (int i = 0; i < n; i++) p[i] = i; } public bool Next() { for (int i = n - 2; i >= 0; i--) { if (p[i] < p[i + 1]) { int j = n - 1; while (!(p[i] < p[j])) j--; Swap(ref p[i], ref p[j]); for (int k = 1; i + k < n - k; k++) Swap(ref p[i + k], ref p[n - k]); return true; } } for (int i = 0; i < n - 1 - i; i++) Swap(ref p[i], ref p[n - 1 - i]); return false; } public bool Prev() { for (int i = n - 2; i >= 0; i--) { if (p[i] > p[i + 1]) { int j = n - 1; while (!(p[i] > p[j])) j--; Swap(ref p[i], ref p[j]); for (int k = 1; i + k < n - k; k++) Swap(ref p[i + k], ref p[n - k]); return true; } } for (int i = 0; i < n - 1 - i; i++) Swap(ref p[i], ref p[n - 1 - i]); return false; } public int this[int k] { get { if (k < 0 || k >= n) throw new IndexOutOfRangeException(); return p[k]; } } } 
public class XORShift { public class XORShift32 { uint x; public XORShift32() { x = 2463534242; } public uint Next() { x ^= x << 13; x ^= x >> 17; x ^= x << 5; return x; } } public class XORShift64 { ulong x; public XORShift64() { x = 88172645463325252; } public ulong Next() { x ^= x << 13; x ^= x >> 7; x ^= x << 17; return x; } } }
0