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
#include <cstdio>
#include <iostream>
#include <algorithm>
#include <cstring>
#include <vector>
#include <set>
#include <map>
#include <cmath>
#include <list>
#include <ctime>
#include <sstream>
#include <queue>
#include <stack>
#include <bitset>
#include <unordered_set>
#include <unordered_map>
using namespace std;
typedef vector<int> vi;
typedef pair<int,int> pii;
typedef unsigned long long ll;
typedef short int sint;
#define FOR(x, b, e) for(int x=(b); x<=(e); ++x)
#define FORD(x, b, e) for(int x=((int)(b))-1; x>=(e); --x)
#define REP(x, n) for(int x=0; x<(n); ++x)
#define ALL(c) c.begin(),c.end()
#define SIZE(x) ((int)((x).size()))
#define PB push_back
#define ST first
#define ND second
#define mp(x,y) make_pair(x,y)
#define DEBUG 1
#define debug(x) {if (DEBUG)cerr <<#x <<" = " <<x <<endl; }
#define debugv(x) {if (DEBUG) {cerr <<#x <<" = "; FOREACH(it, (x)) cerr <<*it <<", "; cout <<endl; }}
#define REMAX(a,b) (a)=max((a),(b));
#define REMIN(a,b) (a)=min((a),(b));
#define wez(n) int (n); scanf("%d",&(n));
#define wez2(n,m) int (n),(m); scanf("%d %d",&(n),&(m));

#include "dzialka.h"
#include "message.h"

const int K = 750;
const int M = 75000;
const int MESSAGE_LIMIT = 5000;
int P[M], H[M]; 
int NumRows, NumCols;
int myNode;

bool debug = false;

ll solve(int l, int r) {
	// [l;r) and P[1..NumRows] computed
	ll res = 0;
	FOR(col, l, r - 1) {
		if (debug)printf("running column: %d\n", col);
		stack<pair<int, int> > S;
		ll sum = 0;
		REP(row, NumRows) {
			if (debug)printf("\telem: %d\n", row);
			bool cur = IsUsableCell(row, col);
			if (!cur) {
				sum = 0;
				while (!S.empty()) {
					S.pop();
				}
				P[row] = col;
				if (debug)printf("\t\tempty\n");
			} else {
				int myLength = col - P[row];
				int ileZdjalem = 0;
				while (!S.empty() && S.top().ST >= myLength) {
					pii elem = S.top(); S.pop();
					ileZdjalem += elem.ND;
					sum = sum - (ll)elem.ST * elem.ND;
				}
				pii ja(myLength, ileZdjalem + 1);
				if (debug)printf("\tja to: %d, %d\n", ja.ST, ja.ND);
				S.push(ja);
				sum = sum + (ll)ja.ST * ja.ND;
			}
			if (debug)printf("\tadding: %llu\n", sum);
			res = res + sum;
		}
	}
	return res;
}

void compute(int l, int r) {
	// [l;r)
	REP(row, NumRows) {
		H[row] = -1;
		P[row] = -1;
		FORD(col, r, l) {
			if (!IsUsableCell(row, col)) {
				H[row] = col;
				break;
			}
		}
	}
}

int main() {
	// printf("starting on: %d\n", MyNodeId());
	NumRows = GetFieldHeight();
	NumCols = GetFieldWidth();
	myNode = MyNodeId();
	if (NumCols <= K) {
		// solve all by instance 1;
		if (myNode > 0) {
			return 0;
		}
		REP(i, NumRows) {
			P[i] = H[i] = -1;
		}
		ll res = solve(0, NumCols);
		printf("%llu\n", res);
	} else {
		// divide and conquer
		int poczatek = (myNode * NumCols) / NumberOfNodes();
  		int koniec = ((myNode + 1) * NumCols) / NumberOfNodes();
  		if (debug)printf("Running divide and conq, range: (%d, %d)\n", poczatek, koniec);
  		compute(poczatek, koniec);
		if (debug)printf("Computed range\n");
  		if (myNode > 0) {
  			if (debug) printf("chce odczytac od: %d\n", myNode - 1);
  			for (int wys = 0; wys < NumRows; wys += MESSAGE_LIMIT) {
	  			Receive(myNode - 1);
	  			REP(pos, min(MESSAGE_LIMIT, NumRows - wys)) {
	  				int row = wys + pos;
	  				P[row] = GetInt(myNode - 1);
	  				H[row] = max(P[row], H[row]);
	  			}
	  		}
  		}
  		if (myNode + 1 < NumberOfNodes()) {
  			for (int wys = 0; wys < NumRows; wys += MESSAGE_LIMIT) {
  				REP(pos, min(MESSAGE_LIMIT, NumRows - wys)) {
  					int row = wys + pos;
	  				PutInt(myNode + 1, H[row]);
	  			}
	  			Send(myNode + 1);
  			}
  		}
  		// P is computed
  		ll myRes = solve(poczatek, koniec);
  		if (myNode > 0) {
  			PutLL(0, myRes);
  			Send(0);
  		} else {
  			// jestem master;
  			ll res = myRes;
  			FOR(i, 1, NumberOfNodes() - 1) {
  				Receive(i);
  				ll pom = GetLL(i);
  				res = res + pom;
  			}
  			printf("%llu\n", res);
  		}
	}

	return 0;
}