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

#define FOR(x, b, e) for(int x = b; x <= (e); ++x)
#define FORD(x, b,e) for(int x = b; x >= (e); --x)
#define REP(x, b) for(int x = 0; x < (b); ++x)
#define SIZE(c) ((int)c.size())
#define ALL(c) (c).begin(), (c).end()
#define MP make_pair
#define PB push_back
#define ST first
#define ND second

using namespace std;

typedef long long LL;
typedef vector <int> VI;
typedef pair <int, int> PII;
typedef vector <PII> VPII;

const int MAXN = 5e3 + 9;

bool tab[MAXN][MAXN];
short tab2[MAXN][MAXN];
set <PII> seti;
LL suma = 0;

void clear()
{
    suma = 0;
    seti.clear();
}

void add(int k)
{
    int ile = 0;

    while((!seti.empty()) && ((*seti.rbegin()).ST >= k))
      {
          ile += (*seti.rbegin()).ND;
          suma -= (*seti.rbegin()).ST * (*seti.rbegin()).ND;

          seti.erase(seti.find((*seti.rbegin())));
      }

    ile++;
    suma += k * ile;

    seti.insert(MP(k, ile));
}

int main()
{
    if(MyNodeId() != 0)
      return 0;

    int n = GetFieldHeight(), m = GetFieldWidth();

    REP(i, n)
      {
          REP(j, m)
            {
                tab[j][i] = IsUsableCell(i, j);
            }
      }

    int pop = 0;

    REP(j, m)
      {
          pop = 0;

          FORD(i, n - 1, 0)
            {
                if(tab[j][i])
                  pop++;

                else
                  pop = 0;

                tab2[j][i] = pop;
            }
      }

    LL wyn = 0;

    REP(i, n)
      {
          clear();

          REP(j, m)
            {
                add(tab2[j][i]);
                wyn += suma;
            }
      }

    cout<<wyn<<endl;

    return 0;
}