#889694 (Java21) No.1110 好きな歌

• 問題: No.1110 好きな歌
• ユーザー: Asahi
• 提出日時: 2023-07-11 03:17:54
• 言語: Java21 (openjdk 21)
• 結果: AC
• 実行時間: 445 ms / 5,000 ms
• コード長: 9,549 bytes
• コンパイル時間: 3,894 ms
• コンパイル使用メモリ: 83,452 KB
• 実行使用メモリ: 58,628 KB
• 最終ジャッジ日時: 2023-10-10 01:32:01
• 合計ジャッジ時間: 20,554 ms
• ジャッジサーバーID （参考情報）: judge12 / judge11

入力	結果	実行時間; 実行使用メモリ
testcase_00	AC	44 ms; 49,696 KB
testcase_01	AC	44 ms; 49,384 KB
testcase_02	AC	44 ms; 49,628 KB
testcase_03	AC	44 ms; 49,788 KB
testcase_04	AC	44 ms; 49,524 KB
testcase_05	AC	43 ms; 47,680 KB
testcase_06	AC	44 ms; 49,528 KB
testcase_07	AC	43 ms; 49,480 KB
testcase_08	AC	44 ms; 49,620 KB
testcase_09	AC	44 ms; 49,476 KB
testcase_10	AC	43 ms; 49,592 KB
testcase_11	AC	43 ms; 49,664 KB
testcase_12	AC	42 ms; 49,432 KB
testcase_13	AC	43 ms; 49,680 KB
testcase_14	AC	49 ms; 49,660 KB
testcase_15	AC	46 ms; 49,744 KB
testcase_16	AC	48 ms; 49,688 KB
testcase_17	AC	57 ms; 49,828 KB
testcase_18	AC	44 ms; 49,460 KB
testcase_19	AC	53 ms; 49,664 KB
testcase_20	AC	54 ms; 50,264 KB
testcase_21	AC	47 ms; 49,452 KB
testcase_22	AC	51 ms; 50,172 KB
testcase_23	AC	43 ms; 49,596 KB
testcase_24	AC	295 ms; 56,252 KB
testcase_25	AC	324 ms; 57,208 KB
testcase_26	AC	256 ms; 56,396 KB
testcase_27	AC	324 ms; 56,484 KB
testcase_28	AC	248 ms; 56,320 KB
testcase_29	AC	379 ms; 57,588 KB
testcase_30	AC	231 ms; 56,004 KB
testcase_31	AC	193 ms; 53,720 KB
testcase_32	AC	431 ms; 56,492 KB
testcase_33	AC	242 ms; 56,244 KB
testcase_34	AC	322 ms; 58,460 KB
testcase_35	AC	376 ms; 56,068 KB
testcase_36	AC	136 ms; 53,552 KB
testcase_37	AC	213 ms; 55,864 KB
testcase_38	AC	349 ms; 56,724 KB
testcase_39	AC	301 ms; 56,664 KB
testcase_40	AC	310 ms; 57,364 KB
testcase_41	AC	125 ms; 52,560 KB
testcase_42	AC	357 ms; 56,648 KB
testcase_43	AC	355 ms; 56,144 KB
testcase_44	AC	365 ms; 56,196 KB
testcase_45	AC	402 ms; 56,668 KB
testcase_46	AC	398 ms; 56,352 KB
testcase_47	AC	445 ms; 57,776 KB
testcase_48	AC	439 ms; 56,820 KB
testcase_49	AC	369 ms; 56,756 KB
testcase_50	AC	399 ms; 55,008 KB
testcase_51	AC	352 ms; 56,516 KB
testcase_52	AC	396 ms; 57,296 KB
testcase_53	AC	440 ms; 58,628 KB

ソースコード

import java.util.*; 
import java.io.*; 
import java.math.*;

