Submission #691741

#	Time	Username	Problem	Language	Result	Execution time	Memory
691741		vjudge1	A Huge Tower (CEOI10_tower)	C++17	30 / 100	107 ms	11232 KiB

tower

#include <iostream>
#include <cstdio>
#include <cstring>
#include <vector>
#include <map>
#include <set>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
using namespace std;
 
#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()
#define mp make_pair
#define pb push_back
#define f first
#define s second
#define lb lower_bound
#define ub upper_bound
using vi = vector<int>;
using ll = long long;
using pii = pair<int, int>;
using pdd = pair<double, double>;

const int maxn = 1e6 + 7;
int n;
ll num[maxn];
ll mod = 1e9 + 7, d;
 
int main() {
	ios::sync_with_stdio(false);
	cin >> n >> d;
	rep(i, 0, n) cin >> num[i];
	sort(num, num + n);
	ll res = 1;
	rep(i, 0, n) {
		ll x = num[i] - d;
		int cnt = i - (lower_bound(num, num + i, x) - num);
		res = (res * (cnt + 1LL)) % mod;
	}
	cout << res << endl;
}	

• 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