Submission #227948

#	Time	Username	Problem	Language	Result	Execution time	Memory
227948		Vimmer	Strah (COCI18_strah)	C++14	0 / 110	718 ms	20472 KiB

strah

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>

//#pragma GCC optimize("unroll-loops")
//#pragma GCC optimize("-O3")
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("fast-math")
//#pragma GCC optimize("no-stack-protector")

#define F first
#define S second
#define sz(x) int(x.size())
#define pb push_back
#define N 2005
#define M ll(1e9 + 7)

using namespace std;

//using namespace __gnu_pbds;

typedef long double ld;

typedef long long ll;

typedef short int si;

//typedef tree<int, null_type, less_equal <int>, rb_tree_tag, tree_order_statistics_node_update> ordered_set;

int n, m, pr[N][N];

ll ans;

bool gd(int i, int j, int a, int b)
{
    int sm = pr[i + a - 1][j + b - 1];

    if (i != 0) sm -= pr[i - 1][j + b - 1];

    if (j != 0) sm -= pr[i + a - 1][j - 1];

    if (i != 0 && j != 0) sm += pr[i - 1][j - 1];

    return sm == 0;
}

int opr(int i, int j, int y)
{
    int l = 1, r = n - i;

    while (l + 1 < r)
    {
        int md = (l + r) >> 1;

        if (gd(i, j, md, y)) l = md; else r = md - 1;
    }

    while (l > 0 && !gd(i, j, l, y)) l--;

    while (l < n - i && gd(i, j, l + 1, y)) l++;

    return l;
}
int main()
{
    //freopen("input.txt", "r", stdin); freopen("output.txt", "w", stdout);

    ios_base::sync_with_stdio(0); istream::sync_with_stdio(0); cin.tie(0); cout.tie(0);

    cin >> n >> m;

    string s[n];

    for (int i = 0; i < n; i++) cin >> s[i];

    for (int i = 0; i < n; i++)
      for (int j = 0; j < m; j++)
      {
          if (i != 0) pr[i][j] += pr[i - 1][j];

          if (j != 0) pr[i][j] += pr[i][j - 1];

          if (i != 0 && j != 0) pr[i][j] -= pr[i - 1][j - 1];

          if (s[i][j] == '#') pr[i][j]++;
      }

    for (int x = 0; x < n; x++)
        {
            vector <int> g; g.clear();

            for (int j = 0; j < m; j++)
            {
                if (s[x][j] == '#')
                {
                    sort(g.begin(), g.end());

                    for (int i = 0; i < sz(g); i++)
                    {
                        ll kol = sz(g) - i;

                        kol = (kol * (kol + 1)) / 2;

                        ll s = g[i]; s = (s * (s + 1)) / 2;

                        s *= kol;

                        ans += s;
                    }

                    g.clear();

                    continue;
                }

                int val = opr(x, j, 1);

                g.pb(val);
            }

            sort(g.begin(), g.end());

            for (int i = 0; i < sz(g); i++)
            {
                ll kol = sz(g) - i;

                kol = (kol * (kol + 1)) / 2;

                ll s = g[i]; s = (s * (s + 1)) / 2;

                s *= kol;

                ans += s;
            }
        }
    cout << ans << endl;
}

• Subtask 1: 0 / 11
• Subtask 2: 0 / 11
• Subtask 3: 0 / 11
• Subtask 4: 0 / 11
• Subtask 5: 0 / 11
• Subtask 6: 0 / 11
• Subtask 7: 0 / 11
• Subtask 8: 0 / 11
• Subtask 9: 0 / 11
• Subtask 10: 0 / 11