Submission #316514

#	Time	Username	Problem	Language	Result	Execution time	Memory
316514		ronnith	Strah (COCI18_strah)	C++14	55 / 110	1089 ms	35876 KiB

strah

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
#define ll long long
#define num(a) a-'0'
#define charr(a) (a - 'A' + 1)
#define rep(i,a,b) for(int i=a;i<b;i++)
#define maxs(a,b) if(b>a)a=b
#define mins(a,b) if(b<a)a=b
#define bin1(a) __builtin_popcount(a)
#define debug(x) cerr<<"["<<#x<<":"<<x<<"] "
#define debug2(a,b) debug(a);debug(b)
#define debug3(a,b,c) debug2(a,b);debug(c)
#define de cerr
#define gcd(a,b) __gcd(a,b)
#define lcm(a,b) (((a)/(__gcd(a,b))) * b)
#define print(arr) for(auto it = arr.begin();it < arr.end();it ++){cout << *it << " ";}cout << ln;
#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
#define all(a) (a).begin(), (a).end()
#define vi vector<int>
#define v vector
#define p pair
#define pii p<int,int>
#define pb push_back
#define mk make_pair
#define f first
#define s second
#define ln "\n"
typedef long double ld;
typedef double d;
using namespace std;
using namespace __gnu_pbds;
ll modF=1e9+7;

/*OUTPUT

*/

int nax = 2001;
int n,m;
v<v<ll>> pre(nax,v<ll>(nax,0));
v<v<char>> a(nax,v<char>(nax));

void build(){
	for(int i = 1;i <= n;i ++){
		for(int j = 1;j <= m;j ++){
			if(a[i][j] == '#'){
				pre[i][j] ++;
			}
			pre[i][j] += pre[i][j - 1];
		}
	}
	for(int j = 1;j <= m;j ++){
		for(int i = 1;i <= n;i ++){
			pre[i][j] += pre[i - 1][j];
		}
	}
}

ll sum(ll a,ll b,ll c,ll d){
	ll res = pre[c][d] - pre[c][b - 1] - pre[a - 1][d] + pre[a - 1][b - 1];
	return res;
}

void solve(){
	cin >> n >> m;
	rep(i,1,n + 1){
		rep(j,1,m + 1){
			cin >> a[i][j];
		}
	}
	build();
	// for(int i = 0;i <= n;i ++){
	// 	for(int j = 0;j <= m;j ++){
	// 		debug(pre[i][j]);
	// 	}
	// 	de << ln;
	// }
	ll ans = 0;
	for(ll i = 1;i <= n;i ++){
		for(ll j = 1;j <= m;j ++){
			ll ptr = m;
			for(ll k = i;k <= n;k ++){
				while(ptr > j and sum(i,j,k,ptr) != 0){
					ptr --;
				}
				if(sum(i,j,k,ptr) == 0){
					ans += (k - i + 1) * (ptr - j + 1) + ((ptr - j + 1) * (ptr - j) * (k - i + 1)) / 2;
					// (k - i + 1) * (ptr - j + 1) + ((ptr - j + 1) * (ptr - j) * (k - i + 1)) / 2 
				}
			}
		}
	}
	cout << ans << ln;
}

int main(){
	ios::sync_with_stdio(0);cin.tie(0);
	int t = 1;
	// cin >> t;
	while(t --){
		solve();
	}
}

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