結果

問題 No.911 ラッキーソート
ユーザー claw88claw88
提出日時 2019-10-18 23:52:54
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,163 ms / 2,000 ms
コード長 7,783 bytes
コンパイル時間 1,068 ms
コンパイル使用メモリ 111,872 KB
実行使用メモリ 57,288 KB
最終ジャッジ日時 2024-06-25 20:05:34
合計ジャッジ時間 14,072 ms
ジャッジサーバーID
（参考情報） 		judge5 / judge3
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 26 ms
18,176 KB
testcase_01 AC 26 ms
18,048 KB
testcase_02 AC 25 ms
18,304 KB
testcase_03 AC 24 ms
18,048 KB
testcase_04 AC 24 ms
18,176 KB
testcase_05 AC 24 ms
18,048 KB
testcase_06 AC 24 ms
17,920 KB
testcase_07 AC 25 ms
18,176 KB
testcase_08 AC 25 ms
18,176 KB
testcase_09 AC 25 ms
18,304 KB
testcase_10 AC 24 ms
18,176 KB
testcase_11 AC 25 ms
18,048 KB
testcase_12 AC 25 ms
18,304 KB
testcase_13 AC 327 ms
51,836 KB
testcase_14 AC 373 ms
52,136 KB
testcase_15 AC 383 ms
52,016 KB
testcase_16 AC 385 ms
52,512 KB
testcase_17 AC 422 ms
52,704 KB
testcase_18 AC 451 ms
52,008 KB
testcase_19 AC 364 ms
52,176 KB
testcase_20 AC 467 ms
51,692 KB
testcase_21 AC 524 ms
51,740 KB
testcase_22 AC 533 ms
50,948 KB
testcase_23 AC 442 ms
56,328 KB
testcase_24 AC 501 ms
57,288 KB
testcase_25 AC 312 ms
43,104 KB
testcase_26 AC 222 ms
42,844 KB
testcase_27 AC 180 ms
38,016 KB
testcase_28 AC 75 ms
32,896 KB
testcase_29 AC 50 ms
25,600 KB
testcase_30 AC 35 ms
23,040 KB
testcase_31 AC 25 ms
18,688 KB
testcase_32 AC 24 ms
18,176 KB
testcase_33 AC 25 ms
18,304 KB
testcase_34 AC 23 ms
18,304 KB
testcase_35 AC 24 ms
18,304 KB
testcase_36 AC 25 ms
18,176 KB
testcase_37 AC 25 ms
18,048 KB
testcase_38 AC 362 ms
50,840 KB
testcase_39 AC 1,163 ms
51,592 KB
testcase_40 AC 33 ms
19,912 KB
testcase_41 AC 760 ms
52,184 KB
testcase_42 AC 328 ms
43,996 KB
testcase_43 AC 284 ms
52,352 KB
testcase_44 AC 167 ms
49,900 KB
testcase_45 AC 170 ms
50,180 KB
testcase_46 AC 165 ms
48,560 KB
testcase_47 AC 172 ms
52,168 KB
testcase_48 AC 158 ms
45,272 KB
権限があれば一括ダウンロードができます
コンパイルメッセージ
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;
            //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;
            }

            //自由なビット個数
            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;
            int last = 0;
            for (int j = 0; j < C.Length; j++)
            {
                C[j] ^= X;
            }
            for (int j = 1; j < C.Length; j++)
            {
                var a = C[j - 1] >> M;
                var b = C[j] >> M;

                if (a > b)
                {
                    flag = false;
                    break;
                }
                else if (a < b)
                {
                    dfs(last, j, ans, C, i + 1, i);
                    last = j;
                }
                else if (j == C.Length - 1)
                {
                    dfs(last, C.Length, ans, C, i + 1, i);
                }
            }
            if (!flag)
            {
                continue;
            }

            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;
           
        }
        //x=Lのときも試す
        int add = 1;
        for (int j = 1; j < A.Length; j++)
        {
            if ((A[j - 1] ^ L) >= (A[j] ^ L))
            {
                add = 0;
                break;
            }
        }
        ret += add;
        return ret;
    }
    void dfs(int s, int t, int[] ans, long[] C, int depth, int debug)
    {
        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 (debug == 9)
        //{
        //    L.join();
        //}
        if (L.Count > 2)
        {

            ans[depth] = 0;
            return;
        }

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


    void solve()
    {
        int N = cin.nextint;
        var L = cin.nextlong;
        var R = cin.nextlong;
        var A = cin.scanlong;
        //int cnt = 0;
        //for (int i = 0; i <= R; i++)
        //{
        //    bool flag = true;
        //    for (int j = 1; j < N; j++)
        //    {
        //        if ((A[j - 1] ^ i) >= (A[j] ^ i))
        //        {
        //            flag = false;
        //            break;
        //        }
        //    }
        //    if (flag)
        //    {
        //        cnt++;
        //        Write(i + " ");
        //    }
        //}
        //WriteLine();
        //WriteLine(cnt);
        //WriteLine();

        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