oj.uz

Submission #393557

# Submission time Handle Problem Language Result Execution time Memory
393557 2021-04-24T02:50:44 Z aaronhma A Huge Tower (CEOI10_tower) C++17
100 / 100
 129 ms 5068 KB 
// O(n log n + n)
#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef vector<ll> vll;

#define all(x) begin(x), end(x)
#define FORE(i, a, b) for (ll i = a; i < b; i++)

const int MOD = 1e9 + 9; // 10^9 + 9 for "CEOI 2010 - A Huge Tower"

// INPUT
template <class T>
void read(T &x) { cin >> x; }

template <class T>
void read(vector<T> &a)
{
  FORE(i, 0, (int)a.size())
  read(a[i]);
}

template <class Arg, class... Args>
void read(Arg &first, Args &...rest)
{
  read(first);
  read(rest...);
}

int main()
{
  ios_base::sync_with_stdio(false);
  cin.tie(NULL);

  // ans: We'll set the answer to 1.
  // j: Current index that we can build start from arr[0] (j = 0 is a dummy value)
  ll n, d, ans = 1, j = 0;
  read(n, d);

  vll arr(n);
  read(arr);

  // Sort the blocks in increasing order
  sort(all(arr));

  // Let i = starting index of the first block possible.
  FORE(i, 0, n) {
    // Find the maximum index possible that we can build starting from arr[i] as the base
    while (j < n && arr[j] - arr[i] <= d)
      j++;

    // j - i: Largest tower we can build when arr[i] is the base
    ans *= j - i;

    // Make the answer within range
    ans %= MOD;
  }

  cout << ans << "\n";

  return 0;
}

Subtask #1
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #2
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #3
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #4
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #5
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #6
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #7
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #8
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #9
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #10
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #11
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #12
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #13
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #14
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #15
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 204 KB Output is correct

Subtask #16
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 1 ms 332 KB Output is correct

Subtask #17
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 3 ms 332 KB Output is correct

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 11 ms 588 KB Output is correct
2 Correct 10 ms 716 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 54 ms 2252 KB Output is correct
2 Correct 49 ms 2252 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 108 ms 5068 KB Output is correct
2 Correct 129 ms 5068 KB Output is correct