Järjestys

#include <bits/stdc++.h>

typedef long long ll;

#define M 1000000007

using namespace std;

void test_case() {
	int n, x;
	cin >> n >> x;
  vector<int> v(n);

  for (int i = 0; i < n; ++i) {
    cin >> v[i]; // muista vaihtaa main
  }


}

int nums[8];
bool used[8];
int cur[8];
int ans;
int n, x;

void rec(int p) {
  if (n == p) {
    ans++;
  }

  for (int i = 0; i < n; ++i) {
    if (used[i]) continue;

    if (cur[p-1] - x > nums[i]) continue;
    used[i] = 1;

    cur[p] = nums[i];
    rec(p+1);

    used[i] = 0;
  }
}

void slow() {
  
  cin >> n >> x;
  ans = 0;
  for (int i = 0; i < n; ++i) {
    cin >> nums[i];
    cur[i] = 0;
    used[i] = 0;
  }

  for (int i = 0; i < n; ++i) {
    used[i] = 1;
    cur[0] = nums[i];
    rec(1);
    used[i] = 0;
  }

  cout << ans;
}

int main() {
	ios_base::sync_with_stdio(false);
	cin.tie(0);
	int t;
	cin >> t;
	for (int i = 0; i < t; ++i) {
		slow();
		cout << "\n";
	}

	return 0;
}

Test 1

Group: 1, 2

Verdict: ACCEPTED

Test 2

Group: 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Group: 2

Verdict: TIME LIMIT EXCEEDED