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 <bits/stdc++.h>
#include "message.h"
#include "dzialka.h"

#define FOR(i,a,b) for(int i=(a);i<(b);++i)
#define FORD(i, a, b) for(int i = (a); i >= (b); --i)
#define VAR(v, i) __typeof(i) v=(i)
#define FORE(i, c) for(VAR(i, (c).begin()); i != (c).end(); ++i)
#define all(v) (v).begin(),(v).end()
 
#define PII pair<int,int>
#define mp make_pair
#define st first
#define nd second
#define pb push_back
#define lint long long int
#define VI vector<int>
 
#define debug(x) {cerr <<#x <<" = " <<x <<endl; }
#define debug2(x,y) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y <<endl; } 
#define debug3(x,y,z) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z <<endl; } 
#define debug4(x,y,z,u) {cerr <<#x <<" = " <<x << ", "<<#y<<" = "<< y << ", " << #z << " = " << z << ", "<<#u << " = " << u << endl; } 
#define debugv(x) {{cerr <<#x <<" = "; FORE(itt, (x)) cerr <<*itt <<", "; cerr <<endl; }}
#define debugt(t,n) {{cerr <<#t <<" = "; FOR(it,0,(n)) cerr <<t[it] <<", "; cerr <<endl; }}
 
#define make( x) int (x); scanf("%d",&(x));
#define make2( x, y) int (x), (y); scanf("%d%d",&(x),&(y));
#define make3(x, y, z) int (x), (y), (z); scanf("%d%d%d",&(x),&(y),&(z));
#define make4(x, y, z, t) int (x), (y), (z), (t); scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define makev(v,n) VI (v); FOR(i,0,(n)) { make(a); (v).pb(a);} 
#define IOS ios_base::sync_with_stdio(0)
#define HEAP priority_queue
 
#define read( x) scanf("%d",&(x));
#define read2( x, y) scanf("%d%d",&(x),&(y));
#define read3(x, y, z) scanf("%d%d%d",&(x),&(y),&(z));
#define read4(x, y, z, t) scanf("%d%d%d%d",&(x),&(y),&(z),&(t));
#define readv(v,n) FOR(i,0,(n)) { make(a); (v).pb(a);}
 
 
using namespace std;

int id;
int nodes;
int n,m;

int ileWgore[2][75005];
int dostalem[75005];
lint my_res = 0;

int main() {
	id = MyNodeId();
	nodes = NumberOfNodes();
	n = GetFieldHeight();
	m = GetFieldWidth();
	nodes = min(n, nodes);
	if (id >= n) {
		return 0;
	}
	if (n == 1) {
		if (id == 0) {
			lint ans = 0;
			lint sofar = 0;
			FOR(i,0,m) {
				if (IsUsableCell(0, i)) {
					sofar++;
					ans += sofar;
				} else {
					sofar = 0;
				}
			}
			printf("%lld\n", ans);
		} else {
			return 0;
		}
	}
	int BLOCK_SIZE = (n+nodes-1)/nodes;	
	int B1 = id * BLOCK_SIZE;
	int B2 = min(n, (id+1)*BLOCK_SIZE);
	FOR(i,0,m) {
		ileWgore[0][i] = (IsUsableCell(B1, i)) ? 1 : 0;
	}
	FOR(j,B1+1,B2) {
		FOR(i,0,m) {
			ileWgore[(j-B1)%2][i] = (IsUsableCell(j, i)) ?  ileWgore[(j-B1-1)%2][i] + 1 : 0;
		}
	}
	if (id == 0) {
		//MALE WIADOMOSCI
		for (int xxx=0; xxx<m;xxx+=4000) {
			FOR(i,xxx,min(xxx+4000,m)) {
				PutInt(1 , ileWgore[(B2-B1-1)%2][i]);
			}
			Send(1);
		}
	} else  {
		for (int xxx=0; xxx<m;xxx+=4000) {
			Receive(id - 1);
			FOR(i,xxx,min(xxx+4000,m)) {
				dostalem[i] = GetInt(id - 1);
			}
		}
		if (id != nodes - 1) {
			for (int xxx=0; xxx<m; xxx+=4000) {
				FOR(i, xxx, min(xxx+4000,m)) 
					PutInt(id + 1, ileWgore[(B2-B1-1)%2][i] == (B2 - B1) ? ileWgore[(B2-B1-1)%2][i] + dostalem[i] : ileWgore[(B2-B1-1)%2][i]);
			
				Send(id + 1);
			}
		}
	}
	if (id == 0) {
		FOR(i,0,m) dostalem[i] = 0;
	}

	FOR(j,B1,B2) {
		vector<pair<PII, lint> > que;
		que.pb(mp(mp(-1,0),0));
		FOR(i,0,m) {
			if (j == B1) 
				ileWgore[0][i] = (IsUsableCell(B1, i)) ? 1 + dostalem[i] : 0;
			else {
				ileWgore[(j-B1)%2][i] = (IsUsableCell(j, i)) ?  ileWgore[(j-B1-1)%2][i] + 1: 0;
			}
			int usuniete = 1;
			while (que.back().st.st >= ileWgore[(j-B1)%2][i]) {
				usuniete += que.back().st.nd;
				que.pop_back();
			}
			lint ja = que.back().nd + (usuniete)* 1LL * ileWgore[(j-B1)%2][i];
			my_res += ja;
			que.push_back(mp(mp(ileWgore[(j-B1)%2][i], usuniete), ja));
		}
		que.clear();
	}
	if (id != 0) {
		PutLL(0, my_res);
		Send(0);
	} else {
		FOR(i,1,nodes) {
			int instancja = Receive(-1);
			my_res += GetLL(instancja);
		}
		printf("%lld\n", my_res);
	}
	

}