Submission #1258886

#	Time	Username	Problem	Language	Result	Execution time	Memory
1258886		kamrad	Skyscraper (JOI16_skyscraper)	C++20	5 / 100	32 ms	472 KiB

skyscraper

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

//#pragma GCC optimize("Ofast,unroll-loops")
//#pragma GCC target("avx2,popcnt,lzcnt,abm,bmi,bmi2,fma,tune=native")

using ll  = long long;
using ld  = long double;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pi3 = pair<pii, int>;

#define IOS               ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define F                 first
#define S                 second
#define sz(x)             x.size()
#define all(x)            x.begin(), x.end()
#define pb                push_back
#define minr(a, b)        a = min(a, b);
#define maxr(a, b)        a = max(a, b);
#define shit              cout << "shit\n" << flush;
#define tl                while(1&1) continue;
#define rand(l, r)        uniform_int_distribution<int64_t>(l,r)(rng)
random_device device;     default_random_engine rng(device());

const int Mod    = 1e9 + 7; //998244353;
const int LG     = 64;
const int SQ     = 500;
const int Inf    = 2e9 + 10;
const int maxN   = 10;

int n, l;
int a[maxN];

int main() {
	IOS;

	cin >> n >> l;
	for(int i = 1; i <= n; i++)
		cin >> a[i];

	vector <int> p;
	for(int i = 1; i <= n; i++)
		p.pb(i);

	int ans = 0;
	do {
		int val = 0;
		for(int i = 0; i < n-1; i++)
			val += abs(a[p[i]]-a[p[i+1]]);
		ans += (val <= l);
	}while(next_permutation(all(p)));
	cout << ans;
}

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