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
// Artur Kraska, II UWr

#include <algorithm>
#include <iostream>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <vector>
#include <cmath>
#include <stack>
#include <list>
#include <set>
#include <map>

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


#define forr(i, n)                  for(int i=0; i<n; i++)
#define FOREACH(iter, coll)         for(typeof(coll.begin()) iter = coll.begin(); iter != coll.end(); ++iter)
#define FOREACHR(iter, coll)        for(typeof(coll.rbegin()) iter = coll.rbegin(); iter != coll.rend(); ++iter)
#define lbound(P,R,PRED)            ({typeof(P) X=P,RRR=(R), PPP = P; while(PPP<RRR) {X = (PPP+(RRR-PPP)/2); if(PRED) RRR = X; else PPP = X+1;} PPP;})
#define testy()                     int _tests; scanf("%d", &_tests); FOR(_test, 1, _tests)
#define CLEAR(tab)                  memset(tab, 0, sizeof(tab))
#define CONTAIN(el, coll)           (coll.find(el) != coll.end())
#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 MP                          make_pair
#define PB                          push_back
#define deb(X)                      X;

#define M 1000000007
#define INF 1000000007

using namespace std;

int ILE, NR, DL = 100;
int n, m, pocz, kon;
int dol[100007], tab[100007];
unsigned long long res, suma;
stack <pair<pair<long long, long long>, unsigned long long> > stos;

void przeslij_sumy()
{
    int wczytaj_na = m-1;
    FORD(j, m-1, 0)
    {
        if(j == wczytaj_na)
        {
            if(NR < ILE-1)
            {
//                cout << "pobieram od " << NR+1 << " (j = " << j << ")" << endl;
                Receive(NR+1);
            }
            wczytaj_na = max(wczytaj_na-DL, -1);
        }

        if(NR < ILE-1)
        {
            dol[j] = tab[j] = GetInt(NR+1);
//            cout << "biore liczbe do " << NR+1 << endl;
        }
        else
            dol[j] = tab[j] = n;
        FORD(i, kon, pocz)
        {
            if(!IsUsableCell(i, j))
                tab[j] = i;
//            cout << i << " " << j << " ma " << tab[j] << endl;
        }
        if(NR != 0)
        {
            PutInt(NR-1, tab[j]);
//            cout << " wkladam liczbe do " << NR-1 << endl;
        }

//        cout << j << " " << wczytaj_na << endl;
        if(j == wczytaj_na+1 && NR != 0)
        {
//            cout << "wysylam do " << NR-1 << " (j = " << j << ")" << endl;
            Send(NR-1);
        }
    }
}

void policz()
{
    FORD(j, m-1, 0)
        tab[j] = dol[j];

    FORD(i, kon, pocz)
    {
        while(!stos.empty())
            stos.pop();
        stos.push(MP(MP(i, m), 0));

        FORD(j, m-1, 0)
        {
            if(!IsUsableCell(i, j))
                tab[j] = i;
            while(!stos.empty() && stos.top().first.first >= tab[j])
                stos.pop();
            suma = 0;
            if(!stos.empty())
            {
                suma = stos.top().second + (stos.top().first.second - j)*(tab[j]-i);
            }
            res += suma;
//            cout << i << " " << j << " -> suma: " << suma << endl;
            stos.push(MP(MP(tab[j], j), suma));
        }
    }
}

int main()
{
    ILE = NumberOfNodes();
    NR = MyNodeId();

    n = GetFieldHeight();
    m = GetFieldWidth();
    //int IsUsableCell(int Row, int Col);

/*    if(n < 200)
    {
        ILE = 1;
        if(NR > 0)
            return 0;
    }*/

    pocz = n*NR/ILE;
    kon = n*(NR+1)/ILE-1;

//    cout << " pocz: " << pocz << ", kon: " << kon << endl;

    przeslij_sumy();
    policz();


    if(NR == 0)
    {
        FOR(i, 1, ILE-1)
        {
//            cout << "czekam na " << i << endl;
            Receive(i);
            res += GetLL(i);
//            cout << " dostalem od " << i << endl;
        }
        cout << res << endl;
    }
    else
    {
//        cout << " wysylam do 0 wynik " << res << endl;
        PutLL(0, res);
        Send(0);
//        cout << " wyslalem" << endl;
    }

    return 0;
}