# | TimeUTC-0 | Username | Problem | Language | Result | Execution time | Memory |
---|---|---|---|---|---|---|---|
549514 | theshadow_04 | Skyscraper (JOI16_skyscraper) | C++14 | 245 ms | 101336 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.
// annotshy
#include <bits/stdc++.h>
#define Task "CF"
#define MOD 1000000007
#define pb push_back
using namespace std;
const int maxn = 200005;
int n, l;
int a[maxn];
int dp[(1 << 14) + 5][15][105];
void Sub1() {
vector<int> v;
for(int i = 1; i <= n; ++i) cin >> a[i], v.pb(i);
int ans = 0;
do {
long long res = 0;
for(int i = 0; i < (int) v.size() - 1; ++ i) res += abs(a[v[i + 1]] - a[v[i]]);
if(res <= l) ++ ans;
if(ans > MOD) ans -= MOD;
} while(next_permutation(v.begin(), v.end()));
cout << ans << "\n";
}
void Solve(int Test) {
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... |