結果

問題 No.1220 yukipoker
ユーザー keymoonkeymoon
提出日時 2020-09-04 22:12:08
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 451 ms / 2,000 ms
コード長 3,508 bytes
コンパイル時間 4,873 ms
コンパイル使用メモリ 108,752 KB
実行使用メモリ 42,320 KB
最終ジャッジ日時 2023-08-17 15:51:36
合計ジャッジ時間 10,942 ms
ジャッジサーバーID
（参考情報） 		judge15 / judge13
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 81 ms
38,172 KB
testcase_01 AC 82 ms
38,200 KB
testcase_02 AC 81 ms
36,280 KB
testcase_03 AC 80 ms
36,192 KB
testcase_04 AC 81 ms
38,320 KB
testcase_05 AC 81 ms
38,236 KB
testcase_06 AC 81 ms
38,220 KB
testcase_07 AC 82 ms
38,320 KB
testcase_08 AC 80 ms
36,288 KB
testcase_09 AC 82 ms
36,196 KB
testcase_10 AC 82 ms
36,232 KB
testcase_11 AC 242 ms
40,312 KB
testcase_12 AC 256 ms
42,320 KB
testcase_13 AC 447 ms
40,228 KB
testcase_14 AC 436 ms
42,280 KB
testcase_15 AC 304 ms
40,208 KB
testcase_16 AC 342 ms
42,272 KB
testcase_17 AC 232 ms
42,256 KB
testcase_18 AC 280 ms
40,212 KB
testcase_19 AC 451 ms
42,264 KB
testcase_20 AC 447 ms
40,392 KB
testcase_21 AC 82 ms
36,188 KB
testcase_22 AC 82 ms
36,380 KB
testcase_23 AC 81 ms
36,124 KB
testcase_24 AC 82 ms
38,384 KB
testcase_25 AC 83 ms
34,128 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;
using System.Collections.Generic;
using System.Diagnostics;
using System.IO;
using System.Linq;
using System.Numerics;
using System.Text;
using System.Text.RegularExpressions;
using System.Threading.Tasks;
using static System.Math;
using MethodImplAttribute = System.Runtime.CompilerServices.MethodImplAttribute;
using MethodImplOptions = System.Runtime.CompilerServices.MethodImplOptions;

public static class P
{
    static double[] logs = Enumerable.Range(0, 100010).Select(x => Log(x)).ToArray();
    static DisjointSparseTable<double> dst = new DisjointSparseTable<double>(logs, (x, y) => x + y);
    public static void Main()
    {
        int q = int.Parse(Console.ReadLine());
        for (int i = 0; i < q; i++)
        {
            Solve();
        }
    }
    static void Solve()
    {
        var nmk = Console.ReadLine().Split().Select(int.Parse).ToArray();
        var n = nmk[0];
        var m = nmk[1];
        var k = nmk[2];
        var logF = logs[m] + dst.Query(k + 1, n) - dst.Query(1, n - k);
        var logS = logs[n - k + 1] + logs[m] * k;
        //Console.WriteLine($"{logF} {logS}");
        //Console.WriteLine($"{Exp(logF)} {Exp(logS)}");
        Console.WriteLine(logF < logS ? "Flush" : "Straight");
    }
}


class DisjointSparseTable<T>
{
    public readonly int Size;
    readonly int Height;
    readonly T[] Table;
    readonly Func<T, T, T> Merge;

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    public DisjointSparseTable(T[] data, Func<T, T, T> merge)
    {
        Size = data.Length;
        Height = MSBPos(Size) + 1;
        Table = new T[Size * Height];
        Merge = merge;
        data.CopyTo(Table, 0);
        for (int layer = 1; layer < Height; layer++)
        {
            int layerOffset = layer * Size;
            int block = 0;
            int i;
            for (; block + 2 <= Size >> layer; block += 2)
            {
                i = layerOffset + ((block | 1) << layer) - 1; Table[i] = Table[i - layerOffset]; i--;
                for (; i >= layerOffset + (block << layer); i--) Table[i] = Merge(Table[i - layerOffset], Table[i + 1]);
                i = layerOffset + ((block | 1) << layer); Table[i] = Table[i - layerOffset]; i++;
                for (; i < layerOffset + ((block + 2) << layer); i++) Table[i] = Merge(Table[i - 1], Table[i - layerOffset]);
            }
            if (((block | 1) << layer) < Size)
            {
                i = layerOffset + ((block | 1) << layer) - 1; Table[i] = Table[i - layerOffset]; i--;
                for (; i >= layerOffset + (block << layer); i--) Table[i] = Merge(Table[i - layerOffset], Table[i + 1]);
                i = layerOffset + ((block | 1) << layer); Table[i] = Table[i - layerOffset]; i++;
                for (; i < layerOffset + Size; i++) Table[i] = Merge(Table[i - 1], Table[i - layerOffset]);
            }
        }
    }

    public T Query(int l, int r)
    {
        if (l > r) return default(T);
        if (l == r) return Table[l];
        var layer = MSBPos(l ^ r);
        return Merge(Table[l + layer * Size], Table[r + layer * Size]);
    }

    [MethodImpl(MethodImplOptions.AggressiveInlining)]
    static int MSBPos(int n)
    {
        int res = 0;
        if (0 != (n >> (res | 16))) res |= 16;
        if (0 != (n >> (res | 8))) res |= 8;
        if (0 != (n >> (res | 4))) res |= 4;
        if (0 != (n >> (res | 2))) res |= 2;
        if (0 != (n >> (res | 1))) res |= 1;
        return res;
    }
}
0