Submission #1214684

#TimeUsernameProblemLanguageResultExecution timeMemory
1214684NAMINSkyscraper (JOI16_skyscraper)C++20
5 / 100
2093 ms328 KiB
#include <bits/stdc++.h>

#define ll long long
#define endl "\n"

using namespace std;

void solve(){
	int N,L;
	cin >> N >> L;
	vector<int> a(N);
	for(int i=0;i<N;i++)
		cin >> a[i];
	sort(a.begin(),a.end());
	int ans = 0;
	do{
		int sum = 0;
		for(int i=0;i<N-1;i++){
			sum += abs(a[i]-a[i+1]);
		}
		if(sum <= L){
			ans++;
		}
	}while(next_permutation(a.begin(),a.end()));
	cout << ans << endl;
}	

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	int t = 1;
	//cin >> t;
 	while(t--){
		solve();
	}
	return 0;
}
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...