結果
問題 | No.694 square1001 and Permutation 3 |
ユーザー |
|
提出日時 | 2018-06-08 23:27:07 |
言語 | C++17 (gcc 13.3.0 + boost 1.87.0) |
結果 |
AC
|
実行時間 | 1,647 ms / 3,000 ms |
コード長 | 10,951 bytes |
コンパイル時間 | 6,520 ms |
コンパイル使用メモリ | 231,572 KB |
最終ジャッジ日時 | 2025-01-05 10:56:04 |
ジャッジサーバーID (参考情報) |
judge1 / judge4 |
(要ログイン)
ファイルパターン | 結果 |
---|---|
sample | AC * 1 |
other | AC * 13 |
ソースコード
#pragma GCC optimize ("O3")#include "bits/stdc++.h"using namespace std;using ll = long long int;#define debug(v) {printf("L%d %s > ",__LINE__,#v);cout<<(v)<<endl;}#define debugv(v) {printf("L%d %s > ",__LINE__,#v);for(auto e:(v)){cout<<e<<" ";}cout<<endl;}#define debuga(m,w) {printf("L%d %s > ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;}#define debugaa(m,h,w) {printf("L%d %s >\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}}#define ALL(v) (v).begin(),(v).end()#define repeat(cnt,l) for(remove_const<decltype(l)>::type cnt=0;(cnt)<(l);++(cnt))#define rrepeat(cnt,l) for(auto cnt=(l)-1;0<=(cnt);--(cnt))#define iterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);++(cnt))#define diterate(cnt,b,e) for(auto cnt=(b);(cnt)!=(e);--(cnt))const ll MD = 1000000007ll; const long double PI = 3.1415926535897932384626433832795L;template<typename T1, typename T2> inline void assert_equal(T1 expected, T2 actual) { if (!(expected == actual)) { cerr << "assertion fault: expected=" << expected << " actual=" << actual << endl; abort(); } }template<typename T1, typename T2> inline void assert_less(T1 actual, T2 threshold) { if (!(actual < threshold)) { cerr << "assertion fault: " <<actual << " < (const)" << threshold << endl; abort(); } }template<typename T1, typename T2> inline void assert_eqless(T1 actual, T2 threshold) { if (!(actual <= threshold)) { cerr << "assertion fault: " <<actual << " <= (const)" << threshold << endl; abort(); } }template<typename T1, typename T2> inline ostream& operator <<(ostream &o, const pair<T1, T2> p) { o << '(' << p.first << ':' << p.second << ')';return o; }template<typename Vec> inline ostream& _ostream_vecprint(ostream &o, const Vec& p) { o << '['; for (auto& e : p) o << e << ','; o << ']'; return o; }template<typename T> inline ostream& operator<<(ostream& o, const vector<T>& v) { return _ostream_vecprint(o, v); }template<typename T, size_t S> inline ostream& operator<<(ostream& o, const array<T, S>& v) { return _ostream_vecprint(o, v); }template<typename T> inline T& maxset(T& to, const T& val) { return to = max(to, val); }template<typename T> inline T& minset(T& to, const T& val) { return to = min(to, val); }void bye(string s, int code = 0) { cout << s << endl; exit(code); }mt19937_64 randdev(8901016);template<typename T> inline T rand(T l, T h) { return uniform_int_distribution<T>(l, h)(randdev); }template<> inline double rand<double>(double l, double h) { return uniform_real_distribution<double>(l, h)(randdev); }template<> inline float rand<float>(float l, float h) { return uniform_real_distribution<float>(l, h)(randdev); }#if defined(_WIN32) || defined(_WIN64)#define getchar_unlocked _getchar_nolock#define putchar_unlocked _putchar_nolock#elif defined(__GNUC__)#else#define getchar_unlocked getchar#define putchar_unlocked putchar#endifnamespace {#define isvisiblechar(c) (0x21<=(c)&&(c)<=0x7E)class MaiScanner {public:template<typename T> void input_integer(T& var) {var = 0; T sign = 1;int cc = getchar_unlocked();for (; cc<'0' || '9'<cc; cc = getchar_unlocked())if (cc == '-') sign = -1;for (; '0' <= cc && cc <= '9'; cc = getchar_unlocked())var = (var << 3) + (var << 1) + cc - '0';var = var * sign;}inline int c() { return getchar_unlocked(); }inline MaiScanner& operator>>(int& var) { input_integer<int>(var); return *this; }inline MaiScanner& operator>>(long long& var) { input_integer<long long>(var); return *this; }inline MaiScanner& operator>>(string& var) {int cc = getchar_unlocked();for (; !isvisiblechar(cc); cc = getchar_unlocked());for (; isvisiblechar(cc); cc = getchar_unlocked())var.push_back(cc);return *this;}template<typename IT> void in(IT begin, IT end) { for (auto it = begin; it != end; ++it) *this >> *it; }};class MaiPrinter {public:template<typename T>void output_integer(T var) {if (var == 0) { putchar_unlocked('0'); return; }if (var < 0)putchar_unlocked('-'),var = -var;char stack[32]; int stack_p = 0;while (var)stack[stack_p++] = '0' + (var % 10),var /= 10;while (stack_p)putchar_unlocked(stack[--stack_p]);}inline MaiPrinter& operator<<(char c) { putchar_unlocked(c); return *this; }inline MaiPrinter& operator<<(int var) { output_integer<int>(var); return *this; }inline MaiPrinter& operator<<(long long var) { output_integer<long long>(var); return *this; }inline MaiPrinter& operator<<(char* str_p) { while (*str_p) putchar_unlocked(*(str_p++)); return *this; }inline MaiPrinter& operator<<(const string& str) {const char* p = str.c_str();const char* l = p + str.size();while (p < l) putchar_unlocked(*p++);return *this;}template<typename IT> void join(IT begin, IT end, char sep = '\n') { for (auto it = begin; it != end; ++it) *this << *it << sep; }};}MaiScanner scanner;MaiPrinter printer;template<typename T>//typedef ll T;class SegmentTree {int size_;vector<T> valdata_;vector<T> addtree_;vector<T> maxtree_;int _geti(const vector<T>& v, int idx) const {if (size_ - 1 <= idx) return (idx - size_ + 1);// if (idx < 0) return idx;return v[idx];}public:SegmentTree(int n) {size_ = 8;while (size_ < n) size_ <<= 1;maxtree_.resize(size_);valdata_.resize(size_);addtree_.resize(size_);flat();}// tree初期化void flat() {for (int i = size_ - 2; 0 <= i; --i) {int c = 2 * i + 1;if (size_ - 1 <= c) {maxtree_[i] = c - size_ + 1;}else {maxtree_[i] = maxtree_[c];}}}// addtreeを0にして,valdataに加算する.// void apply(T sum = 0, int ptr = 0) {// if (size_ - 1 <= ptr) {// valdata_[ptr - size_ + 1] += sum;// }// else {// sum += addtree_[ptr];// apply(sum, ptr * 2 + 1);// apply(sum, ptr * 2 + 2);// addtree_[ptr] = 0;// }// }void fill(T val) {std::fill(valdata_.begin(), valdata_.end(), val);std::fill(addtree_.begin(), addtree_.end(), 0);flat();}// T operator[](int index) const {//// }T get_val(int index) const {T sum = valdata_[index];index += size_ - 1;while (0 < index) {index = (index - 1) / 2; // 親へ移動sum += addtree_[index];}return sum;}void set_val(int index, const T e) {valdata_[index] = e;for (int i = index + size_ - 1; 0 < i;) {i = (i - 1) / 2; // 親へ移動valdata_[index] -= addtree_[i];}index += size_ - 1;while (0 < index) {index = (index - 1) / 2; // 親へ移動int c1 = index * 2 + 1;int c2 = index * 2 + 2;int i1, i2;i1 = _geti(maxtree_, c1);i2 = _geti(maxtree_, c2);maxtree_[index] = get_val(i1) > get_val(i2) ? i1 : i2;}}void _add_valrange(int begin, int end, const T e, int ptr, int rangebegin, int rangeend) {if (rangeend <= begin || end <= rangebegin) return;if (begin <= rangebegin && rangeend <= end) {if (size_ - 1 <= ptr)valdata_[ptr - size_ + 1] += e;elseaddtree_[ptr] += e;return;}int rangemid = (rangebegin + rangeend) / 2;_add_valrange(begin, end, e, ptr * 2 + 1, rangebegin, rangemid);_add_valrange(begin, end, e, ptr * 2 + 2, rangemid, rangeend);int i1, i2;i1 = _geti(maxtree_, ptr * 2 + 1);i2 = _geti(maxtree_, ptr * 2 + 2);maxtree_[ptr] = get_val(i1) > get_val(i2) ? i1 : i2;}int _get_maxrangeIdx(int begin, int end, int ptr, int rangebegin, int rangeend) const {if (rangeend <= begin || end <= rangebegin) return begin; // note:範囲外なら適当な範囲内のindexを返すif (begin <= rangebegin && rangeend <= end) return _geti(maxtree_, ptr);int rangemid = (rangebegin + rangeend) / 2;int l = _get_maxrangeIdx(begin, end, ptr * 2 + 1, rangebegin, rangemid);int r = _get_maxrangeIdx(begin, end, ptr * 2 + 2, rangemid, rangeend);if (get_val(l) >= get_val(r))return l;elsereturn r;}inline void add_valrange(int begin, int end, const T e) {_add_valrange(begin, end, e, 0, 0, size_);}inline int get_maxrangeIdx(int begin, int end) const {return _get_maxrangeIdx(begin, end, 0, 0, size_);}inline T get_maxrange(int begin, int end) {return get_val(_get_maxrangeIdx(begin, end, 0, 0, size_));}};// http://www.prefield.com/algorithm/sort/mergecount.htmlll mergecount(vector<int> &a) {ll count = 0;ll n = a.size();if (n > 1) {vector<int> b(a.begin(), a.begin() + n / 2);vector<int> c(a.begin() + n / 2, a.end());count += mergecount(b);count += mergecount(c);for (int i = 0, j = 0, k = 0; i < n; ++i)if (k == c.size()) a[i] = b[j++];else if (j == b.size()) a[i] = c[k++];else if (b[j] <= c[k]) a[i] = b[j++];else { a[i] = c[k++]; count += n / 2 - j; }}return count;}ll N;vector<int> aa;int main() {scanner >> N;aa.resize(N);scanner.in(ALL(aa));ll tr = 0;{auto aa_cp = aa;tr = mergecount(aa_cp);}printer << tr << '\n';map<ll,pair<ll,ll>> cnt_grle; // <greater,lesser>{map<ll,ll> cnt;for (auto e : aa) cnt[e]++;ll sum = 0;for (auto p : cnt)cnt_grle[p.first].second = sum,sum += p.second;sum = 0;iterate(it, cnt.rbegin(), cnt.rend())cnt_grle[it->first].first = sum,sum += it->second;}repeat(i, N - 1) {ll a = aa[i];// tr += N - a - (a - 1); // <= 順列の場合tr += cnt_grle[a].first - cnt_grle[a].second;printer << tr << '\n';// debug// auto aa_cp = aa;// rotate(aa_cp.begin(), aa_cp.begin()+i+1, aa_cp.end());// debug(mergecount(aa_cp));}return 0;}