oj.uz

Submission #363979

# Submission time Handle Problem Language Result Execution time Memory
363979 2021-02-07T17:52:15 Z MaisyDoge13 A Huge Tower (CEOI10_tower) C++17
55 / 100
 115 ms 5228 KB 
#include <iostream>
#include <cstdio>
#include <vector>
#include <utility>
#include <cmath>
#include <climits>
#include <algorithm>
#include <array>
#include <set>
#include <map>
using namespace std;

#define input "tower.in"
#define output "tower.out"
#define int long long
#define MOD (int)(1e9+9)
int n, k;
vector<int> a;
signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0);
    //freopen(input, "r", stdin);
    //freopen(output, "w", stdout);
    cin >> n >> k;
    a.reserve(n+1);
    for (int i=0;i<n;i++) {
        int x; cin >> x;
        a.push_back(x);
    }
    a.push_back(LLONG_MAX);
    sort(a.begin(), a.end());
    int ans=1,r=1,l=0;
    while (r<=n) {
        //cout << "l r " << l << ' ' << r << endl;
        int blocks = r-l;//when this is the base and all the previous ones have been used, this is the size to build
        if (a[l]+k>=a[r]) r++;
        else if (a[l]+k<a[r]) {
            ans*=blocks;
            //cout << blocks << endl;
            l++;
            if (r==l) r++;
        }
    }
    cout << ans%MOD << endl;
}

Subtask #1
5.0 / 5.0

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

Subtask #2
5.0 / 5.0

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

Subtask #3
5.0 / 5.0

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

Subtask #4
5.0 / 5.0

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

Subtask #5
5.0 / 5.0

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

Subtask #6
5.0 / 5.0

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

Subtask #7
5.0 / 5.0

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

Subtask #8
5.0 / 5.0

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

Subtask #9
5.0 / 5.0

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

Subtask #10
5.0 / 5.0

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

Subtask #11
5.0 / 5.0

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

Subtask #12
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #13
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #14
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #15
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #16
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 1 ms 364 KB Output isn't correct

Subtask #17
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 2 ms 364 KB Output isn't correct

Subtask #18
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 11 ms 748 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #19
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 52 ms 2284 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #20
0 / 5.0

# Verdict Execution time Memory Grader output
1 Incorrect 115 ms 5228 KB Output isn't correct
2 Halted 0 ms 0 KB -