This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
#define S second
#define F first
using namespace std;
typedef long long int ll;
typedef pair<ll,ll> pii;
const int maxn = 1e5+20;
int main(){
ios_base::sync_with_stdio(false);
cin.tie(0);
cout.tie(0);
int n,L;
cin>>n>>L;
pii A[n];
for(int i=0;i<n;i++){
cin>>A[i].S;
A[i].F=i;
}
sort(A,A+n);
int cnt=0;
do{
int tmp=0;
for(int i=1;i<n;i++){
tmp += abs(A[i].S-A[i-1].S);
}
if(tmp<=L){
cnt++;
}
}while(next_permutation(A,A+n));
cout<<cnt;
return 0;
}
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|
Fetching results... |