Submission #1262638

#TimeUsernameProblemLanguageResultExecution timeMemory
1262638paskalisapoA Huge Tower (CEOI10_tower)C++20
100 / 100
183 ms5264 KiB
#include<bits/stdc++.h> using namespace std; using ll = long long; const ll MOD = 1e9 + 9; int main() { ll n , d; cin >> n >> d; vector<ll> v(n); for(auto &x : v) { cin >> x; } ll ways = 1; sort(v.begin(), v.end()); ll options = 0; ll ind = 0; for(int i = 0;i < n ;i++) { options++; while(v[i] - v[ind] > d) { ind++; options--; } ways *= options; ways %= MOD; } cout << ways << endl; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...