Submission #284801

#TimeUsernameProblemLanguageResultExecution timeMemory
284801limabeansSkyscraper (JOI16_skyscraper)C++17
5 / 100
2099 ms384 KiB
#include <bits/stdc++.h> using namespace std; template<typename T> void out(T x) { cout << x << endl; exit(0); } #define watch(x) cout << (#x) << " is " << (x) << endl using ll = long long; const ll mod = 1e9+7; const int maxn = 1e6 + 5; int n, L; vector<int> a; int main() { ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); cin>>n>>L; a.resize(n); for (int i=0; i<n; i++) { cin>>a[i]; } sort(a.begin(), a.end()); ll res = 0; do { ll cur = 0; for (int i=0; i+1<n; i++) { cur += abs(a[i]-a[i+1]); } //watch(cur); if (cur <= L) res++; } while (next_permutation(a.begin(), a.end())); cout<<res<<endl; return 0; }
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...
#Verdict Execution timeMemoryGrader output
Fetching results...