Submission #932895

#	Time	Username	Problem	Language	Result	Execution time	Memory
932895		Kavelmydex	A Huge Tower (CEOI10_tower)	C++17	10 / 100	1070 ms	604 KiB

tower

#include <bits/stdc++.h>
using namespace std;
#define int long long
#define pi pair<int,int>
#define vi vector<int>
#define rep(i,x,n) for(int i=x; i<n; ++i)
#define For(i,n) rep(i,0,n)
#define pb push_back
// #define f first
#define s second
#define endl "\n"
#define sp ' '
#define sz size()
#define all(x) (x).begin(),(x).end()

const int N = 100, OO = 1e18, mod = 1e9+9, mx = 1e6+10;
void tr(int a, int b){cout << a << sp << b << endl;}
void cmx(int &a, int b){a = max(a,b);}
void cmn(int &a, int b){a = min(a,b);}

int n,k; 
int a[N], vis[N], ans;
vi c;
void calc(int j){
    if(j >= n){
        bool ok = 1; 
        for(int i=1; i<n; ++i) 
            ok &= (c[i]-c[i-1] <= k);
        if(ok) ans++;
        return;
    }
    For(i,n) if(!vis[i]){
        vis[i] = 1;
        c.pb(a[i]);
        calc(j+1);
        c.pop_back();
        vis[i] = 0;
    }
}
int32_t main() {
    ios::sync_with_stdio(0); cin.tie(0); 
    cin >> n >> k;
    For(i,n) cin >> a[i];
    calc(0);
    cout << ans%mod << endl;
    return 0;
}   

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