Submission #654069

#	Time	Username	Problem	Language	Result	Execution time	Memory
654069		atharvd	A Huge Tower (CEOI10_tower)	C++14	30 / 100	250 ms	2696 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)

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 l = 0;
    int w = 0;
    ll count = 1;
    for(int r=0;r < n;r++) {
        for(;l < r;l++) {
            if(arr[r]-arr[l] <= d) break;
            w--;
        }
        w++;
        count *= w;
    }
    cout << count << endl;
}

• Subtask 1: 5 / 5
• Subtask 2: 5 / 5
• Subtask 3: 5 / 5
• Subtask 4: 5 / 5
• Subtask 5: 0 / 5
• Subtask 6: 0 / 5
• Subtask 7: 0 / 5
• Subtask 8: 0 / 5
• Subtask 9: 0 / 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