Submission #1054982

#TimeUsernameProblemLanguageResultExecution timeMemory
1054982RojusSkyscraper (JOI16_skyscraper)C++14
5 / 100
2039 ms348 KiB
#include <bits/stdc++.h> using namespace std; int main() { const long long mod=1000000007; int n, l; cin >> n >> l; vector<int> a; for(int i=0; i<n; i++) { int x; cin >> x; a.push_back(x); } sort(a.begin(), a.end()); long long kiek=0; do { int sum=0; for(int i=0; i<n-1; i++) { sum+=abs(a[i]-a[i+1]); } if(sum<=l) { kiek++; kiek=kiek%mod; } }while(next_permutation(a.begin(), a.end())); cout << kiek; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...