結果

問題 No.911 ラッキーソート
ユーザー claw88
提出日時 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
このコードへのチャレンジ
(要ログイン)
ファイルパターン 結果
sample AC * 3
other AC * 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;
//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);
}
הההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההההה
XXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXXX
0