結果

問題 No.2397 ω冪
ユーザー KumaTachiRenKumaTachiRen
提出日時 2023-07-28 23:49:36
言語 C#
(.NET 8.0.203)
結果
WA  
実行時間 -
コード長 12,461 bytes
コンパイル時間 11,015 ms
コンパイル使用メモリ 172,564 KB
実行使用メモリ 219,528 KB
最終ジャッジ日時 2024-10-06 22:26:22
合計ジャッジ時間 62,944 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 42 ms
23,168 KB
testcase_01 AC 41 ms
23,416 KB
testcase_02 AC 1,355 ms
56,576 KB
testcase_03 AC 43 ms
23,296 KB
testcase_04 AC 1,345 ms
56,436 KB
testcase_05 AC 1,348 ms
56,448 KB
testcase_06 AC 1,348 ms
56,436 KB
testcase_07 AC 1,336 ms
56,580 KB
testcase_08 AC 1,347 ms
56,472 KB
testcase_09 AC 1,372 ms
56,424 KB
testcase_10 AC 1,354 ms
56,320 KB
testcase_11 AC 1,343 ms
56,456 KB
testcase_12 AC 1,350 ms
56,448 KB
testcase_13 AC 1,364 ms
56,448 KB
testcase_14 WA -
testcase_15 AC 1,354 ms
56,324 KB
testcase_16 AC 1,353 ms
56,448 KB
testcase_17 WA -
testcase_18 WA -
testcase_19 AC 1,348 ms
56,452 KB
testcase_20 AC 1,350 ms
56,448 KB
testcase_21 AC 1,342 ms
56,324 KB
testcase_22 AC 1,370 ms
56,564 KB
testcase_23 AC 1,354 ms
56,428 KB
testcase_24 AC 1,360 ms
56,432 KB
testcase_25 WA -
testcase_26 AC 1,357 ms
58,472 KB
testcase_27 AC 1,364 ms
56,436 KB
testcase_28 AC 1,364 ms
56,436 KB
testcase_29 WA -
testcase_30 AC 1,376 ms
56,468 KB
testcase_31 AC 1,361 ms
56,432 KB
testcase_32 WA -
testcase_33 WA -
testcase_34 AC 1,336 ms
56,436 KB
testcase_35 AC 1,330 ms
56,808 KB
testcase_36 AC 1,375 ms
57,448 KB
testcase_37 AC 1,346 ms
57,236 KB
testcase_38 AC 1,359 ms
57,312 KB
testcase_39 AC 1,374 ms
57,336 KB
testcase_40 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
  復元対象のプロジェクトを決定しています...
  /home/judge/data/code/main.csproj を復元しました (110 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.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.Intrinsics.X86;
using System.Runtime.CompilerServices;
using System.Runtime.InteropServices;
using System.Text;
using static Functions;
using static OutputLib;

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();
    }

    const int max = 100100;
    Dictionary<int, int>[] memo;
    void Solve()
    {
        var n = rs;
        var m = rs;

        if (n == m)
        {
            Yn(false);
            return;
        }
        if (n == "0")
        {
            Yn(true);
            return;
        }
        if (m == "0")
        {
            Yn(false);
            return;
        }

        memo = new Dictionary<int, int>[max];
        for (int i = 0; i < max; i++) memo[i] = CalcN(i);

        var nr = CalcS(n);
        var mr = CalcS(m);

        var ord = CalcO(100010);
        ord.Reverse();
        bool ans = false;
        for (int i = 0; i < ord.Count; i++)
        {
            int cx = 0, cy = 0;
            int j = i;
            int v = ord[i];
            for (; j < ord.Count; j++)
            {
                int w = ord[j];
                bool same = true;
                foreach (var p in memo[v])
                {
                    same &= memo[w].ContainsKey(p.Key) && memo[w][p.Key] == p.Value;
                }
                if (!same) break;
                cx += nr.ContainsKey(v) ? nr[v] : 0;
                cy += mr.ContainsKey(v) ? mr[v] : 0;
            }
            i = j - 1;
            if (cx != cy)
            {
                ans = cx < cy;
                break;
            }
        }
        Yn(ans);
    }

    List<int> CalcO(int n)
    {
        var ret = new List<int>();
        if (n <= 2)
        {
            for (int i = 0; i <= n; i++) ret.Add(i);
            return ret;
        }

        int log = Convert.ToString(n, 2).Length - 1;

        var ord = CalcO(log);
        ord.Reverse();

        for (int i = 0; i <= n; i++) ret.Add(i);
        ret.Sort((x, y) =>
        {
            for (int i = 0; i < ord.Count; i++)
            {
                int v = ord[i];
                int cx = memo[x].ContainsKey(v) ? memo[x][v] : 0;
                int cy = memo[y].ContainsKey(v) ? memo[y][v] : 0;
                if (cx != cy) return cx - cy;
            }
            return 0;
        });

        return ret;
    }

    Dictionary<int, int> CalcS(string n)
    {
        var r = new Dictionary<int, int>();
        int x = n.Length - 1;
        while (true)
        {
            int y = x;
            while (y >= 0 && n[y] == '0') y--;
            int k = x - y;
            if (r.ContainsKey(k)) r[k]++;
            else r.Add(k, 1);
            x = y - 1;
            if (x < 0) break;
        }
        return r;
    }

    Dictionary<int, int> CalcN(int n)
    {
        var r = new Dictionary<int, int>();
        while (n > 0)
        {
            int k = 0;
            while (n % 2 == 0) { k++; n /= 2; }
            if (r.ContainsKey(k)) r[k]++;
            else r.Add(k, 1);
            n /= 2;
        }
        return r;
    }

    const long INF = 1L << 60;
    int ri { [MethodImpl(256)] get => (int)sc.Integer(); }
    long rl { [MethodImpl(256)] get => sc.Integer(); }
    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(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 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 long Gcd(long a, long b) => b == 0 ? a : Gcd(b, a % b);
    [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; }
    public static int LowerBound(long[] arr, long val, int l = -1, int r = -1) => LowerBound<long>(arr.AsSpan(), t => Sign(t - val), l, r);
    public static int LowerBound(int[] arr, int val, int l = -1, int r = -1) => LowerBound<int>(arr.AsSpan(), t => t - val, l, r);
    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;
    }
    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    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(MethodImplOptions.AggressiveInlining)]
    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 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)
    {
        int sz1 = a.GetLength(0);
        int sz2 = a.GetLength(1);
        for (int i = 0; i < sz1; i++)
        {
            var b = new T[sz2];
            for (int j = 0; j < sz2; j++) b[j] = a[i, j];
            WriteJoin(" ", b);
        }
    }
    [MethodImpl(256)] public static void WriteMat<T>(T[][] a) { for (int i = 0; i < a.Length; i++) WriteJoin(" ", a[i]); }
    [MethodImpl(256)] public static void Write(object t) => Console.WriteLine(t.ToString());
    [MethodImpl(256)] public static void Write(string str) => Console.WriteLine(str);
    [MethodImpl(256)] public static void Write(string str, object arg1) => Console.WriteLine(str, arg1);
    [MethodImpl(256)] public static void Write(string str, object arg1, object arg2) => Console.WriteLine(str, arg1, arg2);
    [MethodImpl(256)] public static void Write(string str, object arg1, object arg2, object arg3) => Console.WriteLine(str, arg1, arg2, arg3);
    [MethodImpl(256)] public static void Write(string str, params object[] arg) => Console.WriteLine(str, arg);
    [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");
}
0