| # | Time | Username | Problem | Language | Result | Execution time | Memory |
|---|---|---|---|---|---|---|---|
| 1356705 | po_rag526 | Construction of Highway (JOI18_construction) | C++20 | 0 ms | 344 KiB |
#include <bits/stdc++.h>
using namespace std;
#define ll long long
int n,m;
const int MOD=1000000009;
int main(){
cin>>n>>m;
vector<ll> v(n);
vector<int> per(n);
for(int i=0;i<n;i++){
cin>>v[i];
}
ll ans=0;
iota(per.begin(),per.end(),0);
do{
ll p=-1;
bool con=0;
for(int idx:per){
ll a=v[idx];
if(a>p+m&&p!=-1)con=1;
p=a;
}
if(con)continue;
ans++;
ans%=MOD;
}while(next_permutation( per.begin() , per.end() ));
cout << ans;
}
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
| # | Result | Execution time | Memory | Grader output |
|---|---|---|---|---|
| Fetching results... | ||||
