# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
68012 | duality | Skyscraper (JOI16_skyscraper) | C++11 | 2068 ms | 696 KiB |
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>
using namespace std;
#define mp make_pair
#define pb push_back
typedef pair<int,int> pii;
typedef vector<int> vi;
typedef vector<pii> vpii;
int A[100];
int main() {
int i;
int N,L;
scanf("%d %d",&N,&L);
for (i = 0; i < N; i++) scanf("%d",&A[i]);
int ans = 0;
sort(A,A+N);
do {
int s = 0;
for (i = 1; i < N; i++) s += abs(A[i-1]-A[i]);
if (s <= L) ans++;
} while (next_permutation(A,A+N));
printf("%d\n",ans);
return 0;
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |