# | Time | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
586164 | 21ti_dpkhang | Skyscraper (JOI16_skyscraper) | C++17 | 238 ms | 324 KiB |
This submission is migrated from previous version of oj.uz, which used different machine for grading. This submission may have different result if resubmitted.
#include<bits/stdc++.h>
using namespace std;
#define ll long long
#define FORU(i,a,b) for(int i=a;i<=b;i++)
#define FORD(i,a,b) for(int i=a;i>=b;i--)
#define str string
#define fast ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0);
#define ED cout<<endl;
const ll N=1000005;
const ll MOD=1e9+7;
ll n, kq[11], dd[10],a[1005],k,d;
void fre()
{
freopen("exc.inp","r",stdin);
freopen("exc.out","w",stdout);
}
void xuat()
{
ll s=0;
for (int j=2; j<=n; j++)
{//cout<< kq[j]<<" ";
s=(s+abs(kq[j]-kq[j-1]))%MOD;}
//cout <<s<< endl;
if(s<=k)
{
d++;
}
}
void hoanvi(int i)
{
if (i>n) xuat();
for (int j=1; j<=n; j++)
{
if(dd[j]==0){
dd[j]=1;
kq[i]=a[j];
hoanvi(i+1);
dd[j]=0;
}
}
}
void solve()
{
cin >> n >> k;
for (int i=1; i<=n; i++)
{
cin>>a[i];
dd[i]=0;
}
hoanvi(1);
cout<<d;
}
int main()
{
//fre();
fast
solve();
}
Compilation message (stderr)
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |
# | Verdict | Execution time | Memory | Grader output |
---|---|---|---|---|
Fetching results... |