oj.uz

Submission #331750

# Submission time Handle Problem Language Result Execution time Memory
331750 2020-11-29T22:17:55 Z ignaciocanta A Huge Tower (CEOI10_tower) C++14
20 / 100
 126 ms 18400 KB 
#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 tint 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] = 1LL;
	forsn(i, 1, n+1) fact[i] = (((i*fact[i-1]) % MOD)+MOD)%MOD;
}

int main(){
	NACHO();
	int n, D; cin >> n >> D;
	vl a (n+1);
	forn(i, n) cin >> a[i];
	a[n] = INF;
	sort(all(a));
	fill(n);
	int i = 0, j = 0;
	tint ret = 1;
	vl s;
	s.pb(a[0]);
	while(j < n){
		//cout << i << " " << j << endl;
		if(a[j]-a[i] <= D){
			++j;
			s.pb(a[j]);
		}else{
			s.pop_back();
			tint it = lower_bound(all(s), a[j]-D)-s.begin();
			tint ways = (it == sz(s) ? 1LL : sz(s)-it+1) % MOD;
			//cout << i << " " << j << " " << ways << endl;
			ret = (((ret % MOD*fact[j-i] * ways) % MOD)+MOD)%MOD;
			i = j;
			s.clear();
			s.pb(a[i]);
		}
	}
	ret = (((ret % MOD*fact[j-i]) % MOD)+MOD)%MOD;
	cout << ((ret % MOD)+MOD)%MOD << "\n";
}

//OVERFLOW!!!!!

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct

Subtask #4
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct

Subtask #5
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #6
5.0 / 5.0

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

Subtask #7
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 0 ms 364 KB Output isn't correct

Subtask #8
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #9
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #10
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #11
5.0 / 5.0

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

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 620 KB Output isn't correct

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 3 ms 748 KB Output isn't correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 1132 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 54 ms 4352 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 126 ms 18400 KB Output isn't correct
2 Halted 0 ms 0 KB -