oj.uz

Submission #297110

# Submission time Handle Problem Language Result Execution time Memory
297110 2020-09-11T08:59:29 Z arman_ferdous Skyscraper (JOI16_skyscraper) C++17
5 / 100
 2000 ms 384 KB 
#include <bits/stdc++.h>
using namespace std;

#define fi first
#define se second
#define pb push_back
#define sz(v) (int)v.size()
#define all(v) v.begin(),v.end()
#define dbg(x) cerr << #x << " is " << x << "\n";

using ll = long long;
using ii = pair<ll,ll>;

int main() {
  int n, L;
  cin >> n >> L;
  vector<int> v(n);
  for(int i = 0; i < n; i++) cin >> v[i];

  sort(all(v));
  ll ans = 0;
  do {
    ll cur = 0;
    for(int i = 0; i + 1 < n; i++)
      cur += abs(v[i] - v[i + 1]);
    if(cur <= L) ans++;
  } while(next_permutation(all(v)));
  cout << ans << "\n";
  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct

Subtask #2
0 / 15.0

# Verdict Execution time Memory Grader output
1 Execution timed out 2068 ms 256 KB Time limit exceeded
2 Halted 0 ms 0 KB -

Subtask #3
0 / 80.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 256 KB Output is correct
2 Correct 1 ms 256 KB Output is correct
3 Correct 1 ms 256 KB Output is correct
4 Correct 0 ms 256 KB Output is correct
5 Correct 1 ms 256 KB Output is correct
6 Correct 1 ms 256 KB Output is correct
7 Correct 1 ms 256 KB Output is correct
8 Correct 1 ms 384 KB Output is correct
9 Correct 1 ms 256 KB Output is correct
10 Correct 1 ms 256 KB Output is correct
11 Execution timed out 2068 ms 256 KB Time limit exceeded
12 Halted 0 ms 0 KB -