結果

問題 No.2254 Reverse Only
ユーザー KumaTachiRenKumaTachiRen
提出日時 2023-03-24 23:00:43
言語 C#
(.NET 8.0.203)
結果
TLE  
(最新)
AC  
(最初)
実行時間 -
コード長 13,321 bytes
コンパイル時間 9,959 ms
コンパイル使用メモリ 167,736 KB
実行使用メモリ 187,512 KB
最終ジャッジ日時 2024-09-18 17:27:42
合計ジャッジ時間 26,438 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 50 ms
25,344 KB
testcase_01 AC 48 ms
25,088 KB
testcase_02 AC 48 ms
25,216 KB
testcase_03 AC 49 ms
25,472 KB
testcase_04 AC 48 ms
25,064 KB
testcase_05 AC 49 ms
25,216 KB
testcase_06 AC 48 ms
25,216 KB
testcase_07 AC 48 ms
25,216 KB
testcase_08 AC 87 ms
28,928 KB
testcase_09 AC 294 ms
32,768 KB
testcase_10 AC 85 ms
28,416 KB
testcase_11 AC 86 ms
29,184 KB
testcase_12 AC 87 ms
29,184 KB
testcase_13 AC 88 ms
29,184 KB
testcase_14 AC 86 ms
29,056 KB
testcase_15 AC 86 ms
29,184 KB
testcase_16 TLE -
testcase_17 TLE -
testcase_18 AC 88 ms
29,312 KB
testcase_19 AC 86 ms
28,656 KB
testcase_20 AC 288 ms
32,000 KB
testcase_21 AC 291 ms
31,616 KB
testcase_22 AC 275 ms
31,716 KB
testcase_23 AC 295 ms
31,744 KB
testcase_24 TLE -
testcase_25 TLE -
testcase_26 TLE -
testcase_27 AC 52 ms
26,368 KB
testcase_28 AC 64 ms
27,636 KB
testcase_29 AC 71 ms
28,416 KB
testcase_30 AC 70 ms
28,160 KB
testcase_31 AC 64 ms
27,776 KB
testcase_32 AC 66 ms
27,776 KB
testcase_33 AC 60 ms
27,776 KB
testcase_34 AC 76 ms
28,416 KB
testcase_35 AC 70 ms
28,160 KB
testcase_36 AC 84 ms
29,056 KB
testcase_37 AC 85 ms
28,800 KB
testcase_38 AC 62 ms
27,776 KB
testcase_39 AC 82 ms
28,800 KB
testcase_40 AC 51 ms
25,960 KB
testcase_41 AC 68 ms
28,160 KB
testcase_42 AC 62 ms
27,880 KB
testcase_43 AC 78 ms
28,544 KB
testcase_44 AC 89 ms
29,056 KB
testcase_45 AC 76 ms
28,416 KB
testcase_46 AC 50 ms
187,512 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (96 ms)。
MSBuild のバージョン 17.9.6+a4ecab324 (.NET)
  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.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;

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 Solve()
    {
        int n = ri, k = ri;
        var a = new int[n];
        var b = new int[n];
        for (int i = 0; i < n; i++) a[i] = ri;
        for (int i = 0; i < n; i++) b[i] = ri;

        var cnt = new int[200010];
        for (int i = 0; i < n; i++) cnt[a[i]]++;
        for (int i = 0; i < n; i++) cnt[b[i]]--;
        if (cnt.Max() > 0)
        {
            Yn(false);
            return;
        }

        if (k <= n - 2)
        {
            Yn(true);
            return;
        }

        bool same = true;
        for (int i = 0; i < n; i++) same &= a[i] == b[i];
        if (k > n)
        {
            Yn(same);
            return;
        }
        if (k == n)
        {
            bool revsame = true;
            for (int i = 0; i < n; i++) revsame &= a[i] == b[n - 1 - i];
            Yn(same || revsame);
            return;
        }
        if (k == n - 1)
        {
            var rnd = new Random();
            for (int l = 0; l < 10; l++)
            {
                long ba = rnd.Next(1000000) + 1000000;
                ModInt brh1 = 0, brh2 = 0;
                for (int i = 0; i < n; i++)
                {
                    brh1 = brh1 * ba + b[i];
                    brh2 = brh2 * ba + b[n - 1 - i];
                }

                var rh1 = new ModInt[2 * n + 1];
                for (int i = 0; i < n; i++) rh1[i + 1] = rh1[i] * ba + a[i];
                for (int i = 0; i < n; i++) rh1[n + i + 1] = rh1[n + i] * ba + a[i];
                var rh2 = new ModInt[2 * n + 1];
                for (int i = 0; i < n; i++) rh1[i + 1] = rh1[i] * ba + a[n - 1 - i];
                for (int i = 0; i < n; i++) rh1[n + i + 1] = rh1[n + i] * ba + a[n - 1 - i];

                ModInt pow = new ModInt(ba).Pow(n);

                bool ok = false;
                for (int i = 0; i < n; i++) ok |= brh1 == rh1[i + n] - rh1[i] * pow;
                for (int i = 0; i < n; i++) ok |= brh1 == rh2[i + n] - rh2[i] * pow;
                for (int i = 0; i < n; i++) ok |= brh2 == rh1[i + n] - rh1[i] * pow;
                for (int i = 0; i < n; i++) ok |= brh2 == rh2[i + n] - rh2[i] * pow;
                if (!ok)
                {
                    Yn(false);
                    return;
                }
            }
            Yn(true);
            return;
        }
    }

    const long INF = 1L << 60;
    int ri { get { return (int)sc.Integer(); } }
    long rl { get { return sc.Integer(); } }
    ulong rul { get { return sc.UInteger(); } }
    double rd { get { return sc.Double(); } }
    string rs { get { return sc.Scan(); } }
    string rline { get { return sc.Line(); } }
    public StreamScanner sc = new StreamScanner(Console.OpenStandardInput());

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    T[] RepArray<T>(T t, int count) => Enumerable.Repeat(t, count).ToArray();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteJoin<T>(string s, IEnumerable<T> t) => Console.WriteLine(string.Join(s, t));
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteMat<T>(T[,] a)
    {
        int sz1 = a.GetLength(0);
        int sz2 = a.GetLength(1);
        for (int i = 0; i < sz1; i++)
        {
            var s = new List<string>();
            for (int j = 0; j < sz2; j++) s.Add(a[i, j].ToString());
            WriteJoin(" ", s);
        }
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(object t) => Console.WriteLine(t.ToString());
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str) => Console.WriteLine(str);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1) => Console.WriteLine(str, arg1);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Write(string str, params object[] arg) => Console.WriteLine(str, arg);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteFlush(object t)
    { Console.WriteLine(t.ToString()); Console.Out.Flush(); }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void WriteError(object t) => Console.Error.WriteLine(t.ToString());
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void YN(bool t) => Console.WriteLine(t ? "YES" : "NO");
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void Yn(bool t) => Console.WriteLine(t ? "Yes" : "No");
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    void yn(bool t) => Console.WriteLine(t ? "yes" : "no");
}

