제출 #227901

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
227901		kartel	Strah (COCI18_strah)	C++14	22 / 110	1095 ms	40144 KiB

strah

#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
#define in(x) freopen(x, "r", stdin)
#define out(x) freopen(x, "w", stdout)
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("-O3")
#define F first
#define S second
#define pb push_back
#define N +100500
#define M ll(1e9 + 7)
#define sz(x) (int)x.size()
#define re return
#define oo ll(1e18)
#define el '\n'
using namespace std;
//using namespace __gnu_pbds;
//typedef tree <int, null_type, less_equal <int> , rb_tree_tag, tree_order_statistics_node_update> ordered_set;
typedef long long ll;
typedef long double ld;

ll ans, i, j, J, I, pr[2005][2005], n, m, b[2005][2005];
char c[2005][2005];

int main()
{
    srand(time(0));
    ios_base::sync_with_stdio(0);
    iostream::sync_with_stdio(0);
    ios::sync_with_stdio(0);
    cin.tie(NULL);
    cout.tie(NULL);

//    in("sum.in");
//    out("output.txt");

    cin >> n >> m;
    for (i = 1; i <= n; i++)
      for (j = 1; j <= m; j++) cin >> c[i][j];
    for (i = 1; i <= n; i++)
       for (j = 1; j <= m; j++) pr[i][j] = pr[i - 1][j] + pr[i][j - 1] - pr[i - 1][j - 1] + int(c[i][j] != '.');

    for (i = 1; i <= n; i++)
      for (j = 1; j <= m; j++)
        for (I = 1; I <= i; I++)
          for (J = 1; J <= j; J++)
            {
                int mi = max(i, I);
                int mj = max(j, J);
                int mI = min(i, I);
                int mJ = min(j, J);
                if (pr[mi][mj] - pr[mI - 1][mj] - pr[mi][mJ - 1] + pr[mI - 1][mJ - 1] == 0)
                      b[mI][mJ]++, b[mi + 1][mJ]--, b[mI][mj + 1]--, b[mi + 1][mj + 1]++;
            }

    for (i = 1; i <= n; i++)
       for (j = 1; j <= m; j++) b[i][j] = b[i - 1][j] + b[i][j - 1] - b[i - 1][j - 1] + b[i][j], ans += b[i][j];
    cout << ans;
}



// 119 78 175 411

• Subtask 1: 11 / 11
• Subtask 2: 11 / 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