Submission #1045390

#	Time	Username	Problem	Language	Result	Execution time	Memory
1045390		bluecornbot	A Huge Tower (CEOI10_tower)	C++14	55 / 100	1067 ms	11264 KiB

tower

#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];
	int barray[n]={0};
	for(int i=0;i<n;i++){
		cin>>array[i];
	}
	sort(array,array+n);
	int pointeri=n-1;
	int pointerj=n-2;
	while(pointerj>=0){
		if(pointerj==0){
			if(pointeri==1){
				if(array[pointerj]+d<array[pointeri]){
					pointerj--;
				}
				else{
					barray[pointeri]++;
					pointerj--;
				}
			}
			else{
				if(array[pointerj]+d<array[pointeri]){
					pointeri--;
					pointerj=pointeri-1;
				}
				else{
					barray[pointeri]++;
					pointeri--;
					pointerj=pointeri-1;
				}
				
			}
		}
		else{
			if(array[pointerj]+d<array[pointeri]){
				pointeri--;
				pointerj=pointeri-1;
			}
			else{
				barray[pointeri]++;
				pointerj--;
			}
		}
	}


	long long product=1;

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

	cout<<product%1000000009;

	return 0;
}

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