제출 #584383

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
584383		Mr_Husanboy	Skyscraper (JOI16_skyscraper)	C++14	5 / 100	2073 ms	324 KiB

skyscraper

// Muallif: Mansuraliyev Husanboy Murotali o'g'li  >> NamPS
#pragma GCC optimize("Ofast")
#include<bits/stdc++.h>
 
using namespace std;
 
#define ll long long
#define ull unsigned long long 
#define ios ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL)
#define all(a) a.begin(), a.end()
#define F first
#define rep(x,start,end) for(int x=(start)-((start)>(end));x!=(end)-((start)>(end));((start)<(end)?x++:x--))
#define S second
#define fp(a,i,c) for(int (a) = (i); (a) < (c); (a)++)
#define fm(a,i,c) for(int (a) = (i); (a) >= (c); (a)--)
#define vii vector<int>
#define vll vector<ll>
// 0-9 >> 48-57;    A-Z>>65-90   and   a-z>>97-122 respectively;


void solve(){
	ll n,l; cin>>n>>l;
	vector<ll> v(n); for(ll &u:v) cin>>u;
	sort(all(v)); int ans=0;
	do{
		ll sum=0;
		for(int i=1;i<n;i++) sum+=llabs(v[i]-v[i-1]);
		ans+=sum<=l;
	}while(next_permutation(all(v)));
	cout<<ans;
}
 
int main(){
	ios;
//	int t; cin>>t; while(t--)
	solve();
}

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