#include <cstdlib> #include <cstdio> #include <algorithm> #include <vector> #include "message.h" #include "teatr.h" void merge_nums(std::vector<long long int> & numsL, const std::vector<long long int> & numsR) { std::vector<long long int> result(6, 0LL); size_t iL = 1, iR = 1; while(iL < numsL.size() && numsL[iL] == 0) ++iL; while(iR < numsR.size() && numsR[iR] == 0) ++iR; while(iL < numsL.size() && iR < numsR.size()) { if(iL <= iR) { result[iL] += numsL[iL]; do ++iL; while(iL < numsL.size() && numsL[iL] == 0); } else { for(size_t j = iL; j < numsL.size(); ++j) result[0] += numsL[j] * numsR[iR]; result[iR] += numsR[iR]; do ++iR; while(iR < numsR.size() && numsR[iR] == 0); } } while(iL < numsL.size()) { result[iL] += numsL[iL]; ++iL; } while(iR < numsR.size()) { result[iR] += numsR[iR]; ++iR; } result[0] += numsL[0] + numsR[0]; numsL = result; } int merge(std::vector<int> & vt, int beg, int mid, int end, long long int invs) { int w[end - beg + 1], l1 = beg, l2 = mid + 1, lp = 0; while(l1 <= mid && l2 <= end) { if(vt[l1] <= vt[l2]) { w[lp] = vt[l1]; ++l1; } else { w[lp] = vt[l2]; invs += (mid - l1 + 1); ++l2; } ++lp; } for(int i = l1; i <= mid; ++i) { w[lp] = vt[i]; ++lp; } for(int i = l2; i <= end; ++i) { w[lp] = vt[i]; ++lp; } for(int i = 0; i <= end - beg; ++i) vt[beg + i] = w[i]; return invs; } int merge_invs(std::vector<int> & vt, int p, int q, long long int invs) { if(p < q) { int s = (p + q) / 2; invs = merge_invs(vt, p, s, invs); invs = merge_invs(vt, s + 1, q, invs); invs = merge(vt, p, s, q, invs); } return invs; } std::vector<long long int> counts(std::vector<int> & vt, int p, int q) { std::vector<long long int> cnts(6, 0LL); cnts[0] = merge_invs(vt, p, q, 0LL); for(int i = p; i <= q; ++i) if(vt[i] <= 5) ++cnts[vt[i]]; return cnts; } int main() { int n = GetN(), id = MyNodeId(), nds = NumberOfNodes(); std::vector<int> v; if(n <= 500000) { if(id > 0) return 0; for(int i = 0; i < n; ++i) v.push_back(GetElement(i)); long long int invs = merge_invs(v, 0, v.size() - 1, 0); printf("%lld\n", invs); } else { for(int i = id * n / nds; i < (id + 1) * n / nds; ++i) v.push_back(GetElement(i)); std::vector<long long int> cnts = counts(v, 0, v.size() - 1); if(id > 0) { for(int x : cnts) PutLL(0, x); Send(0); } else { for(int i = 1; i < nds; ++i) { std::vector<long long int> recv; Receive(i); for(int j = 0; j < 6; ++j) recv.push_back(GetLL(i)); merge_nums(cnts, recv); } printf("%lld\n", cnts[0]); } } 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 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 | #include <cstdlib> #include <cstdio> #include <algorithm> #include <vector> #include "message.h" #include "teatr.h" void merge_nums(std::vector<long long int> & numsL, const std::vector<long long int> & numsR) { std::vector<long long int> result(6, 0LL); size_t iL = 1, iR = 1; while(iL < numsL.size() && numsL[iL] == 0) ++iL; while(iR < numsR.size() && numsR[iR] == 0) ++iR; while(iL < numsL.size() && iR < numsR.size()) { if(iL <= iR) { result[iL] += numsL[iL]; do ++iL; while(iL < numsL.size() && numsL[iL] == 0); } else { for(size_t j = iL; j < numsL.size(); ++j) result[0] += numsL[j] * numsR[iR]; result[iR] += numsR[iR]; do ++iR; while(iR < numsR.size() && numsR[iR] == 0); } } while(iL < numsL.size()) { result[iL] += numsL[iL]; ++iL; } while(iR < numsR.size()) { result[iR] += numsR[iR]; ++iR; } result[0] += numsL[0] + numsR[0]; numsL = result; } int merge(std::vector<int> & vt, int beg, int mid, int end, long long int invs) { int w[end - beg + 1], l1 = beg, l2 = mid + 1, lp = 0; while(l1 <= mid && l2 <= end) { if(vt[l1] <= vt[l2]) { w[lp] = vt[l1]; ++l1; } else { w[lp] = vt[l2]; invs += (mid - l1 + 1); ++l2; } ++lp; } for(int i = l1; i <= mid; ++i) { w[lp] = vt[i]; ++lp; } for(int i = l2; i <= end; ++i) { w[lp] = vt[i]; ++lp; } for(int i = 0; i <= end - beg; ++i) vt[beg + i] = w[i]; return invs; } int merge_invs(std::vector<int> & vt, int p, int q, long long int invs) { if(p < q) { int s = (p + q) / 2; invs = merge_invs(vt, p, s, invs); invs = merge_invs(vt, s + 1, q, invs); invs = merge(vt, p, s, q, invs); } return invs; } std::vector<long long int> counts(std::vector<int> & vt, int p, int q) { std::vector<long long int> cnts(6, 0LL); cnts[0] = merge_invs(vt, p, q, 0LL); for(int i = p; i <= q; ++i) if(vt[i] <= 5) ++cnts[vt[i]]; return cnts; } int main() { int n = GetN(), id = MyNodeId(), nds = NumberOfNodes(); std::vector<int> v; if(n <= 500000) { if(id > 0) return 0; for(int i = 0; i < n; ++i) v.push_back(GetElement(i)); long long int invs = merge_invs(v, 0, v.size() - 1, 0); printf("%lld\n", invs); } else { for(int i = id * n / nds; i < (id + 1) * n / nds; ++i) v.push_back(GetElement(i)); std::vector<long long int> cnts = counts(v, 0, v.size() - 1); if(id > 0) { for(int x : cnts) PutLL(0, x); Send(0); } else { for(int i = 1; i < nds; ++i) { std::vector<long long int> recv; Receive(i); for(int j = 0; j < 6; ++j) recv.push_back(GetLL(i)); merge_nums(cnts, recv); } printf("%lld\n", cnts[0]); } } return 0; } |