結果

問題 No.3 ビットすごろく
ユーザー clocklnclockln
提出日時 2020-06-19 16:41:04
言語 C#(csc)
(csc 3.9.0)
結果
WA  
実行時間 -
コード長 4,204 bytes
コンパイル時間 797 ms
コンパイル使用メモリ 107,008 KB
実行使用メモリ 17,920 KB
最終ジャッジ日時 2024-07-03 13:28:23
合計ジャッジ時間 2,311 ms
ジャッジサーバーID
（参考情報） 		judge3 / judge4
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 19 ms
17,536 KB
testcase_01 AC 20 ms
17,792 KB
testcase_02 AC 20 ms
17,920 KB
testcase_03 AC 20 ms
17,792 KB
testcase_04 WA -
testcase_05 AC 21 ms
17,920 KB
testcase_06 AC 21 ms
17,664 KB
testcase_07 WA -
testcase_08 WA -
testcase_09 WA -
testcase_10 WA -
testcase_11 WA -
testcase_12 AC 21 ms
17,664 KB
testcase_13 AC 21 ms
17,792 KB
testcase_14 AC 21 ms
17,408 KB
testcase_15 AC 23 ms
17,408 KB
testcase_16 WA -
testcase_17 WA -
testcase_18 WA -
testcase_19 WA -
testcase_20 WA -
testcase_21 AC 20 ms
17,792 KB
testcase_22 AC 21 ms
17,792 KB
testcase_23 AC 20 ms
17,792 KB
testcase_24 WA -
testcase_25 WA -
testcase_26 AC 18 ms
17,536 KB
testcase_27 WA -
testcase_28 WA -
testcase_29 WA -
testcase_30 WA -
testcase_31 WA -
testcase_32 WA -
権限があれば一括ダウンロードができます
コンパイルメッセージ
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.Linq;
using System.IO;
using static System.Console;
using static System.Math;
 
public class Solve{
    static public int mod = 1000000007;
    static public string al = "abcdefghijklmnopqrstuvwxyz";
    public static void Main(){
        // 方針
        //
        var n = rint();
        var move = new int[n+1];
        for(int i=1;i<=n;i++){
            var temp = i;
            while(temp > 0){
                if(temp %2 == 1)move[i]++;
                temp/=2;
            }
        }
        var queue = new Queue<int>();
        var length = new int[n+1];
        for(int i=2;i<=n;i++){
            length[i] = -1;
        }
        length[1] = 1;
        var passed = new bool[n+1];
        
        queue.Enqueue(1);
        while(queue.Count > 0){
            var de = queue.Dequeue();
            //WriteLine(de);
            if(passed[de]) continue;
            passed[de] = true;
            
            if(de+move[de] <= n){
                length[de+move[de]] = length[de]+1;
                queue.Enqueue(de+move[de]);
            }
            if(de-move[de] > 0){
                length[de-move[de]] = length[de]+1;
                queue.Enqueue(de-move[de]);
            }
        }
        WriteLine(length[n]);
        
	
    }
    public static void swap(ref int a,ref int b){int temp = a;a= b;b = temp;}
    static void charswap(ref char a,ref char b){char temp = a;a= b;b = temp;}
    static int ncr(int n,int r){if(n<r)return 0;r = Min(r,n-r);long nn = 1;for(int i=n-r+1;i<=n;i++){nn = nn*i%mod;}long rr = 1;for(int i=1;i<=r;i++){rr = rr*i%mod;}rr = square((int)rr,mod-2);nn = nn * rr %mod;return (int)nn;}
    // a^b mod
    static int square(int a,int b){string binary = Convert.ToString(b,2);int bileng = binary.Length;long a_power = a;long value = 1;for(int i=bileng-1;i>=0;i--){if(binary[i] == '1'){value = value*a_power%mod;}a_power = a_power*a_power%mod;}return (int)value;}
    static int square2(int a,int b){long output = 1;var list = new List<long>();int sh = 1;long n = a;list.Add(a);while(sh < b){sh *= 2;n = n*n%mod;list.Add(n);}for(int i=list.Count-1;i>=0;i--){if(b > sh){b -= sh;sh /= 2;output = output*list[i]%mod;}}return (int)output;}
    //各種読取
    static string rstr(){ return ReadLine(); }
    static int rint(){ return int.Parse(ReadLine()); }
    static long rlong(){ return long.Parse(ReadLine()); }
    static string[] stra(){ return ReadLine().Split(' '); }
    static char[] chara(){ string[] a=stra();string b="";for(int i=0;i<a.Length;i++){b+=a[i];}return b.ToCharArray();}
    static int[] inta(){ string[] read_str_array = ReadLine().Split(' '); int[] return_int_array = new int[read_str_array.Length]; for(int countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_int_array[countup_i] = int.Parse(read_str_array[countup_i]); } return return_int_array; }
    static int[,] inta2(int num_array,int in_array){ int[,] int_array2 = new int[num_array,in_array]; for(int i=0;i<num_array;i++){ int[] temp_array = inta(); for(int j=0;j<in_array;j++){ int_array2[i,j] = temp_array[j]; } } return int_array2; }
    static long[] longa(){ string[] read_str_array = ReadLine().Split(' '); long[] return_long_array = new long[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_long_array[countup_i] = long.Parse(read_str_array[countup_i]); } return return_long_array; }
    static double[] doublea(){ string[] read_str_array = ReadLine().Split(' '); double[] return_double_array = new double[read_str_array.Length]; for(long countup_i=0;countup_i<read_str_array.Length;countup_i++){ return_double_array[countup_i] = double.Parse(read_str_array[countup_i]); } return return_double_array; }
    // -----------------------------
    static long GCD(long a,long b){ if(a < b){ long temp = a; a = b; b = temp; } if(a % b == 0){ return b; } else{ long temp = b; b = a%b; a = temp; return GCD(a,b); } }
    static long LCM(long a,long b){ return a * b / GCD(a,b); }
    static void WriteArray(int[,] a,int b,int c){for(int i=0;i<b;i++){for(int j=0;j<c;j++){if(j!=0) Write(" ");Write(a[i,j]);}WriteLine();}}
}
0