Submission #762684

#	Time	Username	Problem	Language	Result	Execution time	Memory
762684		BlancaHM	A Huge Tower (CEOI10_tower)	C++14	30 / 100	216 ms	7500 KiB

tower

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
typedef long long int ll;

int mod = 1e9+7;

int N, D;
vector<int> tamanosBloques;

int main() {
	cin >> N >> D;
	tamanosBloques = vector<int>(N);
	for (int i = 0; i < N; i++) {
		cin >> tamanosBloques[i];
	}
	sort(tamanosBloques.begin(), tamanosBloques.end());
	int DP[N], posiblesSegundos[N];
	int puntero = N-1;
	for (int i = N-1; i >= 0; i--) {
		while (puntero >= 0 && tamanosBloques[i] <= tamanosBloques[puntero]+D) {
			puntero--;
		}
		posiblesSegundos[i] = i-puntero-1;
	}
	DP[0] = 1;
	for (int i = 1; i < N; i++) {
	    DP[i] = (DP[i-1]*1ll*(posiblesSegundos[i]+1))%mod;
	}
	cout << DP[N-1] << endl;
	return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 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