제출 #1356643

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1356643		vjudge1	A Huge Tower (CEOI10_tower)	C++17	25 / 100	1096 ms	452 KiB

tower

#include <bits/stdc++.h>
using ll = long long;
using namespace std;
#define int ll

int mod=1e9+9;
int a[105];

int32_t main(){
    ios_base::sync_with_stdio(false); cin.tie(0);
    int n, k;
    cin >> n >> k;
    for(int i=1; i<=n; i++)cin >> a[i];
    a[n+1]=1e9;
    sort(a+1, a+n+1);
    vector<pair<int, int>> v;
    int ans=1;
    for(int i=1; i<=n; i++){
        if(a[i+1]-a[i]>k){
            v.push_back({a[i], i});
            //for(auto e:v)cout << e << ' '; cout << '\n';
            if(v.size()==1)continue;
            int val=0;
            do{
                bool flag=1;
                for(int j=1; j<v.size(); j++){
                    if(v[j].first-v[j-1].first>k){
                        flag=0;
                        break;
                    }
                }
                if(flag)val++;
            }while(next_permutation(v.begin(), v.end()));
            ans*=val;
            ans%=mod;
            v.clear();
        }
        else{
            v.push_back({a[i], i});
        }
    }
    cout << ans;
    return 0;
}

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