結果

問題 No.1110 好きな歌
ユーザー clocklnclockln
提出日時 2020-07-19 08:22:25
言語 C#(csc)
(csc 3.9.0)
結果
AC  
実行時間 1,063 ms / 5,000 ms
コード長 4,105 bytes
コンパイル時間 1,195 ms
コンパイル使用メモリ 55,740 KB
実行使用メモリ 20,112 KB
最終ジャッジ日時 2023-08-22 09:44:59
合計ジャッジ時間 33,721 ms
ジャッジサーバーID
（参考情報） 		judge13 / judge12
このコードへのチャレンジ
（要ログイン）

テストケース

テストケース表示
入力 結果 実行時間
実行使用メモリ
testcase_00 AC 58 ms
14,724 KB
testcase_01 AC 57 ms
14,768 KB
testcase_02 AC 59 ms
14,596 KB
testcase_03 AC 57 ms
14,616 KB
testcase_04 AC 56 ms
14,532 KB
testcase_05 AC 56 ms
14,732 KB
testcase_06 AC 56 ms
14,732 KB
testcase_07 AC 56 ms
14,780 KB
testcase_08 AC 57 ms
14,700 KB
testcase_09 AC 56 ms
14,572 KB
testcase_10 AC 57 ms
14,600 KB
testcase_11 AC 57 ms
14,528 KB
testcase_12 AC 57 ms
14,808 KB
testcase_13 AC 57 ms
14,816 KB
testcase_14 AC 60 ms
14,804 KB
testcase_15 AC 60 ms
14,776 KB
testcase_16 AC 60 ms
14,760 KB
testcase_17 AC 63 ms
14,632 KB
testcase_18 AC 57 ms
14,844 KB
testcase_19 AC 63 ms
14,848 KB
testcase_20 AC 62 ms
14,780 KB
testcase_21 AC 61 ms
14,716 KB
testcase_22 AC 64 ms
14,756 KB
testcase_23 AC 60 ms
14,760 KB
testcase_24 AC 638 ms
19,288 KB
testcase_25 AC 764 ms
19,460 KB
testcase_26 AC 428 ms
18,836 KB
testcase_27 AC 753 ms
19,416 KB
testcase_28 AC 462 ms
19,040 KB
testcase_29 AC 884 ms
19,664 KB
testcase_30 AC 451 ms
18,920 KB
testcase_31 AC 300 ms
18,320 KB
testcase_32 AC 955 ms
19,836 KB
testcase_33 AC 503 ms
19,272 KB
testcase_34 AC 668 ms
19,252 KB
testcase_35 AC 1,014 ms
19,892 KB
testcase_36 AC 161 ms
16,156 KB
testcase_37 AC 334 ms
18,748 KB
testcase_38 AC 865 ms
19,660 KB
testcase_39 AC 656 ms
19,460 KB
testcase_40 AC 802 ms
19,764 KB
testcase_41 AC 115 ms
15,424 KB
testcase_42 AC 912 ms
19,656 KB
testcase_43 AC 864 ms
19,664 KB
testcase_44 AC 1,011 ms
20,092 KB
testcase_45 AC 1,041 ms
19,808 KB
testcase_46 AC 1,032 ms
19,992 KB
testcase_47 AC 1,063 ms
19,888 KB
testcase_48 AC 1,026 ms
19,948 KB
testcase_49 AC 1,008 ms
19,928 KB
testcase_50 AC 1,028 ms
19,928 KB
testcase_51 AC 1,019 ms
20,112 KB
testcase_52 AC 1,038 ms
19,924 KB
testcase_53 AC 1,058 ms
20,096 KB
権限があれば一括ダウンロードができます

ソースコード

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(){
        // •ûj
        //
        var tn = inta();
        var n = tn[0];
        var d = tn[1];
        var q = new int[n];
        var list = new int[n];
        for(int i=0;i<n;i++){
            var t = rint();
            q[i] = t;
            list[i] = t;
        }
        Array.Sort(list);
        //Array.Reverse(list);
        for(int i=0;i<n;i++){
            var like = q[i]-d;
            var l = 0;
            var r = n-1;
            while(r-l > 1){
                var m = (r+l)/2;
                if(list[m] <= like){
                    l = m;
                }else{
                    r = m;
                }
            }
            if(list[r] <= like){
                WriteLine(++r);
            }else if(list[l] <= like){
                WriteLine(++l);
            }else{
                WriteLine(0);
            }
            //WriteLine(n-(r+1));
        }
        
        
        
	
    }
    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;}
    //Šeí“Çæ
    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