제출 #685825

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
685825		bruhgamer	A Huge Tower (CEOI10_tower)	Java	100 / 100	590 ms	55492 KiB

tower

//package USACO;
import java.util.*;
import java.io.*;
public class tower {
	public static void main(String[]args) throws IOException{
		Kattio io = new Kattio();
		int n = io.nextInt();
		int d = io.nextInt();
		int[]arr = new int[n];
		int[]valuesless = new int[n];
		for(int i = 0; i < n; i++) {
			arr[i] = io.nextInt();
		}
		Arrays.sort(arr);
		int j = 0;
		for(int i = 1; i < n; i++) {
			while(arr[i] - arr[j] > d) {
				j++;
			}
			valuesless[i]+=(i - j);
		}
		long[]values = new long[n];
		values[0] = 1;
		for(int i = 1; i < n ; i++) {
			values[i] = (values[i-1] * (valuesless[i] + 1)) % 1000000009L;
		}
		io.println(values[n-1]);
		io.close();
	}
	static class Kattio extends PrintWriter {
		private BufferedReader r;
		private StringTokenizer st;
		// standard input
		public Kattio() { this(System.in, System.out); }
		public Kattio(InputStream i, OutputStream o) {
			super(o);
			r = new BufferedReader(new InputStreamReader(i));
		}
		// USACO-style file input
		public Kattio(String problemName) throws IOException {
			super(problemName + ".out");
			r = new BufferedReader(new FileReader(problemName + ".in"));
		}
		// returns null if no more input
		public String next() {
			try {
				while (st == null || !st.hasMoreTokens())
					st = new StringTokenizer(r.readLine());
				return st.nextToken();
			} catch (Exception e) { }
			return null;
		}
		public int nextInt() { return Integer.parseInt(next()); }
		public double nextDouble() { return Double.parseDouble(next()); }
		public long nextLong() { return Long.parseLong(next()); }
	}
		
}

• 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: 5 / 5