Submission #363979

#	Time	Username	Problem	Language	Result	Execution time	Memory
363979		MaisyDoge13	A Huge Tower (CEOI10_tower)	C++17	55 / 100	115 ms	5228 KiB

tower

#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 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 5 / 5
• Subtask 6: 5 / 5
• Subtask 7: 5 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 5
• Subtask 10: 5 / 5
• Subtask 11: 5 / 5
• Subtask 12: 0 / 5
• Subtask 13: 0 / 5
• Subtask 14: 0 / 5
• Subtask 15: 0 / 5
• Subtask 16: 0 / 5
• Subtask 17: 0 / 5
• Subtask 18: 0 / 5
• Subtask 19: 0 / 5
• Subtask 20: 0 / 5