#include <iostream> #include <vector> #include "message.h" #include "teatr.h" using namespace std; typedef long long ll; int* tmp; const int lim = 1e6; ll count_inv(int* a, int s, int t) { if (s+1 == t) return 0; if (s+2 == t) { if (a[s] > a[s+1]) { swap(a[s], a[s+1]); return 1; } else { return 0; } } int m = (s+t) / 2; ll inv = count_inv(a, s, m) + count_inv(a, m, t); for (int i = s; i < t; i++) { tmp[i] = a[i]; } int it = s, l = s, r = m; while (l < m && r < t) { if (tmp[l] <= tmp[r]) { a[it++] = tmp[l++]; } else { inv += m - l; a[it++] = tmp[r++]; } } while (l < m) { a[it++] = tmp[l++]; } while (r < t) { a[it++] = tmp[r++]; } return inv; } int main() { ios_base::sync_with_stdio(0); int id = MyNodeId(); int n = GetN(); int num_nodes = NumberOfNodes(); if (n < num_nodes) { if (id == 0) { num_nodes = 1; } else { return 0; } } int per_node = n / num_nodes; int s = per_node * id, t = per_node * (id + 1); s += min(id, n % num_nodes); t += min(id+1, n % num_nodes); int* a = new int[t - s]; tmp = new int[t - s]; for (int i = s; i < t; i++) { a[i - s] = GetElement(i); } ll local_inv = count_inv(a, 0, t - s); delete[] tmp; if (id > 0) { ll* p = new ll[lim](); for (int i = 0; i < s; i++) { p[GetElement(i)-1]++; } ll gt = 0, gte; for (int i = lim-1; i >= 0; i--) { gte = p[i] + gt; p[i] = gt; gt = gte; } for (int i = s; i < t; i++) { local_inv += p[a[i-s]-1]; } delete[] p; } delete[] a; if (id == 0) { ll sum_inv = local_inv; for (int i = 1; i < num_nodes; i++) { int inst = Receive(-1); sum_inv += GetLL(inst); } cout << sum_inv << endl; } else { PutLL(0, local_inv); Send(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 | #include <iostream> #include <vector> #include "message.h" #include "teatr.h" using namespace std; typedef long long ll; int* tmp; const int lim = 1e6; ll count_inv(int* a, int s, int t) { if (s+1 == t) return 0; if (s+2 == t) { if (a[s] > a[s+1]) { swap(a[s], a[s+1]); return 1; } else { return 0; } } int m = (s+t) / 2; ll inv = count_inv(a, s, m) + count_inv(a, m, t); for (int i = s; i < t; i++) { tmp[i] = a[i]; } int it = s, l = s, r = m; while (l < m && r < t) { if (tmp[l] <= tmp[r]) { a[it++] = tmp[l++]; } else { inv += m - l; a[it++] = tmp[r++]; } } while (l < m) { a[it++] = tmp[l++]; } while (r < t) { a[it++] = tmp[r++]; } return inv; } int main() { ios_base::sync_with_stdio(0); int id = MyNodeId(); int n = GetN(); int num_nodes = NumberOfNodes(); if (n < num_nodes) { if (id == 0) { num_nodes = 1; } else { return 0; } } int per_node = n / num_nodes; int s = per_node * id, t = per_node * (id + 1); s += min(id, n % num_nodes); t += min(id+1, n % num_nodes); int* a = new int[t - s]; tmp = new int[t - s]; for (int i = s; i < t; i++) { a[i - s] = GetElement(i); } ll local_inv = count_inv(a, 0, t - s); delete[] tmp; if (id > 0) { ll* p = new ll[lim](); for (int i = 0; i < s; i++) { p[GetElement(i)-1]++; } ll gt = 0, gte; for (int i = lim-1; i >= 0; i--) { gte = p[i] + gt; p[i] = gt; gt = gte; } for (int i = s; i < t; i++) { local_inv += p[a[i-s]-1]; } delete[] p; } delete[] a; if (id == 0) { ll sum_inv = local_inv; for (int i = 1; i < num_nodes; i++) { int inst = Receive(-1); sum_inv += GetLL(inst); } cout << sum_inv << endl; } else { PutLL(0, local_inv); Send(0); } return 0; } |