/*
`-:://:::-
`//:-------:/:`
.+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
.o:--...```..---+/`
`/y+o/---....---:+o.
`...````-os+/:---:/+o/--.`
`-/+++++/:. `...` :h+d+oooo+/+-` ...
`/++//:::://++-`....` -.`//````````:` `..`
`o+/::------://o/` `-` -. -` `..`
`---.-o/:./o/::-..``..-ЗАПУСКАЕМ .. .. -` `... ``..``
`....o+:-++/:--.```..-://s. `-` .- -` `-o: .-//::::/:-`
`:s+/:--....-::/+s-` .- `- -` -///:--------:/:`
./s+//:::::://oo-``..НЕЙРОННУЮ: СЕТЬ:::::::-`РАБОТЯГИ `+:--........--:/`
.:ooo+++++osso-` `.:-...`/` ./::-------:/:` -` :+--..``````.--:+:...-+:-`
`.-/+++++/+-.-` -. ``:so:/:--.......--:+` `-```````o+/+--..`````..--:o/-..:s+:.
```````:``.. `-` -` `+:--..`````..--/+-.../.`````..-o:--.......---/o. `
`: `:- -. .o:--..`` ``..--:o` `-` `:o+:--------:+o-`
`-`-... .. .o/--...```..--:+/` `-` `oy/so/////++o/.`
-/` `-` `- ``+s/o/:---...---:++. `-` .-../d://///:-.`
`.---..``-..- .-/..`````-oo+/:::::/+o+- `-``-` `-. ````
`:++++/+++++- ..``.-/:` /y-:/++o++/:.`..` ./. `-
-++/::::::://+/..:-``:` .. `-.` ```.``` `..` `..`-` `-
`` -o//:--....-::/++` -.-` `-`.-` `..`..` `-.-
-----ss+:++/:--.```..-://s. /. `:: `-:. ./`
`````/:..+o/::-..``.--:/+s. ..-` `-``-` ..` `-` `-`-`
`-s+/::-----::/+oo---``-` .. .:- ``` .-` .-.- `-`
`:oo+//::://+os/..:`..-/:` :y.-:::::::.`.-` ./-` `-`
`./+oooooooo+/.`- .-:...`.. .//:-------://` `- `..` `:.
``.-::::-.``-/` `-` `- `oo:+:--.......--:/` `- `.:--h.``..```
-.-`.- .- `+:--..`````..--//` `- /s-//::::::::.
-` `/- .. .o:--..`` ``..--:o.```.- `//:--------://`
-` .-`.-` -.`-o/--...```..--:+/.``-:....``:-.+:--....`...--:+`
..`-. `-. ``:os:o/:---...---:++. `- ``///+:-..``````.--:+-````-.`
`.:///////.-` .:-..` -``-+o+/:::::/+o/. `- `:+:-..`````..--:o/:--/ys+-
`-++///////+o/. ``....`-. :` `.:++++++/:.` .- -o/---......---/o. `.`
`++//:-----::/+o:..` .-` : ``````` .- `+so+:--------:++-`
`````:-``:o/::-..`..--:/+o` -. `- .- `../../+o+////+o+:.`
-----syo/o+/:--.```..-://s. .-` `- .- `... ``-:////:-``
.` `/s//:--....-::/+s. -. `-` .- `..`
.+o+/:::--:://+s/-..` .::+y ``` .- `..`
./oo++////+oso-` `.... :y-+:::::::/` ...
`.:+oooooo/-` `....-. .//:-------:/:-.`
``...`` /+:+:--.......--:+`
`+:--..`````..--//`
.o:--..`` ``..--:o`
.+/--...```..--:+/`
`-o/:---...---:++.
`-+o+/:---:/+o/.
`.:+oooo+/-.`
``````
*/
#ifdef aimbot
#pragma comment(linker, "/stack:200000000")
#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#pragma GCC optimize("unroll-loops")
#endif
#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <map>
#include <set>
#include <queue>
#include <ostream>
#include <istream>
#include <typeinfo>
#include <iomanip>
#include <cstdio>
#include <cstdlib>
#include <cassert>
#include <limits>
#include <fstream>
#include <array>
#include <list>
#include <bitset>
#include <functional>
#include <random>
#include <cstring>
#include <chrono>
#define random escape__from__random__aetuhoetnuhshe
#define mt make_tuple
#define x first
#define y second
#define pb push_back
#define ppb pop_back
#define mp make_pair
#define umap unordered_map
#define uset unordered_set
#define elif else if
#define len(v) ((int)v.size())
#define f(i, n) for (int i = 0; i < (n); i++)
#define rof(i, n) for (int i = ((n) - 1); i >= 0; i--)
#define apply(v, act) for (auto &x : v) { act; }
#define log(args...) {string s = #args;deque<string> deq;\
string buf = "";int bal = 0;for (char c : s) {\
if (c == '(' || c == '[' || c == '{') {bal++;\
} else if (c == ')' || c == ']' || c == '}') {\
bal--;} else {if (bal == 0) {if (c == ',') {\
deq.pb(buf);buf = "";} else {if (c != ' ') {\
buf += c;}}}}}if (!buf.empty()) {deq.pb(buf);}\
smart_io::precall_print();smart_io::_print(deq, args);}
#define print \
smart_io::precall_print(); \
cout,
#define scan cin,
#ifdef fast_allocator
const int MAXMEM = 200 * 1000 * 1024;
char _memory[MAXMEM];
size_t _ptr = 0;
void* operator new(size_t _x) { _ptr += _x; assert(_ptr < MAXMEM); return _memory + _ptr - _x; }
void operator delete (void*) noexcept {}
#endif
using namespace std;
char string_in_buffer[(int)260];
void fast_scan(int &x) { scanf("%d", &x); }
void fast_scan(long long &x) { scanf("%lld", &x); }
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
void fast_scan(double &x) { scanf("%lf", &x); }
void fast_scan(long double &x) { scanf("%Lf", &x); }
void fast_scan(char &x) {
scanf("%c", &x);
if (x == '\n') {
fast_scan(x);
}
}
void fast_scan(string &x) {
scanf("%s", string_in_buffer);
x = string(string_in_buffer);
}
template<class TFirst, class TSecond>
void fast_scan(pair<TFirst, TSecond> &p) {
fast_scan(p.first);
fast_scan(p.second);
}
template <class T>
void fast_scan(vector<T> &v) {
for (auto &x : v) fast_scan(x);
}
void fast_print(const int &x) { printf("%d", x); }
void fast_print(const unsigned int &x) { printf("%u", x); }
void fast_print(const long long &x) { printf("%lld", x); }
void fast_print(const unsigned long long &x) { printf("%llu", x); }
void fast_print(const double &x) { printf("%.15lf", x); }
void fast_print(const long double &x) { printf("%.15Lf", x); }
void fast_print(const char &x) { printf("%c", x); };
void fast_print(const string &x) { printf("%s", x.c_str());}
void fast_print(const char v[]) { fast_print((string)v); }
template<class TFirst, class TSecond>
void fast_print(const pair<TFirst, TSecond> &p) {
fast_print(p.first);
fast_print(' ');
fast_print(p.second);
}
template <class T>
void fast_print(const vector<T> &v) {
if (v.empty()) return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print(' ');
fast_print(v[i]);
}
}
template <class T>
void fast_print(const vector<vector<T>> &v) {
if (v.empty()) return;
fast_print(v[0]);
for (int i = 1; i < v.size(); i++) {
fast_print('\n');
fast_print(v[i]);
}
}
template <class T>
void fast_print(const T &v) {
for (const auto &x : v) {
fast_print(x);
fast_print(' ');
}
}
using namespace std;
namespace smart_io {
string print_start = "";
string sep = " ";
bool first_print = false;
void precall_print() {
fast_print(print_start);
print_start = "\n";
first_print = true;
}
void _print(deque<string>) {}
template<class T, class... Args>
void _print(deque<string> names, T elem, Args... args) {
if (!first_print) {
fast_print("\n");
} else {
first_print = false;
}
fast_print(names.front());
fast_print(" = ");
fast_print(elem);
names.pop_front();
_print(names, args...);
}
} //namespace smart_io
template <class T>
ostream &operator,(ostream &os, const T &object) {
if (!smart_io::first_print) {
fast_print(smart_io::sep);
} else {
smart_io::first_print = false;
}
fast_print(object);
return os;
}
template <class T>
istream &operator,(istream &is, T &object) {
fast_scan(object);
return is;
}
namespace random {
using namespace std::chrono;
mt19937 rng(duration_cast< milliseconds >(
system_clock::now().time_since_epoch()
).count());
uniform_real_distribution<> prob_dist(0.0, 1.0);
};
#define int long long
namespace typedefs {
typedef long long ll;
typedef unsigned long long ull;
typedef pair<int, int> pii;
typedef long double ld;
}
namespace numbers_operation {
template<class T>
T floor_mod(T a, T b) {
if (a >= 0 && b >= 0) return a % b;
if (a <= 0 && b <= 0) return a % b;
return abs(b) - (abs(a) % abs(b));
}
}
using namespace numbers_operation;
using namespace typedefs;
using namespace random;
int n, L;
vector<int> v;
const int MOD = 1e9 + 7;
int mem[102][102][1000][2][2];
int dp(int i, int dupl, int W, bool left, bool right) {
if (W < 0) return 0;
if (dupl < 0) return 0;
if (dupl == 1 && left && right) return 0;
if (mem[i][dupl][W][left][right] != -1) return mem[i][dupl][W][left][right];
ll rez = 0;
if (i == 0) {
if (!left && right) {
return dupl <= 1;
}
if (!right && left) {
return dupl <= 1;
}
if (left && right) {
if (dupl == 0) return 0;
if (dupl == 1) return 0;
if (dupl == 2) return 1;
}
return 0;
}
int jump = v[i] - v[i - 1];
if (!left) {
// connect
if (dupl)
rez += dp(i - 1, dupl,
W - 2 * dupl * jump + right * jump + jump, true, right);
// dis
rez += dp(i - 1, dupl + 1,
W - 2 * dupl * jump + right * jump - jump, true, right);
// log(i, rez);
}
if (!right) {
// connect
if (dupl)
rez += dp(i - 1, dupl,
W - 2 * dupl * jump + left * jump + jump, left, true);
// dis
rez += dp(i - 1, dupl + 1,
W - 2 * dupl * jump + left * jump - jump, left, true);
}
if (i == 3) {
// log(dp(i - 1, dupl + 1,
// W - 2 * dupl * jump + right * jump - jump, true, right));
}
if (i == 2 && left && !right) {
// log("!", dp(i - 1, dupl + 1,
// W - 2 * dupl * jump + left * jump - jump, left, true));
}
if (i == 1 && left && right) {
}
// merge
if (dupl >= 2)
rez += (dupl - 1) * dp(i - 1, dupl - 1,
W - 2 * (dupl - 1) * jump + left * jump + right * jump, left, right);
// connect
if (dupl >= 1)
rez += (dupl * 2 - left - right) * dp(i - 1, dupl,
W - 2 * dupl * jump + left * jump + right * jump, left, right);
// new
assert(dupl + 1 - left - right >= 0);
rez += (dupl + 1 - left - right) * dp(i - 1, dupl + 1,
W - 2 * (dupl + 1) * jump + left * jump + right * jump, left, right);
return mem[i][dupl][W][left][right] = rez % MOD;
}
signed main(signed argc, char *argv[]) {
memset(mem, -1, sizeof mem);
scan n, L;
if (n == 1) {
print 1;
return 0;
}
v.resize(n);
scan v;
sort(v.begin(), v.end());
print dp(n - 1, 0, L, false, false);
// int cnt = 0;
// do {
// int A = 0;
// for (int j = 0; j < len(v) - 1; j++) {
// A += abs(v[j] - v[j + 1]);
// }
// if (A <= L) {
// cnt++;
// print v;
// }
// } while(next_permutation(v.begin(), v.end()));
// print cnt;
}
Compilation message
skyscraper.cpp: In function 'void fast_scan(int&)':
skyscraper.cpp:133:31: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(int &x) { scanf("%d", &x); }
~~~~~^~~~~~~~~~
skyscraper.cpp: In function 'void fast_scan(long long int&)':
skyscraper.cpp:134:37: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(long long &x) { scanf("%lld", &x); }
~~~~~^~~~~~~~~~~~
skyscraper.cpp: In function 'void fast_scan(long long unsigned int&)':
skyscraper.cpp:135:46: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(unsigned long long &x) { scanf("%llu", &x); }
~~~~~^~~~~~~~~~~~
skyscraper.cpp: In function 'void fast_scan(double&)':
skyscraper.cpp:136:34: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(double &x) { scanf("%lf", &x); }
~~~~~^~~~~~~~~~~
skyscraper.cpp: In function 'void fast_scan(long double&)':
skyscraper.cpp:137:39: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
void fast_scan(long double &x) { scanf("%Lf", &x); }
~~~~~^~~~~~~~~~~
skyscraper.cpp: In function 'void fast_scan(char&)':
skyscraper.cpp:139:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%c", &x);
~~~~~^~~~~~~~~~
skyscraper.cpp: In function 'void fast_scan(std::__cxx11::string&)':
skyscraper.cpp:145:7: warning: ignoring return value of 'int scanf(const char*, ...)', declared with attribute warn_unused_result [-Wunused-result]
scanf("%s", string_in_buffer);
~~~~~^~~~~~~~~~~~~~~~~~~~~~~~
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
279 ms |
326144 KB |
Output is correct |
| 2 |
Correct |
249 ms |
326136 KB |
Output is correct |
| 3 |
Correct |
268 ms |
326064 KB |
Output is correct |
| 4 |
Correct |
241 ms |
326108 KB |
Output is correct |
| 5 |
Correct |
248 ms |
326264 KB |
Output is correct |
| 6 |
Correct |
245 ms |
326136 KB |
Output is correct |
| 7 |
Correct |
248 ms |
326136 KB |
Output is correct |
| 8 |
Correct |
250 ms |
326204 KB |
Output is correct |
| 9 |
Correct |
259 ms |
326136 KB |
Output is correct |
| 10 |
Correct |
244 ms |
326108 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
284 ms |
326160 KB |
Output is correct |
| 2 |
Correct |
252 ms |
326136 KB |
Output is correct |
| 3 |
Correct |
252 ms |
326136 KB |
Output is correct |
| 4 |
Correct |
269 ms |
326064 KB |
Output is correct |
| 5 |
Correct |
251 ms |
326008 KB |
Output is correct |
| 6 |
Correct |
248 ms |
326196 KB |
Output is correct |
| 7 |
Correct |
260 ms |
326136 KB |
Output is correct |
| 8 |
Correct |
249 ms |
326136 KB |
Output is correct |
| 9 |
Correct |
252 ms |
326084 KB |
Output is correct |
| 10 |
Correct |
258 ms |
326100 KB |
Output is correct |
| # |
결과 |
실행 시간 |
메모리 |
Grader output |
| 1 |
Correct |
279 ms |
326144 KB |
Output is correct |
| 2 |
Correct |
249 ms |
326136 KB |
Output is correct |
| 3 |
Correct |
268 ms |
326064 KB |
Output is correct |
| 4 |
Correct |
241 ms |
326108 KB |
Output is correct |
| 5 |
Correct |
248 ms |
326264 KB |
Output is correct |
| 6 |
Correct |
245 ms |
326136 KB |
Output is correct |
| 7 |
Correct |
248 ms |
326136 KB |
Output is correct |
| 8 |
Correct |
250 ms |
326204 KB |
Output is correct |
| 9 |
Correct |
259 ms |
326136 KB |
Output is correct |
| 10 |
Correct |
244 ms |
326108 KB |
Output is correct |
| 11 |
Correct |
284 ms |
326160 KB |
Output is correct |
| 12 |
Correct |
252 ms |
326136 KB |
Output is correct |
| 13 |
Correct |
252 ms |
326136 KB |
Output is correct |
| 14 |
Correct |
269 ms |
326064 KB |
Output is correct |
| 15 |
Correct |
251 ms |
326008 KB |
Output is correct |
| 16 |
Correct |
248 ms |
326196 KB |
Output is correct |
| 17 |
Correct |
260 ms |
326136 KB |
Output is correct |
| 18 |
Correct |
249 ms |
326136 KB |
Output is correct |
| 19 |
Correct |
252 ms |
326084 KB |
Output is correct |
| 20 |
Correct |
258 ms |
326100 KB |
Output is correct |
| 21 |
Correct |
288 ms |
326104 KB |
Output is correct |
| 22 |
Correct |
526 ms |
326176 KB |
Output is correct |
| 23 |
Correct |
326 ms |
326136 KB |
Output is correct |
| 24 |
Correct |
375 ms |
326140 KB |
Output is correct |
| 25 |
Correct |
354 ms |
326292 KB |
Output is correct |
| 26 |
Correct |
316 ms |
326212 KB |
Output is correct |
| 27 |
Correct |
314 ms |
326136 KB |
Output is correct |
| 28 |
Correct |
341 ms |
326180 KB |
Output is correct |
| 29 |
Correct |
382 ms |
326008 KB |
Output is correct |
| 30 |
Correct |
306 ms |
326240 KB |
Output is correct |
