Submission #1181335

#	Time	Username	Problem	Language	Result	Execution time	Memory
1181335		vnedu	Skyscraper (JOI16_skyscraper)	C++20	5 / 100	1 ms	328 KiB

skyscraper

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

template<class T> bool maximize(T &a, const T &b){ return (a < b ? a = b, 1 : 0); }
template<class T> bool minimize(T &a, const T &b){ return (a > b ? a = b, 1 : 0); }

#define fi first
#define se second

#define pb push_back
#define ii pair<int, int>

#define all(x) x.begin(), x.end()

#define TASK "nonsense"

/// end of template ///

const int N = 103;
const int A = 1e3 + 13;

int n,l,a[N];
namespace sub1
{
    bool check()
    {
        return (n<=8);
    }
    int cm[10];
    bool vis[10];
    int ans=0;
    void tri(int i)
    {
        if (i>n)
        {
            int sum=0;
            for (int i=1; i<n; ++i) sum+=abs(cm[i]-cm[i+1]);
            if (sum<=l) ++ans;
            return;
        }
        for(int j=1;j<=n;++j) if(!vis[j])
        {
            cm[i]=a[j];
            vis[j]=1;
            tri(i+1);
            vis[j]=0;
        }
    }
    void solve()
    {
        tri(1);
        cout<<ans;
    }
}
void solve()
{
    cin>>n>>l;
    for(int i=1; i<=n; ++i) cin>>a[i];
    if (sub1::check()) return void(sub1::solve());
}

int main()  {
    ios_base::sync_with_stdio(0);
    cin.tie(0);
    cout.tie(0);

//    freopen(TASK".inp","r",stdin);
//    freopen(TASK".out","w",stdout);

    int testcase=1;
//    cin>>testcase;

    while (testcase--)
        solve();

    return 0;
}

• Subtask 1: 5 / 5
• Subtask 2: 0 / 15
• Subtask 3: 0 / 80