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
// Jedna instancja wypisuje maksymalny wzrost.
#ifndef LOCAL
#pragma GCC optimize("O3")
#endif
#include "message.h"
#include "teatr.h"
#include <bits/stdc++.h>
using namespace std;
#define sim template <class c
#define mor > muu & operator<< (
#define ris return *this
#define R22(r) sim> typename enable_if<1 r sizeof(dud<c>(0)), muu&>::type operator<<(c g) {
sim> struct rge {c h, n;};
sim> rge<c> range(c h, c n) {return rge<c>{h, n};}
sim, class F> struct rgm {c h, n; F f;};
sim, class F> rgm<c, F> map_range(c b, c e, F f) {return rgm<c, F>{b, e, f};}
sim, class F> rgm<typename c::const_iterator, F> map_range(const c &x, F f) {return map_range(x.begin(), x.end(), f);}
sim> auto dud(c *r) -> decltype(cerr << *r);
sim> char dud(...);
struct muu {
#ifdef LOCAL
	stringstream a;
	~muu() {cerr << a.str() << endl;}
	R22(<) a << boolalpha << g; ris;}
	R22(==) ris << range(begin(g), end(g));}
	sim mor rge<c> u) {
		a << '{';
		for (c s = u.h; s != u.n; ++s)
			*this << ", " + 2 * (s == u.h) << *s;
		ris << '}';
	}
	sim, class n mor pair <c,n> r) {ris << "(" << r.first << ", " << r.second << ")";}
	sim, class F mor rgm<c, F> u) {
		for (c s = u.h; s != u.n; ++s)
			u.f(*this << ", " + 2 * (s == u.h), *s);
		ris;
	}
	#else
	sim mor const c&) {ris;}
	#endif
	muu & operator()() {ris;}
};
const int myID = MyNodeId();
#define debug (muu() << "Node " << myID << "_" << __FUNCTION__ << "#" << __LINE__ << ": ")
#define imie(r) "[" #r ": " << (r) << "] "
#define imask(r) "[" #r ": " << bitset<8 * sizeof(r)>(r) << "] "
#define arr(a, i) "[" #a imie(i) ": " << a[i] << "] "
#define arr2(a, i, j) "[" #a imie(i) imie(j) << ": " << a[i][j] << "] "
const int M = 25;
const int nax = 1e6 + 2;
const int nodes = 100;
int tab[nax];
void add(int x) {
	while (x < nax) {
		tab[x]++;
		x += x & -x;
	}
}
int read(int x) {
	debug << imie(x);
	int ans = 0;
	while (x) {
		ans += tab[x];
		x -= x & -x;
	}
	debug << imie(ans);
	return ans;
}
int n;
int getl(int x) {
	return n * 1ll * x / M;
}
int getr(int x) {
	return n * 1ll * (x + 1) / M;
}
int main() {
	n = GetN();
	long long ans = 0;
	if (myID < M) {
		int l = getl(myID);
		int r = getr(myID);
		debug << imie(l) imie(r);
		int bef = 0;
		for (int i = l; i < r; ++i) {
			int x = GetElement(i);
			ans += bef - read(x);
			bef++;
			add(x);
		}
		debug << imie(ans);
	}
	else {
		int cou = 0;
		bool first = true;
		for (int i = 0; i < M; ++i)
			for (int j = i + 1; j < M; ++j) {
				if ((cou++) % (nodes - M) == myID - M) {
					if (!first)
						memset(tab, 0, sizeof(tab));
					first = false;
					int l1 = getl(i), r1 = getr(i);
					int l2 = getl(j), r2 = getr(j);
					for (int x = l1; x < r1; ++x)
						tab[GetElement(x)]++;
					for (int x = nax - 1; x > 0; --x)
						tab[x - 1] += tab[x];
					debug << imie(l1) imie(r1) << range(tab, tab + 10);
					for (int x = l2; x < r2; ++x)
						ans += tab[GetElement(x) + 1];
				}
			}
	}
	if (myID == 0) {
		for (int i = 1; i < nodes; ++i) {
			Receive(i);
			ans += GetLL(i);
		}
		printf("%lld\n", ans);
	}
	else {
		PutLL(0, ans);
		Send(0);
	}
}