// Krzysztof Małysa #include <bits/stdc++.h> using namespace std; #define FOR(i,a,n) for (auto i = (a), i ## __ = (n); i <= i ## __; ++i) #define FORD(i,a,n) for (auto i = (a), i ## __ = (n); i >= i ## __; --i) #define REP(i,n) FOR(i, 0, n - 1) #define ALL(x) x.begin(), x.end() #define SZ(x) (int(x.size())) #define EB emplace_back #define ST first #define ND second #define tpv typedef vector< typedef long long LL; typedef pair<int, int> PII; tpv int> VI; tpv VI> VVI; tpv PII> VPII; tpv LL> VLL; constexpr char nl = '\n'; #define endl nl #define ris return *this #define tem template<class T tem, class B> inline void mini(T&& a, B&& b) { if (b < a) a = b; } tem, class B> inline void maxi(T&& a, B&& b) { if (b > a) a = b; } int ceil2(int x) { return x < 2 ? 1 : 1 << (sizeof(x) * 8 - __builtin_clz(x - 1)); } tem> struct Dump { T a, b; }; tem> auto dump(T&& x) -> Dump<decltype(x.begin())> { return {ALL(x)}; } struct Debug { ~Debug() { cerr << endl; } tem> auto operator<<(T x) -> decltype(cerr << x, *this) { cerr << boolalpha << x; return *this; } tem> auto operator<<(T x) -> decltype(x.begin(), *this) { auto a = x.begin(), b = x.end(); *this << "{"; for (; a != b;) *this << *a++, *this << (a == b ? "" : " "); return *this << "}"; } tem, class B> Debug& operator<<(pair<T, B> p) { ris << "(" << p.ST << ", " << p.ND << ")"; } tem> Debug& operator<<(Dump<T> d) { *this << "{\n"; for (T a = d.a, c = a; a != d.b; ++a) *this << " " << distance(c, a) << ": " << *a << '\n'; ris << "}"; } }; struct Foo {tem>Foo& operator<<(T) {ris;}}; #ifdef DEBUG # define deb Debug() #else # define deb Foo() #endif #define imie(x...) #x ": " << (x) << " " #define LOG(x...) deb << imie(x) #define DOG(x...) deb << #x ": " << dump(x) << " " struct Chain { LL beg; // < 0 means that the chain is dead int elems, next_chain_id; }; ostream& operator <<(ostream& os, const Chain& x) { return os << "(" << x.beg << ", " << x.elems << ", " << x.next_chain_id << ")"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<Chain> chains; chains.EB(Chain{0, 1, 1}); REP (i, n) { LL x; cin >> x; if (x == chains.back().beg) ++chains.back().elems; else chains.EB(Chain{x, 1, SZ(chains) + 1}); } DOG(chains); VI d(m); for (int& x : d) cin >> x; auto merge_time = [&](int cid) { auto&& a = chains[cid]; auto&& b = chains[a.next_chain_id]; return (b.beg - a.beg + a.elems - 1) / a.elems; }; multimap<LL, int> events; // (when, id of the chain that will merge into the next one) REP (i, SZ(chains) - 1) events.emplace(merge_time(i), i); LOG(events); auto binomn2 = [](LL n) { return n * (n - 1) >> 1; }; LL res = 0, acc = 0; for (auto&& x : chains) acc += binomn2(x.elems); VLL answ(*max_element(ALL(d)) + 1); FOR (i, 1, SZ(answ) - 1) { res += acc; LOG(i) << imie(res); // Process events while (events.size() and events.begin()->ST <= i) { int id = events.begin()->ND; events.erase(events.begin()); if (chains[id].beg < 0) continue; // The chain has already been merged (null event) // Merge chains auto& a = chains[id]; auto& b = chains[a.next_chain_id]; res += (a.beg + a.elems * LL(i) - b.beg) * b.elems; acc -= binomn2(a.elems); acc -= binomn2(b.elems); // Update chains a.elems += b.elems; b.beg = -1; a.next_chain_id = b.next_chain_id; if (a.next_chain_id != SZ(chains)) events.emplace(merge_time(id), id); acc += binomn2(a.elems); } LOG(res); answ[i] = res; } for (int x : d) cout << answ[x] << nl; return 0; }
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32 33 34 35 36 37 38 39 40 41 42 43 44 45 46 47 48 49 50 51 52 53 54 55 56 57 58 59 60 61 62 63 64 65 66 67 68 69 70 71 72 73 74 75 76 77 78 79 80 81 82 83 84 85 86 87 88 89 90 91 92 93 94 95 96 97 98 99 100 101 102 103 104 105 106 107 108 109 110 111 112 113 114 115 116 117 118 119 120 121 122 123 124 125 126 127 128 129 130 131 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 | // Krzysztof Małysa #include <bits/stdc++.h> using namespace std; #define FOR(i,a,n) for (auto i = (a), i ## __ = (n); i <= i ## __; ++i) #define FORD(i,a,n) for (auto i = (a), i ## __ = (n); i >= i ## __; --i) #define REP(i,n) FOR(i, 0, n - 1) #define ALL(x) x.begin(), x.end() #define SZ(x) (int(x.size())) #define EB emplace_back #define ST first #define ND second #define tpv typedef vector< typedef long long LL; typedef pair<int, int> PII; tpv int> VI; tpv VI> VVI; tpv PII> VPII; tpv LL> VLL; constexpr char nl = '\n'; #define endl nl #define ris return *this #define tem template<class T tem, class B> inline void mini(T&& a, B&& b) { if (b < a) a = b; } tem, class B> inline void maxi(T&& a, B&& b) { if (b > a) a = b; } int ceil2(int x) { return x < 2 ? 1 : 1 << (sizeof(x) * 8 - __builtin_clz(x - 1)); } tem> struct Dump { T a, b; }; tem> auto dump(T&& x) -> Dump<decltype(x.begin())> { return {ALL(x)}; } struct Debug { ~Debug() { cerr << endl; } tem> auto operator<<(T x) -> decltype(cerr << x, *this) { cerr << boolalpha << x; return *this; } tem> auto operator<<(T x) -> decltype(x.begin(), *this) { auto a = x.begin(), b = x.end(); *this << "{"; for (; a != b;) *this << *a++, *this << (a == b ? "" : " "); return *this << "}"; } tem, class B> Debug& operator<<(pair<T, B> p) { ris << "(" << p.ST << ", " << p.ND << ")"; } tem> Debug& operator<<(Dump<T> d) { *this << "{\n"; for (T a = d.a, c = a; a != d.b; ++a) *this << " " << distance(c, a) << ": " << *a << '\n'; ris << "}"; } }; struct Foo {tem>Foo& operator<<(T) {ris;}}; #ifdef DEBUG # define deb Debug() #else # define deb Foo() #endif #define imie(x...) #x ": " << (x) << " " #define LOG(x...) deb << imie(x) #define DOG(x...) deb << #x ": " << dump(x) << " " struct Chain { LL beg; // < 0 means that the chain is dead int elems, next_chain_id; }; ostream& operator <<(ostream& os, const Chain& x) { return os << "(" << x.beg << ", " << x.elems << ", " << x.next_chain_id << ")"; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, m; cin >> n >> m; vector<Chain> chains; chains.EB(Chain{0, 1, 1}); REP (i, n) { LL x; cin >> x; if (x == chains.back().beg) ++chains.back().elems; else chains.EB(Chain{x, 1, SZ(chains) + 1}); } DOG(chains); VI d(m); for (int& x : d) cin >> x; auto merge_time = [&](int cid) { auto&& a = chains[cid]; auto&& b = chains[a.next_chain_id]; return (b.beg - a.beg + a.elems - 1) / a.elems; }; multimap<LL, int> events; // (when, id of the chain that will merge into the next one) REP (i, SZ(chains) - 1) events.emplace(merge_time(i), i); LOG(events); auto binomn2 = [](LL n) { return n * (n - 1) >> 1; }; LL res = 0, acc = 0; for (auto&& x : chains) acc += binomn2(x.elems); VLL answ(*max_element(ALL(d)) + 1); FOR (i, 1, SZ(answ) - 1) { res += acc; LOG(i) << imie(res); // Process events while (events.size() and events.begin()->ST <= i) { int id = events.begin()->ND; events.erase(events.begin()); if (chains[id].beg < 0) continue; // The chain has already been merged (null event) // Merge chains auto& a = chains[id]; auto& b = chains[a.next_chain_id]; res += (a.beg + a.elems * LL(i) - b.beg) * b.elems; acc -= binomn2(a.elems); acc -= binomn2(b.elems); // Update chains a.elems += b.elems; b.beg = -1; a.next_chain_id = b.next_chain_id; if (a.next_chain_id != SZ(chains)) events.emplace(merge_time(id), id); acc += binomn2(a.elems); } LOG(res); answ[i] = res; } for (int x : d) cout << answ[x] << nl; return 0; } |