제출 #350132

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
350132		Celloboy	A Huge Tower (CEOI10_tower)	Java	25 / 100	731 ms	51780 KiB

tower

import java.io.*;
import java.util.*;
public class tower {
	static long MOD = (long)1e9+7;
	public static void main(String[] args) throws IOException{
		// TODO Auto-generated method stub
		BufferedReader br = new BufferedReader(new InputStreamReader(System.in));
		StringTokenizer st = new StringTokenizer(br.readLine());
		int N = Integer.parseInt(st.nextToken()), K = Integer.parseInt(st.nextToken());
		int arr[] = new int[N]; st = new StringTokenizer(br.readLine());
		for(int i = 0; i < N; i++) {
			arr[i] = Integer.parseInt(st.nextToken());
		}
		int fact[] = new int[N+1]; fact[0]=1;
		for(int i = 1; i <= N; i++) {
			fact[i] = mult(fact[i-1],i);
		}
		Arrays.sort(arr);
		int right = 0;
		int ans = 1;
		for(int left = 0; left < N; ++left) {
			int s = 0;
			while(right< N && arr[left]+ K >= arr[right]) {++right; ++s;}
			if(s==0) continue;
			ans = mult(fact[right-left],ans);
			//System.out.println(right+" " + left);
		}
		System.out.println(ans);
	}/*
	private static int add(int a, int b) {
		// TODO Auto-generated method stub
		return (int) (a+b>=MOD ? a+b-MOD:a+b);
	}*/
	private static int mult(int a, int b) {
		// TODO Auto-generated method stub
		return (int)((long)(a*b)%MOD);
	}

}

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