結果

問題 No.911 ラッキーソート
ユーザー claw88
提出日時 2019-10-18 23:34:35
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 6,855 bytes
コンパイル時間 3,125 ms
コンパイル使用メモリ 111,232 KB
実行使用メモリ 59,012 KB
最終ジャッジ日時 2024-06-25 19:56:27
合計ジャッジ時間 9,981 ms
ジャッジサーバーID
（参考情報） 		judge2 / judge5
このコードへのチャレンジ
（要ログイン）
ファイルパターン 結果
sample WA * 3
other WA * 46
権限があれば一括ダウンロードができます
コンパイルメッセージ
Microsoft (R) Visual C# Compiler version 3.9.0-6.21124.20 (db94f4cc)
Copyright (C) Microsoft Corporation. All rights reserved.

ソースコード

diff # 

using System;
using System.Collections.Generic;
using System.Linq;
using System.IO;
using SB = System.Text.StringBuilder;
//using System.Threading.Tasks;
//using System.Text.RegularExpressions;
//using System.Globalization;
//using System.Diagnostics;
using static System.Console;
using System.Numerics;
using static System.Math;
using pair = Pair<int, int>;

class Program
{
    static void Main()
    {
        //SetOut(new StreamWriter(OpenStandardOutput()) { AutoFlush = false });
        new Program().solve();
        Out.Flush();
    }
    readonly Scanner cin = new Scanner();
    readonly int[] dd = { 0, 1, 0, -1, 0 }; //→↓←↑
    readonly int mod = 1000000007;
    readonly int dom = 998244353;
    bool chmax<T>(ref T a, T b) where T : IComparable<T> { if (a.CompareTo(b) < 0) { a = b; return true; } return false; }
    bool chmin<T>(ref T a, T b) where T : IComparable<T> { if (b.CompareTo(a) < 0) { a = b; return true; } return false; }


    long calc(long L, long[] A)
    {

        var S = Convert.ToString(L, 2);
        int N = S.Length;
        long ret = 0;

        WriteLine(S);

        //iビット目に初めて小さくなる (S[i]==1)
        for (int i = 0; i < N; i++)
        {
            if (S[i] == '0') continue;

            //自由なビット個数
            int M = N - (i + 1);

            //ベースとなるX
            var X = (L ^ (1L << M)) >> M << M;

            var C = new long[A.Length];
            Array.Copy(A, C, A.Length);
            bool flag = true;
            for (int j = 0; j < C.Length; j++)
            {
                C[j] ^= X;

                if (j > 0 && (C[j - 1] >> M) > (C[j] >> M))
                {
                    flag = false;
                    break;
                }
            }
            if (!flag)
            {
                continue;
            }

            //jbit目を決める
            var ans = new int[N];
            //0 0通り,1 1とする 2 0とする 3 どちらでも
            for (int j = 0; j < N; j++)
            {
                if (j <= i) ans[j] = 1;
                else ans[j] = 3;
            }

            dfs(0, A.Length, ans, C, i + 1);
            long sum = 1;
            for (int j = 0; j < N; j++)
            {
                if (ans[j] == 3)
                {
                    sum *= 2;
                }
                else if (ans[j] == 0)
                {
                    sum = 0;
                    break;
                }
            }
            ret += sum;
            //WriteLine(ret + " " + i);
        }
        //x=Lのときも試す
        var D = new long[A.Length];
        Array.Copy(A, D, A.Length);
        int add = 1;
        for (int j = 0; j < D.Length; j++)
        {
            D[j] ^= L;

            if (j > 0 && D[j - 1] >= D[j])
            {
                add = 0;
                break;
            }
        }
        ret += add;
        return ret;
    }
    void dfs(int s, int t, int[] ans, long[] C, int depth)
    {
        if (depth == ans.Length && t - s >= 2)
        {
            ans[0] = 0;
        }
        if (t - s <= 1 || depth == ans.Length || ans[depth] == 0) return;
        int K = ans.Length - (depth + 1);
        int before = -1;
        int bad = -1;
        var L = new List<int>();
        for (int i = s; i < t; i++)
        {
            int x = (int)(C[i] >> K & 1);
            if (x != before)
            {
                L.Add(x);
                before = x;
                bad = i;
            }
        }
        if (L.Count > 2)
        {
            ans[depth] = 0;
            return;
        }

        if (L.Count == 1)
        {
            dfs(s, t, ans, C, depth + 1);
        }
        else if (L[0] == 0)
        {
            if (ans[depth] == 1)
            {
                ans[depth] = 0;
                return;
            }
            ans[depth] = 2;
            dfs(s, bad, ans, C, depth + 1);
            dfs(bad, t, ans, C, depth + 1);
        }
        else if (L[0] == 1)
        {
            if (ans[depth] == 2)
            {
                ans[depth] = 0;
                return;
            }
            ans[depth] = 1;
            dfs(s, bad, ans, C, depth + 1);
            dfs(bad, t, ans, C, depth + 1);
        }
    }


    void solve()
    {
        int N = cin.nextint;
        var L = cin.nextlong;
        var R = cin.nextlong;
        var A = cin.scanlong;

        var p = calc(R, A);
        var q = 0L;
        if (L > 0)
        {
            q = calc(L - 1, A);
        }
        WriteLine(p + " " + q);
        WriteLine(p - q);
    }

}


static class Ex
{
    public static void join<T>(this IEnumerable<T> values, string sep = " ") => WriteLine(string.Join(sep, values));
    public static string concat<T>(this IEnumerable<T> values) => string.Concat(values);
    public static string reverse(this string s) { var t = s.ToCharArray(); Array.Reverse(t); return t.concat(); }

    public static int lower_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) < 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
    public static int upper_bound<T>(this IList<T> arr, T val) where T : IComparable<T>
    {
        int low = 0, high = arr.Count;
        int mid;
        while (low < high)
        {
            mid = ((high - low) >> 1) + low;
            if (arr[mid].CompareTo(val) <= 0) low = mid + 1;
            else high = mid;
        }
        return low;
    }
}

class Pair<T, U> : IComparable<Pair<T, U>> where T : IComparable<T> where U : IComparable<U>
{
    public T f; public U s;
    public Pair(T f, U s) { this.f = f; this.s = s; }
    public int CompareTo(Pair<T, U> a) => f.CompareTo(a.f) != 0 ? f.CompareTo(a.f) : s.CompareTo(a.s);
    public override string ToString() => $"{f} {s}";
}

class Scanner
{
    string[] s; int i;
    readonly char[] cs = new char[] { ' ' };
    public Scanner() { s = new string[0]; i = 0; }
    public string[] scan => ReadLine().Split();
    public int[] scanint => Array.ConvertAll(scan, int.Parse);
    public long[] scanlong => Array.ConvertAll(scan, long.Parse);
    public double[] scandouble => Array.ConvertAll(scan, double.Parse);
    public string next
    {
        get
        {
            if (i < s.Length) return s[i++];
            string st = ReadLine();
            while (st == "") st = ReadLine();
            s = st.Split(cs, StringSplitOptions.RemoveEmptyEntries);
            i = 0;
            return next;
        }
    }
    public int nextint => int.Parse(next);
    public long nextlong => long.Parse(next);
    public double nextdouble => double.Parse(next);
}
0