제출 #1065441

#	제출 시각	아이디	문제	언어	결과	실행 시간	메모리
1065441		EkinOnal	Strah (COCI18_strah)	C++17	22 / 110	1071 ms	39732 KiB

strah

//#pragma GCC optimize("O3,unroll-loops,Ofast")
//#pragma GCC target("avx2,bmi,bmi2,popcnt,lzcnt")
#include <bits/stdc++.h>
//#include <ext/pb_ds/assoc_container.hpp>
//#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
//using namespace __gnu_pbds;
 
#define MAX 200007
#define pb push_back
#define mp make_pair 
#define int long long
#define f first
#define s second
#define vi vector<int>
#define pii pair<int,int>
#define si set<int>
#define vpii vector<pair<int,int>> 
const int mod = 1e9+7;
const int INF = 1e18;
// myMap.begin()->first :  key
// myMap.begin()->second : value
 
int epow(int a,int b){int ans=1;while(b){if(b&1) ans*=a;a*=a;;b>>=1;}return ans;}
int gcd(int a,int b) {if(a<b)swap(a,b);while(b){int tmp=b;b=a%b;a=tmp;}return a;}
int mul(int a,int b){return ((a%mod)*(b%mod))%mod;}
int sum(int a,int b){return ((a%mod)+(b%mod))%mod;}
 
//typedef tree<pii,null_type,less<pii>,rb_tree_tag,tree_order_statistics_node_update>ordered_set;

void solve(){
	int n,m; cin>>n>>m;

	vector<vector<char>> grid(n+2,vector<char>(m+2));
	vector<vi> pre(n+2,vi(m+2));
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++) {cin>>grid[i][j];if(grid[i][j]=='.')pre[i][j]++;}
	}
	
	
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			pre[i][j]+=pre[i-1][j];
			pre[i][j]+=pre[i][j-1];
			pre[i][j]-=pre[i-1][j-1];
		}
	}

	int ans=0;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=m;j++){
			for(int nowi=1;nowi<=n-i+1;nowi++){
				for(int nowj=1;nowj<=m-j+1;nowj++){
					if(pre[nowi+i-1][nowj+j-1]-pre[nowi+i-1][nowj-1]-pre[nowi-1][nowj+j-1]+pre[nowi-1][nowj-1]
						!=i*j) continue;
					ans += i*j;
				}
			}
		}
	}
	cout<<ans<<endl;

	
	
	
	return;
}
 
int32_t main() {
//	freopen("hayfeast.in", "r", stdin);
//	freopen("hayfeast.out", "w", stdout);
	ios_base::sync_with_stdio(0);cin.tie(0);   

    int t=1;
 //   cin >> t;
    while (t--) solve();
 
    return 0;
}

• 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