제출 #654071

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
654071		atharvd	A Huge Tower (CEOI10_tower)	C++14	90 / 100	269 ms	5128 KiB

tower

#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<cmath>
#include<fstream>

#define for_n(i,a,n) for (int i=a;i<n;i++)
#define pb push_back
#define mp(i, j) make_pair(i, j)
#define MOD 1000000009

typedef long long ll;

using namespace std;

int main(){
    int n, d;
    cin >> n >> d;
    int arr[n];
    for(int i = 0; i < n; i++){
        cin >> arr[i];
    }
    sort(arr, arr + n);
    int un = 0;
    int deux = 0;
    int b[n];
    int count = 1;
    b[0] = count;
    while(un < n - 1 || deux < n - 1){
        if(arr[deux] - arr[un] <= d){
            if(deux != n - 1){
                b[deux] = deux - un + 1;
                deux++;
                count++;
            }
            else{
                b[deux] = deux - un + 1;
                break;
            }
        }
        else{
            while(arr[deux] - arr[un] > d){
                un++;
                count--;
            }
        }
        //cout << un << " " << deux << endl;
    }
    ll ans = 1;
    for(auto a: b){
        ans *= ll(a);
        ans %= MOD;
    }
    cout << ans << endl;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 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: 0 / 5
• Subtask 12: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 5
• Subtask 15: 5 / 5
• Subtask 16: 5 / 5
• Subtask 17: 5 / 5
• Subtask 18: 5 / 5
• Subtask 19: 5 / 5
• Subtask 20: 5 / 5