| 提出番号 | 1927 |
|---|---|
| 提出者 | kougaku |
| 言語 | C++ |
| 提出日時 | 2018-08-04 14:36:57 |
| 問題名 | (69)机の配置 |
| 結果 | AC |
| 点数 | 100% |
| テストケース | 結果 | 得点 | 実行時間 | メモリ使用量 |
|---|---|---|---|---|
| 1 | AC | 100% | 2ms | 7824KB |
| 2 | AC | 100% | 2ms | 8368KB |
| 3 | AC | 100% | 2ms | 7792KB |
| 4 | AC | 100% | 2ms | 7968KB |
| 5 | AC | 100% | 2ms | 8416KB |
| 6 | AC | 100% | 2ms | 8720KB |
| 7 | AC | 100% | 2ms | 7632KB |
| 8 | AC | 100% | 2ms | 8736KB |
| 9 | AC | 100% | 2ms | 8416KB |
| 10 | AC | 100% | 2ms | 8400KB |
| 11 | AC | 100% | 2ms | 7296KB |
| 12 | AC | 100% | 2ms | 8192KB |
| 13 | AC | 100% | 2ms | 8432KB |
| 14 | AC | 100% | 2ms | 7776KB |
| 15 | AC | 100% | 2ms | 7984KB |
| 16 | AC | 100% | 2ms | 8384KB |
| 17 | AC | 100% | 2ms | 8432KB |
| 18 | AC | 100% | 1ms | 8336KB |
| 19 | AC | 100% | 2ms | 8432KB |
| 20 | AC | 100% | 2ms | 8000KB |
| 21 | AC | 100% | 2ms | 8432KB |
| 22 | AC | 100% | 1ms | 8416KB |
| 23 | AC | 100% | 2ms | 8000KB |
| 24 | AC | 100% | 2ms | 7424KB |
| 25 | AC | 100% | 2ms | 8192KB |
| 26 | AC | 100% | 2ms | 8160KB |
| 27 | AC | 100% | 2ms | 8384KB |
| 28 | AC | 100% | 2ms | 7760KB |
| 29 | AC | 100% | 2ms | 7520KB |
| 30 | AC | 100% | 2ms | 7824KB |
#include <iostream>
#include <vector>
#include <string>
using namespace std;
int main()
{
int N, H, W;
cin >> N >> H >> W;
string F[H];
for(int i = 0; i < H; i++) cin >> F[i];
for(int i = 1; i <= N; i++)
{
//col
int count1 = 0;
for(int p = 0; p < H; p++)
{
int point1 = 0;
for(int q = 0; q < W; q++)
{
if(F[p][q] == '.') point1++;
if(F[p][q] == '#' || q == W-1)
{
int r1 = point1 / i;
count1 += r1;
point1 = 0;
}
}
}
cout << count1 << endl;
/*
int count2 = 0;
for(int p = 0; p < W; p++)
{
int point2 = 0;
for(int q = 0; q < H; q++)
{
if(F[q][p] == '.') point2++;
if(F[q][p] == '#' || q == H-1)
{
int r2 = point2 / i;
count2 += r2;
point2 = 0;
}
}
}
//judge
if(count1 >= count2) cout << count1 << endl;
else if(count1 < count2) cout << count2 << endl;
*/
}
return 0;
}