#include <bits/stdc++.h> using namespace std; #define PII pair<int, int> #define VI vector<int> #define VPII vector<PII> #define LL long long #define LD long double #define f first #define s second #define MP make_pair #define PB push_back #define endl '\n' #define ALL(c) (c).begin(), (c).end() #define SIZ(c) (int)(c).size() #define REP(i, n) for (int i = 0; i < (int)(n); i++) #define FOR(i, b, e) for (int i = (b); i <= (int)(e); i++) #define FORD(i, b, e) for (int i = (b); i >= (int)(e); i--) #define ll long long #define st f #define nd s #define pb PB #define eb emplace_back #define mp make_pair const int inf = 1e9 + 7; const LL INF = 1e18L + 7; #include "message.h" #include "teatr.h" const int nax = 1e6+7; const int segs = 13; // segs < nodes! int n, nodes, id, len; ll ans; int fen[nax]; int suf[nax]; VPII prze, pary; inline void add(int x) { while(x) { fen[x]++; x -= x&-x; } } inline int ask(int x) { int ans = 0; while(x<nax) { ans += fen[x]; x += x&-x; } return ans; } void one(int a, int b) { memset(fen, 0, sizeof fen); for(int i = a; i <= b; ++i) { int curr = GetElement(i); ans += ask(curr+1); add(curr); } } void two(int a, int b, int c, int d) { memset(suf, 0, sizeof suf); for(int i = a; i <= b; ++i) { int curr = GetElement(i); ++suf[curr]; } for(int i = nax-2; i >= 0; --i) { suf[i] += suf[i+1]; } for(int i = c; i <= d; ++i) { int curr = GetElement(i); ans += suf[curr+1]; } } int sufit(int a, int b) { return (a+b-1)/b; } int32_t main() { n = GetN(); nodes = NumberOfNodes(); id = MyNodeId(); len = sufit(n, segs); for(int i = 0; i < segs; ++i) { int l = i*len; int r = min(l+len-1, n-1); if(l<=r) prze.eb(l, r); } for(int i = 0; i < prze.size(); ++i) { for(int j = i+1; j < prze.size(); ++j) { pary.eb(i, j); } } int zajete = prze.size(); int wolne = nodes - zajete; if(id<zajete) { int a = prze[id].st; int b = prze[id].nd; one(a, b); PutLL(0, ans); Send(0); } else { for(int i = id-zajete; i < (int)pary.size(); i += wolne) { int s1 = pary[i].st; int s2 = pary[i].nd; int a = prze[s1].st; int b = prze[s1].nd; int c = prze[s2].st; int d = prze[s2].nd; two(a, b, c, d); } PutLL(0, ans); Send(0); } if(id==0) { ll sum = 0; for(int i = 0; i < nodes; ++i) { Receive(i); sum += GetLL(i); } cout << sum << endl; 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 | #include <bits/stdc++.h> using namespace std; #define PII pair<int, int> #define VI vector<int> #define VPII vector<PII> #define LL long long #define LD long double #define f first #define s second #define MP make_pair #define PB push_back #define endl '\n' #define ALL(c) (c).begin(), (c).end() #define SIZ(c) (int)(c).size() #define REP(i, n) for (int i = 0; i < (int)(n); i++) #define FOR(i, b, e) for (int i = (b); i <= (int)(e); i++) #define FORD(i, b, e) for (int i = (b); i >= (int)(e); i--) #define ll long long #define st f #define nd s #define pb PB #define eb emplace_back #define mp make_pair const int inf = 1e9 + 7; const LL INF = 1e18L + 7; #include "message.h" #include "teatr.h" const int nax = 1e6+7; const int segs = 13; // segs < nodes! int n, nodes, id, len; ll ans; int fen[nax]; int suf[nax]; VPII prze, pary; inline void add(int x) { while(x) { fen[x]++; x -= x&-x; } } inline int ask(int x) { int ans = 0; while(x<nax) { ans += fen[x]; x += x&-x; } return ans; } void one(int a, int b) { memset(fen, 0, sizeof fen); for(int i = a; i <= b; ++i) { int curr = GetElement(i); ans += ask(curr+1); add(curr); } } void two(int a, int b, int c, int d) { memset(suf, 0, sizeof suf); for(int i = a; i <= b; ++i) { int curr = GetElement(i); ++suf[curr]; } for(int i = nax-2; i >= 0; --i) { suf[i] += suf[i+1]; } for(int i = c; i <= d; ++i) { int curr = GetElement(i); ans += suf[curr+1]; } } int sufit(int a, int b) { return (a+b-1)/b; } int32_t main() { n = GetN(); nodes = NumberOfNodes(); id = MyNodeId(); len = sufit(n, segs); for(int i = 0; i < segs; ++i) { int l = i*len; int r = min(l+len-1, n-1); if(l<=r) prze.eb(l, r); } for(int i = 0; i < prze.size(); ++i) { for(int j = i+1; j < prze.size(); ++j) { pary.eb(i, j); } } int zajete = prze.size(); int wolne = nodes - zajete; if(id<zajete) { int a = prze[id].st; int b = prze[id].nd; one(a, b); PutLL(0, ans); Send(0); } else { for(int i = id-zajete; i < (int)pary.size(); i += wolne) { int s1 = pary[i].st; int s2 = pary[i].nd; int a = prze[s1].st; int b = prze[s1].nd; int c = prze[s2].st; int d = prze[s2].nd; two(a, b, c, d); } PutLL(0, ans); Send(0); } if(id==0) { ll sum = 0; for(int i = 0; i < nodes; ++i) { Receive(i); sum += GetLL(i); } cout << sum << endl; return 0; } } |