Submission #135411

# Submission time Handle Problem Language Result Execution time Memory
135411 2019-07-24T05:03:58 Z 윤교준(#3250) A Huge Tower (CEOI10_tower) C++14
100 / 100
180 ms 11260 KB
#include <bits/stdc++.h>
#define eb emplace_back
#define sz(V) ((int)(V).size())
#define befv(V) ((V)[sz(V)-2])
#define allv(V) ((V).begin()),((V).end())
#define sorv(V) sort(allv(V))
#define INF (0x3f3f3f3f)
#define INFLL (0x3f3f3f3f3f3f3f3fll)
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

const int MOD = 1000000009;
const int MAXN = 1000055;

ll A[MAXN];

ll Ans = 1;
int N, D;

int main() {
	ios::sync_with_stdio(false);

	cin >> N >> D;
	for(int i = 1; i <= N; i++) cin >> A[i];
	sort(A+1, A+N+1);
	for(int i = 1; i <= N; i++) {
		int t = i - int(lower_bound(A+1, A+i, A[i]-D) - A);
		Ans = Ans * (t+1) % MOD;
	}

	cout << Ans << endl;
	return 0;
}
# Verdict Execution time Memory Grader output
1 Correct 2 ms 380 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 2 ms 504 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 3 ms 376 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 5 ms 384 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 16 ms 1272 KB Output is correct
2 Correct 15 ms 1244 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 75 ms 4788 KB Output is correct
2 Correct 64 ms 4728 KB Output is correct
# Verdict Execution time Memory Grader output
1 Correct 143 ms 11260 KB Output is correct
2 Correct 180 ms 10764 KB Output is correct