class Main{
    void solve() {
        int n = in.nextInt() , D = in.nextInt();
        int [] A = in.IntArray(n);
        int [] sorted = new int[n];
        System.arraycopy(A, 0 , sorted, 0 , n);
        Arrays.sort(sorted);
        for(int i = 0 ; i < n ; i ++ ) {
            int A_j = A[i] - D ;
            out.println(upper_bound(sorted,A_j));
        }
    }
    int upper_bound(int [] A , int key) {
        int left = 0;
        int right = A.length;
        while(left < right) {
            int mid = (left + right) / 2;
            if(A[mid] <= key) left = mid + 1;
            else right = mid;
        }
        return right;
    }
    long gcd(long a, long b) { return b == 0 ? a: gcd(b, a % b); }
    long lcm(long a, long b) { return a / gcd(a, b) * b; }
    public static void main(String[] args) {
        new Main().solve();
        out.flush();
    }
    static PrintWriter out = new PrintWriter(System.out);
    static In in  = new In();
    static final long MOD7 = 1000000007;
    static final long MOD9 = 998244353 ;
    static final int  inf = (1 << 30);
    static final long lnf = (1L << 60);
    final String yes = "Yes";
    final String no  = "No" ;
    List<Pair<Integer,Integer>> dir4 = new ArrayList<>() {{
        add(new Pair<>(0,-1));
        add(new Pair<>(1,0));
        add(new Pair<>(0,1));
        add(new Pair<>(-1,0));
    }};
    List<Pair<Integer,Integer>> dir8 = new ArrayList<>() {{
        add(new Pair<>(-1,0));
        add(new Pair<>(-1,1));
        add(new Pair<>(0,1));
        add(new Pair<>(1,1));
        add(new Pair<>(1,0));
        add(new Pair<>(1,-1));
        add(new Pair<>(0,-1));
        add(new Pair<>(-1,-1));
    }};
}
class Permutation {

    private int [] perm ;
    private int [] tmp  ;
    private int [] used ;
    private int size = 0;
    private int len  = 1;
    private int cur = 0;
    private ArrayList<int []> perm_list ;

    public Permutation(int n) {
        this.perm_list = new ArrayList<int []>();
        this.perm = new int[n];
        this.tmp  = new int[n];
        this.used = new int[n];
        len  = 1;
        size = n ;
        for(int i = 0 ; i < n ; i ++ ) perm[i] = i ;
        for(int i = n ; i > 0 ; i -- ) len *= i;
        for(int i = 0 ; i < len ; i ++ ) perm_list.add(new int[n]);
    }   
    public ArrayList<int []> getList() {
        next_permutation(0);
        return perm_list;
    }
    private void next_permutation(int idx){
        if(idx == size) {
            for(int i = 0 ; i < size ; i ++ ) {
                perm_list.get(cur)[i] = tmp[i];
            }
            cur++;
            return;
        }
        for(int i=0;i<size;i++) {
            if(used[i] == 1) continue;
            used[i] = 1;
            tmp[idx] = perm[i];
            next_permutation(idx+1);
            used[i] = 0;
        }
    }
}
class Pair<T extends Comparable<T>, U extends Comparable<U>> implements Comparable<Pair<T, U>> {
    private final T first;
    private final U second;

    Pair(T first, U second) {
        this.first = first;
        this.second = second;
    }

    T getFirst() {
        return first;
    }

    U getSecond() {
        return second;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Pair<?, ?> pair = (Pair<?, ?>) o;
        return Objects.equals(first, pair.first) &&
                Objects.equals(second, pair.second);
    }

    @Override
    public int hashCode() {
        return Objects.hash(first, second);
    }

    @Override
    public int compareTo(Pair<T, U> other) {
        T small_First  = this.first  , large_First  = other.first;
        U small_Second = this.second , large_Second = other.second;
        int First_Result  = small_First.compareTo(large_First);
        int Second_Result = small_Second.compareTo(large_Second);
        return First_Result == 0 ? Second_Result : First_Result ;
    }

    @Override
    public String toString() {
        return this.first+" "+this.second;
    }
}
class Triple<T extends Comparable<T>, U extends Comparable<U>, V extends Comparable<V>> implements Comparable<Triple<T, U, V>> {
    private final T first;
    private final U second;
    private final V third;

    Triple(T first, U second, V third) {
        this.first = first;
        this.second = second;
        this.third = third;
    }

    T getFirst() {
        return first;
    }

    U getSecond() {
        return second;
    }

