| 提出番号 | 1879 |
|---|---|
| 提出者 | ats5515 |
| 言語 | C++ |
| 提出日時 | 2018-08-04 14:19:44 |
| 問題名 | (69)机の配置 |
| 結果 | WA |
| 点数 | 0% |
| テストケース | 結果 | 得点 | 実行時間 | メモリ使用量 |
|---|---|---|---|---|
| 1 | WA | 0% | 2ms | 7248KB |
| 2 | WA | 0% | 2ms | 8064KB |
| 3 | WA | 0% | 2ms | 8400KB |
| 4 | AC | 100% | 2ms | 8432KB |
| 5 | WA | 0% | 2ms | 8640KB |
| 6 | AC | 100% | 2ms | 8400KB |
| 7 | AC | 100% | 2ms | 8128KB |
| 8 | WA | 0% | 2ms | 8416KB |
| 9 | WA | 0% | 2ms | 7776KB |
| 10 | WA | 0% | 2ms | 8672KB |
| 11 | WA | 0% | 2ms | 8432KB |
| 12 | WA | 0% | 2ms | 8432KB |
| 13 | WA | 0% | 1ms | 8304KB |
| 14 | WA | 0% | 2ms | 7552KB |
| 15 | WA | 0% | 2ms | 8416KB |
| 16 | WA | 0% | 2ms | 8016KB |
| 17 | WA | 0% | 2ms | 7840KB |
| 18 | WA | 0% | 2ms | 7248KB |
| 19 | WA | 0% | 2ms | 8400KB |
| 20 | WA | 0% | 2ms | 7824KB |
| 21 | WA | 0% | 2ms | 8304KB |
| 22 | AC | 100% | 2ms | 8720KB |
| 23 | WA | 0% | 2ms | 7936KB |
| 24 | WA | 0% | 2ms | 8720KB |
| 25 | WA | 0% | 2ms | 8432KB |
| 26 | WA | 0% | 1ms | 8080KB |
| 27 | WA | 0% | 2ms | 8448KB |
| 28 | WA | 0% | 2ms | 8016KB |
| 29 | WA | 0% | 2ms | 8080KB |
| 30 | WA | 0% | 2ms | 7984KB |
#include <iostream>
#include <vector>
#include <map>
#include <set>
#include <queue>
#include <string>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <stdio.h>
using namespace std;
#define int long long
int MOD = 1000000007;
signed main() {
cin.tie(0);
ios::sync_with_stdio(false);
int H, W, N;
cin >> H >> W >> N;
vector<string> A(H);
for (int i = 0; i < H; i++) {
cin >> A[i];
}
vector<int> res(N + 1, 0);
for (int i = 1; i <= N; i++) {
for (int x = 0; x < H; x++) {
int z = 0;
for (int y = 0; y < W; y++) {
if (A[x][y] == '.') {
z++;
if (z == i) {
res[i]++;
z = 0;
}
}
else {
z = 0;
}
}
}
}
for (int i = 1; i <= N; i++) {
cout << res[i] << endl;
}
}