Submission #331754

#	Time	Username	Problem	Language	Result	Execution time	Memory
331754		ignaciocanta	A Huge Tower (CEOI10_tower)	C++14	15 / 100	111 ms	7660 KiB

tower

#include <bits/stdc++.h>
 
using namespace std;
 
using tint = long long;
using ld = long double;
 
#define forsn(i, s, n) for(int i = s; i < int(n); i++)
#define forn(i, n) forsn(i, 0, n)
#define trav(a, x) for(auto& a : x)
 
using vi = vector<int>;
using vl = vector<tint>;
using vb = vector<bool>;
#define pb push_back
#define pf push_front
#define rsz resize
#define all(x) begin(x), end(x)
#define rall(x) x.rbegin(), x.rend() 
#define sz(x) (int)(x).size()
#define ins insert
#define esta(x,c) ((c).find(x) != (c).end())
 
using pi = pair<int,int>;
using pl = pair<tint,tint>;
#define f first
#define s second
#define mp make_pair
 
#define DBG(x) cerr << #x << " = " << x << endl;
 
const int MOD = 1e9+9;
const tint mod = 998244353;
const int MX = 1e8+5; 
const tint INF = 1e18; 
const int inf = 2e9;
const ld PI = acos(ld(-1)); 
const ld eps = 1e-8;
 
const int dx[4] = {1, -1, 0, 0};
const int dy[4] = {0, 0, 1, -1};
 
template<class T> void remDup(vector<T> &v){ 
    sort(all(v)); v.erase(unique(all(v)),end(v));
}
 
 bool valid(int x, int y, int n, int m){
    return (0<=x && x<n && 0<=y && y<m);
}
 
int cdiv(int a, int b) { return a/b+((a^b)>0&&a%b); } //redondea p arriba
int fdiv(int a, int b) { return a/b-((a^b)<0&&a%b); } //redonde p abajo
 
void NACHO(string name = "cbarn"){
    ios_base::sync_with_stdio(0); cin.tie(0);
    //freopen((name+".in").c_str(), "r", stdin);
    //freopen((name+".out").c_str(), "w", stdout);
}

tint fact[MX];

void fill(int n){
	fact[0] = 1;
	forsn(i, 1, n+1) fact[i] = (i*fact[i-1]) % MOD;
}

int main(){
	NACHO();
	int n, D; cin >> n >> D;
	vi a (n);
	forn(i, n) cin >> a[i];
	sort(all(a));
	fill(n);
	int i = 0, j = 0;
	tint ret = 1;
	while(j < n){
		//cout << i << " " << j << endl;
		if(a[j]-a[i] <= D){
			++j;
		}else{
			ret = (((ret*fact[j-i]) % MOD)+MOD)%MOD;
			int c = i;
			while(a[i] == a[c]){
				++i;
			}
		}
	}
	ret = (((ret*fact[j-i]) % MOD)+MOD)%MOD;;
	cout << ret % MOD << "\n";
}

//OVERFLOW!!!!!

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 0 / 5
• Subtask 4: 0 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 5
• Subtask 10: 0 / 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