public static class Functions
{
    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;
    }
    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;
    }
    public static int Ctz(long x)
    {
        if (x == 0) return -1;
        return Popcount((ulong)((x & -x) - 1));
    }
    public static int SafeMod(int x, int m)
    {
        int r = x % m;
        return r < 0 ? r + m : r;
    }
    public static long SafeMod(long x, long m)
    {
        long r = x % m;
        return r < 0 ? r + m : r;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int Sign(long x) => x == 0 ? 0 : (x < 0 ? -1 : 1);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int DigitSum(long n, int d = 10) { long s = 0; while (n > 0) { s += n % d; n /= d; } return (int)s; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Floor(long a, long b) => a >= 0 ? a / b : (a + 1) / b - 1;
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Ceil(long a, long b) => a > 0 ? (a - 1) / b + 1 : a / b;
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static int Gcd(int a, int b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap(ref int x, ref int y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap(ref long x, ref long y) { x ^= y; y ^= x; x ^= y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Swap<T>(ref T x, ref T y) { T t = y; y = x; x = t; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] 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(MethodImplOptions.AggressiveInlining)] 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(MethodImplOptions.AggressiveInlining)] public static void Chmin<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) > 0) x = y; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)] public static void Chmax<T>(ref T x, T y) where T : IComparable<T> { if (x.CompareTo(y) < 0) x = y; }
    public static int LowerBound<T>(T[] arr, Func<T, int> comp, int l = -1, int r = -1) => LowerBound<T>(arr.AsSpan<T>(), comp, l, r);
    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;
    }
}

public 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; } }
    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++];
    }
    public char Char()
    {
        byte b = 0;
        do b = read();
        while (b < 33 || 126 < b);
        return (char)b;
    }
    public string Line()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b != 10 && !isEof; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    public string Scan()
    {
        var sb = new StringBuilder();
        for (var b = Char(); b >= 33 && b <= 126; b = (char)read()) sb.Append(b);
        return sb.ToString();
    }
    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';
        }
    }
    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';
        }
    }
    public double Double() { return double.Parse(Scan()); }
}

struct ModInt
{
    public static long Mod = 998244353;
    public long Val { get; private set; }
    public ModInt(long v) { Val = SafeMod(v, Mod); }
    public override string ToString() { return Val.ToString(); }
    public override bool Equals(object obj) => obj is ModInt other && this.Equals(other);
    public bool Equals(ModInt x) => Val == x.Val;
    public override int GetHashCode() => Val.GetHashCode();
    public static bool operator ==(ModInt a, ModInt b) { return a.Val == b.Val; }
    public static bool operator !=(ModInt a, ModInt b) { return a.Val != b.Val; }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static implicit operator ModInt(long n) => new ModInt(SafeMod(n, Mod));
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static ModInt operator +(ModInt a, ModInt b)
    {
        long r = a.Val + b.Val;
        return new ModInt(r < Mod ? r : r - Mod);
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static ModInt operator -(ModInt a, ModInt b)
    {
        long r = a.Val - b.Val;
        return new ModInt(r < 0 ? r + Mod : r);
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static ModInt operator -(ModInt a) => new ModInt(a.Val == 0 ? 0 : Mod - a.Val);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static ModInt operator *(ModInt a, ModInt b) => new ModInt(a.Val * b.Val % Mod);
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public static ModInt operator /(ModInt a, ModInt b) => a * b.Inv();
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public ModInt Pow(long n)
    {
        long t = Val, r = 1;
        while (n > 0)
        {
            if ((n & 1) == 1) r = r * t % Mod;
            t = t * t % Mod;
            n >>= 1;
        }
        return new ModInt(r);
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public ModInt Inv() => Gcd(Val, Mod).x;
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    private static (long x, long y, long g) Gcd(long a, long b)
    {

        if (b == 0) return a >= 0 ? (1, 0, a) : (-1, 0, -a);
        long c = a % b;
        if (c < 0) c += b;
        var r = Gcd(b, c);
        long x = SafeMod(r.y, b);
        long g = r.g;
        long y = (g - a * x) / b;
        return (x, y, g);
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    private static long SafeMod(long x, long m)
    {
        long r = x % m;
        return r < 0 ? r + m : r;
    }
}
0