| # | 제출 시각 | 아이디 | 문제 | 언어 | 결과 | 실행 시간 | 메모리 |
|---|---|---|---|---|---|---|---|
| 1258881 | Seyyed_Mojtaba_Mortazavi | Skyscraper (JOI16_skyscraper) | C++20 | 2095 ms | 328 KiB |
#include <bits/stdc++.h>
using namespace std;
#define int long long int
const int MAXN = 5e5 + 10;
int a[MAXN];
signed main()
{
int n, l, ans = 0;
cin >> n >> l;
for (int i = 1; i <= n; i++)
cin >> a[i];
sort(a + 1, a + n + 1);
do
{
int val = 0;
for (int i = 2; i <= n; i++)
val += abs(a[i] - a[i - 1]);
ans += (val <= l);
} while (next_permutation(a + 1, a + n + 1));
cout << ans << endl;
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... | ||||
