Submission #343275

#TimeUsernameProblemLanguageResultExecution timeMemory
343275mp007mpSkyscraper (JOI16_skyscraper)C++14
5 / 100
2077 ms364 KiB
#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 timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...