Submission #1294238

#TimeUsernameProblemLanguageResultExecution timeMemory
1294238esmabadalSkyscraper (JOI16_skyscraper)C++20
5 / 100
2095 ms580 KiB
#include <bits/stdc++.h> using namespace std; #define int long long const int MAX = 1e5 + 10; vector<int> vt[MAX]; void solve() { int n, l; cin >> n >> l; int arr[n + 1]; for(int i = 1; i <= n; i++) { cin >> arr[i]; } int ans = 0; sort(arr + 1, arr + n + 1); do{ int cem = 0; for(int i = 1; i < n; i++) { cem += abs(arr[i + 1] - arr[i]); } if(cem <= l) { ans++; ans = ans % 1000000007; } }while(next_permutation(arr + 1, arr + n + 1)); cout << ans << endl; } signed main() { int t = 1; //cin >> t; while(t--) { solve(); } }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...