제출 #1283059

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1283059		nathako9n	A Huge Tower (CEOI10_tower)	C++20	70 / 100	1 ms	580 KiB

tower

#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pii pair<int,int>
#define pll pair<ll,ll>
#define vi vector<int>
#define vll vector<ll>
#define pb push_back
#define eb emplace_back
#define mp make_pair
#define fi first
#define sec second
#define all(x) (x).begin(), (x).end()
#define endl '\n'
#define yes cout<<"YES\n"
#define no cout<<"NO\n"
//#define  ios::sync_with_stdio(false); cin.tie(nullptr);
#define fore(i,a,b) for(int i=(a); i<=(b); ++i)
#define forr(i,a,b) for(int i=(a); i>=(b); --i)

#define rep(i,n) for(int i=1;i<=(n);++i)
#define rep2(i,n) for(int i=0;i<(n);++i)

const ll INF = 1e18;
const int MOD = 1e9 + 9;
int dx[4] = {1, -1, 0, 0};
int dy[4] = {0, 0, 1, -1};
bool inrange(int i, int j, int n, int m){
    return (i >= 1 && j >= 1 && i <= n && j <= m);
}
/////////
/*


*/
const int N = 75;
int ar[N+3], n, d, b[N+3];
int main() {
    ios::sync_with_stdio(0);
    cin.tie(0);
    cin >>n >>d;
    fore(i,1, n)cin >> ar[i];
    sort(ar+1, ar+n+1);
    fore(i, 1, n){
        fore(j, 1, i-1){
            if(ar[i] <= ar[j]+d)b[i]++;
        }
        b[i]++;

    }
    ll ans = 1;
    fore(i, 2, n){
        ans = (ans * b[i]) % MOD;
    }
    cout << ans;
    return 0;
}

/*


*/

• 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: 5 / 5
• Subtask 13: 5 / 5
• Subtask 14: 5 / 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