oj.uz

Submission #350137

# Submission time Handle Problem Language Result Execution time Memory
350137 2021-01-19T02:40:53 Z Celloboy A Huge Tower (CEOI10_tower) Java 11
25 / 100
 731 ms 45868 KB 
import java.io.*;
import java.util.*;
public class tower {
	static long MOD = (long)1e9+9;
	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.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 8552 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 71 ms 8556 KB Output is correct

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 70 ms 8484 KB Output isn't correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 8612 KB Output is correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 73 ms 8500 KB Output isn't correct

Subtask #6
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 73 ms 8472 KB Output isn't correct

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 75 ms 8568 KB Output isn't correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 8516 KB Output isn't correct

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 80 ms 8552 KB Output isn't correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 74 ms 8788 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 70 ms 8536 KB Output is correct

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 75 ms 8556 KB Output isn't correct

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 73 ms 8516 KB Output isn't correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 75 ms 8408 KB Output isn't correct

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 106 ms 9556 KB Output isn't correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 286 ms 17288 KB Output isn't correct

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 361 ms 19408 KB Output isn't correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 731 ms 23876 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 591 ms 33524 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 660 ms 45868 KB Output isn't correct
2 Halted 0 ms 0 KB -