Submission #542301

#	Time	Username	Problem	Language	Result	Execution time	Memory
542301		RishabhPrabhu	A Huge Tower (CEOI10_tower)	Java	95 / 100	1073 ms	24620 KiB

tower

import java.util.Scanner;
import java.util.Arrays;
public class tower {
    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int d = in.nextInt();
        int[] b = new int[n];
        for(int i = 0; i < n; i++) {
            b[i] = in.nextInt();
        }
        Arrays.sort(b);
        long ans = 1;
        int lowerP = 0;
        for(int i = 1; i < n; i++) {
            while(b[lowerP] < b[i]-d) {
                lowerP++;
            }
            ans *= (i - lowerP + 1);
            ans %= 1000000009;
        }
        System.out.println(ans);
    }
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 0 / 5