oj.uz

Submission #1045408

# Submission time Handle Problem Language Result Execution time Memory
1045408 2024-08-05T23:33:01 Z bluecornbot A Huge Tower (CEOI10_tower) C++14
100 / 100
 147 ms 2652 KB 
#include <iostream>
#include <fstream>
#include <string>
#include <bits/stdc++.h>

using namespace std;

	// ofstream fout ("split.out");
	// ifstream fin ("split.in");


	
	
	



int main(){
	
	int n,d;
	cin>>n>>d;
	int array[n];
	long long product=1;
	for(int i=0;i<n;i++){
		cin>>array[i];
	}
	int j=0;
	sort(array,array+n);
	for(int i=0;i<n;i++){
		while(j<i&&array[j]+d<array[i]){
			j++;
		}
		int dist=i-j+1;
		product=(product*dist)%1000000009;
	}
	// for(int i=n-1;i>=0;i--){
	// 	int j=i-1;
	// 	while(array[i]<=d+array[j]){
	// 		j--;
	// 	}
	// 	product=product*(i-j)%1000000009;
	// }
	// cout<<product;




	// long long product=1;

	// for(int i=0;i<n;i++){
	// 	cout<<barray[i]<<endl;
	// }
	// for(int i=0;i<n;i++){
	// 	product*=(barray[i]+1);
	// }

	cout<<product;

	return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 348 KB Output is correct

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 0 ms 344 KB Output is correct

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 344 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 14 ms 604 KB Output is correct
2 Correct 15 ms 604 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 73 ms 1616 KB Output is correct
2 Correct 73 ms 1368 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 145 ms 2652 KB Output is correct
2 Correct 147 ms 2648 KB Output is correct