oj.uz

Submission #1057637

# Submission time Handle Problem Language Result Execution time Memory
1057637 2024-08-14T02:12:23 Z mtshasta A Huge Tower (CEOI10_tower) C++17
100 / 100
 83 ms 13140 KB 
#include <bits/stdc++.h>

using namespace std;
typedef long long ll;

const int MOD = 1e9 + 9;

void solve() {
    int n, d;
    cin >> n >> d;
    vector<int> b(n);
    vector<ll> ans(n);
    for (int i = 0; i < n; ++i) {
        cin >> b[i];
    }
    sort(b.begin(), b.end());
    ans[0] = 1;
    int cnt = 1;
    for (int i = 1; i < n; ++i) {
        auto ok = [&](int x) -> bool { return b[i] <= b[x] + d; };
        int l = i - cnt, r = i, res;
        while (l <= r) {
            int mid = l + (r - l) / 2;
            if (!ok(mid))
                l = mid + 1;
            else {
                res = mid;
                r = mid - 1;
            }
        }
        ans[i] = ans[i - 1] * (i - res + 1);
        ans[i] %= MOD;
        cnt = i - res + 1;
    }
    cout << ans[n - 1] << '\n';
}

int main() {
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    solve();
    return 0;
}

Compilation message

tower.cpp: In function 'void solve()':
tower.cpp:31:34: warning: 'res' may be used uninitialized in this function [-Wmaybe-uninitialized]
   31 |         ans[i] = ans[i - 1] * (i - res + 1);
      |                                ~~^~~~~

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
5.0 / 5.0

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

Subtask #13
5.0 / 5.0

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

Subtask #14
5.0 / 5.0

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

Subtask #15
5.0 / 5.0

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

Subtask #16
5.0 / 5.0

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

Subtask #17
5.0 / 5.0

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

Subtask #18
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 9 ms 860 KB Output is correct
2 Correct 8 ms 1548 KB Output is correct

Subtask #19
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 41 ms 3388 KB Output is correct
2 Correct 32 ms 5836 KB Output is correct

Subtask #20
5.0 / 5.0

# Verdict Execution time Memory Grader output
1 Correct 80 ms 7516 KB Output is correct
2 Correct 83 ms 13140 KB Output is correct