제출 #755822

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

tower

#include <bits/stdc++.h>
using namespace std;
#define vi vector<int>
#define vl vector<long long>
#define vii vector<pair<int,int>>
#define vll vector<pair<long long,long long>>
#define pb push_back
#define ll long long
#define ld long double
#define nl '\n'
#define boost ios::sync_with_stdio(false)
#define mp make_pair
#define se second
#define fi first
#define fore(i, y) for(ll i = 0; i < y; i++)
#define forr(i,x,y) for(int i = x;i<=y;i++)
#define forn(i,y,x) for(ll i = y; i >= x; i--)
#define all(v) v.begin(),v.end()
#define sz(v) v.size()
#define clr(v,k) memset(v,k,sizeof(v))
#define rall(v) v.rbegin() , v.rend()
#define pii pair<int,int>
#define pll pair<ll , ll>

const ll MOD = 1e9 + 9;
const ll INF = 1e18 + 1;

ll gcd(ll a , ll b) {return b ? gcd(b , a % b) : a ;} // greatest common divisor (PGCD)
ll lcm(ll a , ll b) {return a * (b / gcd(a , b));} // least common multiple (PPCM)

// HERE IS THE SOLUTION
vi s;
int n , d;
vector<bool> vis;
int solve(int i)
{
    bool acc = 0;
    int ans = 0;
    forr(j , 0, n-1)
    {
        if(j==i)continue;
        if(s[j] <= d + s[i]&&!vis[j])
        {
            acc = 1;
            vis[j] = 1;
            (ans+=solve(j))%=MOD;
            vis[j] = 0;
        }
    }
    if(!acc)
    {
        fore(j , n)
        {
            if(!vis[j])return 0;
        }
        return 1;
    }
    else
    {
        return ans;
    }
}
int main()
{
    cin.tie(0);
    cout.tie(0);
    boost;
    cin>>n>>d;
    s.assign(n , 0);
    vis.assign(n , 0);
    fore(i , n)
    {
        cin>>s[i];
    }
    sort(rall(s));
    int res = 0;
    fore(i , n)
    {
        vis[i] = 1;
        (res+=solve(i))%=MOD;
        vis[i] = 0;
    }
    cout<<res<<nl;
}

• 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: 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