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
#include <iostream>
#include <cstdio>
#include <vector>
#include <set>
#include <algorithm>
#include "message.h"
#include "dzialka.h"

using namespace std;

int n, m, nr, pocz, kon, dl, gdzie, b, e;
long long result;
bool tab[855][75105];
int gora[75105];
int spod[75105];

int lewo[75105];
int prawo[75105];

vector < pair <int, int> > v;
set <int> s;
set <int>::iterator it;

long long res[105];
unsigned long long wynik;

/*int GetFieldHeight() {}
int GetFieldWidth() {}
int IsUsableCell(int aa, int bb) {}
int MyNodeId() {}
void Receive(int aa) {}
int GetInt(int aa) {}
long long GetLL(int aa) {}
void Send(int aa) {}
void PutInt(int aa, int bb) {}
void PutLL(int aa, long long bb) {}*/

int main ()
{
	n = GetFieldHeight();
	m = GetFieldWidth();
	nr = MyNodeId();
	pocz = (n / 100) * nr;
	if (nr != 99) kon = (n / 100) * (nr + 1);
	else kon = n;
	dl = kon - pocz;
	for (int i = 0; i < dl; ++i) for (int j = 0; j < m; ++j) tab[i][j] = IsUsableCell(pocz + i, j);
	for (int j = 0; j < m; ++j)
	{
		for (int i = dl - 1; i >= 0; --i)
		{
			if (tab[i][j] == 1) gora[j]++;
			else break;
		}
	}
	if (m <= 750 && m > 0)
	{
		if (nr > 0)
		{
			Receive(nr - 1);
			for (int i = 0; i < m; ++i) spod[i] = GetInt(nr - 1);
			for (int i = 0; i < m; ++i) if (gora[i] == dl) gora[i] += spod[i];
		}
		if (nr != 99)
		{
			for (int i = 0; i < m; ++i) PutInt(nr + 1, gora[i]);
			Send(nr + 1);
		}
	}
	if (m > 750)
	{
		for (int kk = 0; kk < 100; ++kk)
		{
			b = (m / 100) * kk;
			e = (m / 100) * (kk + 1);
			if (kk == 99) e = m;
			if (nr > 0)
			{
				Receive(nr - 1);
				for (int i = b; i < e; ++i) spod[i] = GetInt(nr - 1);
				for (int i = b; i < e; ++i) if (gora[i] == dl) gora[i] += spod[i];
			}
			if (nr != 99)
			{
				for (int i = b; i < e; ++i) PutInt(nr + 1, gora[i]);
				Send(nr + 1);
			}
		}
	}
	for (int i = 0; i < m; ++i) v.push_back(make_pair(spod[i], i));
	sort(v.begin(), v.end());
	s.insert(-1);
	s.insert(m);
	for (int i = 0; i < m; ++i)
	{
		it = s.upper_bound(v[i].second);
		prawo[v[i].second] = *it;
		it--;
		lewo[v[i].second] = *it;
		s.insert(v[i].second);
	}
	for (int i = 0; i < dl; ++i)
	{
		for (int j = 0; j < m; ++j)
		{
			if (tab[i][j]) spod[j]++;
			else spod[j] = 0;
		}
		gdzie = -1;
		for (int j = 0; j < m; ++j)
		{
			if (tab[i][j]) lewo[j] = max(lewo[j], gdzie);
			else
			{
				lewo[j] = gdzie;
				gdzie = j;
			}
		}
		gdzie = m;
		for (int j = m - 1; j >= 0; --j)
		{
			if (tab[i][j]) prawo[j] = min(prawo[j], gdzie);
			else
			{
				prawo[j] = m;
				gdzie = j;
			}
		}
		for (int j = 0; j < m; ++j) result += (long long)(spod[j]) * (long long)(j - lewo[j]) * (long long)(prawo[j] - j);
	}
	if (nr > 0)
	{
		PutLL(0, result);
		Send(0);
	}
	if (nr == 0)
	{
		wynik = (unsigned long long)(result);
		for (int i = 1; i < 100; ++i)
		{
			Receive(i);
			res[i] = GetLL(i);
			wynik += (unsigned long long)(res[i]);
		}
		cout << wynik << endl;
	}
	return 0;
}