제출 #516141

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
516141		thanh913	Strah (COCI18_strah)	C++14	44 / 110	1094 ms	37648 KiB

strah

#include <bits/stdc++.h>
using namespace std;

//types
#define ll long long
#define ld long double
#define pll pair<ll, ll>
#define pii pair<int, int>

#define fi first
#define se second
#define inf 0x3f3f3f3f
#define pb(a) push_back(a)
#define mp(a, b) make_pair(a, b)

//lowercase 31, all 53
//(P/Q) % M = (P % M) * (Q^(M-2) % M)
//-------------------------------------------------------

const ll mx = 5e3+5, mod = 1e9+7;
int n, m, ans = 0, s[mx][mx];
bool a[mx][mx];

int tong(int r1, int c1, int r2, int c2) 
{
	return s[r2][c2] - s[r2][c1-1] - s[r1-1][c2] + s[r1-1][c1-1];
}

int main()
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    cin >> n >> m;
    for (int i = 1; i <= n; i++) 
    	for (int j = 1; j <= m; j++) 
    	{
    		char tmp;
    		cin >> tmp;
    		a[i][j] = (tmp == '.') ? 0 : 1;
    		s[i][j] = s[i-1][j] + s[i][j-1] - s[i-1][j-1] + a[i][j];
    	}

    for (int i = 1; i <= n; i++) 
    {
    	for (int j = 1; j <= m; j++) 
    	{
    		int h = n;
    		for (int k = j; k <= m; k++) 
    		{
    			while (h >= i) 
    			{
    				if (tong(i, j, h, k) == 0) break;
    				h--;
    			}
    			if (h >= i) 
    			{
    				int sc = k - j + 1, sr = h - i + 1;
    				ans += sr * (sr+1) / 2 * sc;
    			}
    		}
    	}
    }
    cout << ans;
}

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