codeforces 52B Right Triangles

9 篇文章 0 订阅
B. Right Triangles
time limit per test
2 seconds
memory limit per test
256 megabytes
input
standard input
output
standard output

You are given a n × m field consisting only of periods ('.') and asterisks ('*'). Your task is to count all right triangles with two sides parallel to the square sides, whose vertices are in the centers of '*'-cells. A right triangle is a triangle in which one angle is a right angle (that is, a 90 degree angle).

Input

The first line contains two positive integer numbers n and m (1 ≤ n, m ≤ 1000). The following n lines consist of m characters each, describing the field. Only '.' and '*' are allowed.

Output

Output a single number — total number of square triangles in the field. Please, do not use %lld specificator to read or write 64-bit integers in C++. It is preffered to use cout (also you may use %I64d).

Examples
input
Copy
2 2
**
*.
output
1
input
Copy
3 4
*..*
.**.
*.**
output
9

题意:给你一个n*m网格,求直角边和坐标轴平行且由*组成的直角三角形个数。

解法:暴力,直接算出每行每列的*个数,枚举每个*,贡献为(x[i]-1)*(y[i]-1)。

代码:

#include <iostream>
#include <cstdio>
using namespace std;
int x[1005],y[1005],n,m;
char map[1005][1005];
long long ans;
int main()
{
	scanf("%d%d",&n,&m);
	for(int i=1;i<=n;i++) scanf("%s",map[i]+1);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(map[i][j]=='*')
				x[i]++,y[j]++;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			if(map[i][j]=='*')
				ans+=(x[i]-1)*(y[j]-1);
	printf("%I64d\n",ans);
}

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值