oj.uz

Submission #703238

# Submission time Handle Problem Language Result Execution time Memory
703238 2023-02-26T16:54:57 Z ef10 A Huge Tower (CEOI10_tower) C++17
100 / 100
 273 ms 11200 KB 
// Source: https://usaco.guide/general/io

#include <bits/stdc++.h>
using namespace std;

long long N, D;

long long factor(long long n, long long m) {
	long long ret = 1;
	for (long long i = m; i <= n; i++) {
		ret *= i;
		ret %= 1000000009;
	}
	return ret;
}

long long solve(const vector<long long>& a, long long start, long long end) {
	if (start == end) return 1;
	long long ret = 1;
	//cout << "solve init: " << start << ", " << end << ", " << ret << endl;
	long long lo = start;
	long long hi = start + 1;
	while (hi <= end) {
		if (a[hi] - a[lo] > D) {
			lo++;
			while (a[hi] - a[lo] > D) {
				lo++;
			}
		}
		ret *= (hi - lo + 1);
		ret %= 1000000009;
		hi++;
	}
	//cout << "result: " << ret << endl;
	return ret;
}

int main() {
	cin >> N >> D;
	vector<long long> a(N);
	for (long long i = 0; i < N; ++i) {
		cin >> a[i];
	}
	sort(a.begin(), a.end());
	long long start = 0;
	long long end = 0;
	long long total = 1;
	while (end < N -1) {
		if (a[end+1] - a[end] > D) {
			total *= solve(a, start, end);
			total %= 1000000009;
			end++;
			start = end;
			continue;
		}
		end++;
	}
	total *= solve(a, start, end);
	total %= 1000000009;
	cout << total << endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

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

Subtask #13
5.0 / 5.0

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

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 23 ms 1064 KB Output is correct
2 Correct 25 ms 1180 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 152 ms 4688 KB Output is correct
2 Correct 113 ms 4680 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 249 ms 11200 KB Output is correct
2 Correct 273 ms 10504 KB Output is correct