Submission #159698

#	Time	Username	Problem	Language	Result	Execution time	Memory
159698		socho	Strah (COCI18_strah)	C++14	44 / 110	1090 ms	31608 KiB

strah

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

int main() {
	
	ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
	
	int n, m;
	cin >> n >> m;
	
	int grid[n][m];
	
	for (int i=0; i<n; i++) {
		string s;
		cin >> s;
		for (int j=0; j<m; j++) {
			grid[i][j] = (s[j] == '.');
		}
	}
	
	int pf[n+1][m+1];
	for (int i=0; i<n+1; i++) pf[i][0] = 0;
	for (int i=0; i<m+1; i++) pf[0][i] = 0;
	
	for (int i=0; i<n; i++) {
		for (int j=0; j<m; j++) {
			pf[i+1][j+1] = pf[i+1][j] + pf[i][j+1] - pf[i][j] + grid[i][j];
		}
	}
	
	int sm = 0;
	
	for (int i=1; i<=n; i++) {
		for (int j=i; j<=n; j++) {
			for (int a=1; a<=m; a++) {
				bool cg = true;
				for (int b=a; b<=m && cg; b++) {
					int area = (j - i + 1) * (b - a + 1);
					int qr = pf[j][b] - pf[j][a-1] - pf[i-1][b] + pf[i-1][a-1];
					if (area == qr) sm += area; 
					else cg = false;
				}
			}
		}
	}
	
	cout << sm << endl;
	
	
	
}

• 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