제출 #412792

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
412792		rqi	A Huge Tower (CEOI10_tower)	C++14	100 / 100	141 ms	8684 KiB

tower

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

typedef long long ll;
typedef pair<int, int> pi;

#define mp make_pair
#define f first
#define s second
#define pb push_back

#define all(x) begin(x), end(x)

const int MOD = 1e9+9;

#include <ext/pb_ds/assoc_container.hpp>
using namespace __gnu_pbds;

template<class T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

struct mi{
	ll v;
	mi(){
		v = 0;
	}
	mi(ll _v){
		v = _v % MOD;
		if(v < 0) v+=MOD;
	}
};

mi operator*(mi a, mi b){
	a.v = (a.v*b.v) % MOD;
	return a;
}

mi& operator*=(mi& a, mi b){
	a = a*b;
	return a;
}

const int mx = 5000005;
int build[mx];

int main(){
	cin.tie(0)->sync_with_stdio(0);
	int N, D;
	cin >> N >> D;
	for(int i = 1; i <= N; i++){
		cin >> build[i];
	}
	sort(build+1, build+1+N);
	int cur_j = 1;
	mi ans = mi(1);
	for(int i = 1; i <= N; i++){
		while(true){
			if(build[cur_j]+D < build[i]){
				cur_j++;
			}
			else{
				break;
			}
		}
		ans*=mi(i-cur_j+1);
	}
	cout << ans.v << "\n";
}

• 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: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5