Submission #755979

#	Time	Username	Problem	Language	Result	Execution time	Memory
755979		vjudge1	A Huge Tower (CEOI10_tower)	C++17	40 / 100	1049 ms	262144 KiB

tower

#include<bits/stdc++.h>
#include<ext/pb_ds/assoc_container.hpp>
using namespace std;
using namespace __gnu_pbds;

typedef long long ll;
typedef tree<int, null_type, less<int>, rb_tree_tag, tree_order_statistics_node_update> indexed_set;
const ll MOD = 1e9 + 9;
ll mod(ll x, ll m = MOD){return (x + m) % m;}

typedef vector<int> vi;
typedef vector<ll> vll;
typedef pair<ll,ll> pll;

typedef vector<pair<int,int>> vpi;

#define pb push_back

#define ff first
#define ss second
#define all(x) (x).begin(),(x).end()

const int nax = 504;
const int bnax = 20;
int n, d;
vi A;
ll dp[bnax][(1 << bnax)];
ll f(int i, int mask)
{
    if(dp[i][mask] != -1)
        return dp[i][mask];
    if(mask == (1 << n) - 1)
        return dp[i][mask] = 1ll;
    ll ans = 0ll;
    for(int j =0; j < n; j++)
    {
        if(((1 << j) & mask) == 0)
        {
            if(A[j] <= A[i] + d)
            {
                ans = mod(ans + f(j, mask + (1 << j)));
            }
        }
    }
    return dp[i][mask] = ans;
}
void solve()
{
    memset(dp, -1, sizeof(dp));
    cin >> n >> d;
    A.resize(n);
    for(int i = 0; i < n; i++)
        cin >> A[i];
    ll ans = 0ll;
    for(int i = 0; i < n; i++)
    {
        ans = mod(ans + f(i, (1 << i)));
    }
    cout << ans;
}
int32_t main()
{
    ios::sync_with_stdio(false);
    cin.tie(0); cout.tie(0);
    int tt = 1; //cin >> tt;
    while(tt--)
        solve();

}

• 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: 0 / 5
• Subtask 8: 5 / 5
• Subtask 9: 5 / 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