ZOJ 3944 People Counting(暴力)

题意:

$N\times M的矩阵,N,M\le 100,现给定人的形状,人可能被部分遮挡$
$问图里有几个人$

分析:

$以头为标志点来存个位置数组,然后碰到身体部分就统一到头$
$一定是对他的身体部分进行标记$
$(有可能身体是别人的。。怪自己写代码不鲁棒。。强行有trick)$

代码:

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
//
// Created by TaoSama on 2016-04-23
// Copyright (c) 2016 TaoSama. All rights reserved.
//
#pragma comment(linker, "/STACK:102400000,102400000")
#include <algorithm>
#include <cctype>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <iomanip>
#include <iostream>
#include <map>
#include <queue>
#include <string>
#include <set>
#include <vector>
using namespace std;
#define pr(x) cout << #x << " = " << x << " "
#define prln(x) cout << #x << " = " << x << endl
const int N = 1e5 + 10, INF = 0x3f3f3f3f, MOD = 1e9 + 7;
int n, m;
char s[300][300];
const int OFF = 100;
const char* peo = "O/|\\()";
int d[][2] = {0, 0, 1, -1, 1, 0, 1, 1, 2, -1, 2, 1};
int main() {
#ifdef LOCAL
freopen("C:\\Users\\TaoSama\\Desktop\\in.txt", "r", stdin);
// freopen("C:\\Users\\TaoSama\\Desktop\\out.txt","w",stdout);
#endif
ios_base::sync_with_stdio(0);
int t; scanf("%d", &t);
while(t--) {
memset(s, 0, sizeof s);
scanf("%d%d", &n, &m);
for(int i = OFF; i < n + OFF; ++i) scanf("%s", s[i] + OFF);
int ans = 0;
for(int i = OFF; i < n + OFF; ++i) {
for(int j = OFF; j < m + OFF; ++j) {
if(s[i][j] == '.') continue;
++ans;
int idx = strchr(peo, s[i][j]) - peo;
int x = i - d[idx][0], y = j - d[idx][1];
// printf("%d:= %d %d %d %d\n", idx, i - OFF, j - OFF, x - OFF, y - OFF);
for(int k = 0; k < 6; ++k) {
int nx = x + d[k][0], ny = y + d[k][1];
if(s[nx][ny] == peo[k]) s[nx][ny] = '.';
}
}
}
printf("%d\n", ans);
}
return 0;
}


1. 除非注明,本博文即为原创,转载请注明链接地址
2. 本博文只代表博主当时的观点或结论,请不要恶意攻击
3. 如果本文帮到了您,不妨点一下 下面分享到 按钮,让更多的人看到