    V getThird() {
        return third;
    }

    @Override
    public boolean equals(Object o) {
        if (this == o) return true;
        if (o == null || getClass() != o.getClass()) return false;
        Triple<?, ?, ?> triple = (Triple<?, ?, ?>) o;
        return Objects.equals(first, triple.first) &&
                Objects.equals(second, triple.second) &&
                Objects.equals(third, triple.third);
    }

    @Override
    public int hashCode() {
        return Objects.hash(first, second, third);
    }

    @Override
    public int compareTo(Triple<T, U, V> other) {
        T small_First  = this.first  , large_First  = other.first;
        U small_Second = this.second , large_Second = other.second;
        V small_Third  = this.third  , large_Third  = other.third;
        int First_Result  = small_First.compareTo(large_First);
        int Second_Result = small_Second.compareTo(large_Second);
        int Third_Result  = small_Third.compareTo(large_Third);
        return First_Result == 0 ? (Second_Result == 0 ? Third_Result : Second_Result ) : First_Result;
    }
}
class In{
    private final InputStream in = System.in;
    private final byte[] buffer = new byte[1024];
    private int ptr = 0;
    private int buflen = 0;
    private boolean hasNextByte() {
        if (ptr < buflen) {
            return true;
        }else{
            ptr = 0;
            try {
                buflen = in.read(buffer);
            } catch (IOException e) {
                e.printStackTrace();
            }
            if (buflen <= 0) {
                return false;
            }
        }
        return true;
    }
    private int readByte() { 
        if (hasNextByte()) return buffer[ptr++]; else return -1;
    }
    private static boolean isPrintableChar(int c) { 
        return 33 <= c && c <= 126;
    }
    public boolean hasNext() { 
        while(hasNextByte() && !isPrintableChar(buffer[ptr])) {
            ptr++; 
        }
        return hasNextByte();
    }
    String next() {
        if (!hasNext()) throw new NoSuchElementException();
        StringBuilder sb = new StringBuilder();
        int b = readByte();
        while(isPrintableChar(b)) {
            sb.appendCodePoint(b);
            b = readByte();
        }
        return sb.toString();
    }

    long nextLong() {
        if (!hasNext()) throw new NoSuchElementException();
        long n = 0;
        boolean minus = false;
        int b = readByte();
        if (b == '-') {
            minus = true;
            b = readByte();
        }
        if (b < '0' || '9' < b) {
            throw new NumberFormatException();
        }
        while(true){
            if ('0' <= b && b <= '9') {
                n *= 10;
                n += b - '0';
            }else if(b == -1 || !isPrintableChar(b)){
                return minus ? -n : n;
            }else{
                throw new NumberFormatException();
            }
            b = readByte();
        }
    }
    int nextInt() {
        long nl = nextLong();
        if (nl < Integer.MIN_VALUE || nl > Integer.MAX_VALUE) throw new NumberFormatException();
        return (int) nl;
    }
    double nextDouble() { 
        return Double.parseDouble(next());
    }
    char nextChar() {
        return next().charAt(0);
    }
    int [] IntArray(int n) {
        final int [] Array = new int [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextInt();
        }
        return Array;
    }
    int [][] IntArray(int n , int m) {
        final int [][] Array = new int [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = IntArray(m);
        }
        return Array;
    }   
    long [] LongArray(int n) {
        final long [] Array = new long [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = nextLong();
        }
        return Array;
    }
    long [][] LongArray(int n , int m) {
        final long [][] Array = new long [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = LongArray(m);
        }
        return Array;
    }
    String [] StringArray(int n) {
        final String [] Array = new String [n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next();
        }
        return Array;
    }
    char [] CharArray(int n) {
        final char [] Array = new char[n];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().charAt(0);
        }
        return Array;
    }
    char [][] CharArray(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            Array[i] = next().toCharArray();
        }
        return Array;
    }
    char [][] CharArray2(int n , int m) {
        final char [][] Array = new char [n][m];
        for(int i = 0 ; i < n ; i ++ ) {
            for(int j = 0 ; j < n ; j ++ ) {
                Array[i][j] = next().charAt(0);
            }
        }
        return Array;
    }
}