結果

提出番号 2226
提出者 gotutiyan
言語 C++
提出日時 2019-04-16 11:57:13
問題名 (69)机の配置
結果 WA
点数 0%

テストケース

テストケース 結果 得点 実行時間 メモリ使用量
1 AC 100% 2ms 8144KB
2 WA 0% 2ms 8112KB
3 WA 0% 2ms 8112KB
4 WA 0% 2ms 8192KB
5 WA 0% 2ms 8160KB
6 WA 0% 2ms 8096KB
7 AC 100% 2ms 8480KB
8 WA 0% 2ms 8320KB
9 WA 0% 2ms 8064KB
10 WA 0% 2ms 8160KB
11 WA 0% 2ms 8112KB
12 WA 0% 2ms 7872KB
13 WA 0% 2ms 8384KB
14 WA 0% 2ms 8320KB
15 WA 0% 2ms 7872KB
16 WA 0% 2ms 8496KB
17 WA 0% 2ms 8144KB
18 WA 0% 2ms 7872KB
19 WA 0% 2ms 7952KB
20 WA 0% 2ms 8160KB
21 WA 0% 2ms 8080KB
22 WA 0% 2ms 8112KB
23 WA 0% 2ms 8096KB
24 WA 0% 2ms 7888KB
25 WA 0% 2ms 7888KB
26 WA 0% 2ms 8144KB
27 WA 0% 2ms 8160KB
28 WA 0% 2ms 7936KB
29 WA 0% 2ms 8768KB
30 WA 0% 2ms 8352KB

ソースコード

#include <cassert>

#include <cctype>
#include <cerrno>
#include <cfloat>
#include <ciso646>
#include <climits>
#include <clocale>
#include <cmath>
#include <csetjmp>
#include <csignal>
#include <cstdarg>
#include <cstddef>
#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <ctime>
#include <ccomplex>
#include <cfenv>
#include <cinttypes>
#include <cstdbool>
#include <cstdint>
#include <ctgmath>
#include <cwchar>
#include <cwctype>

// C++
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <array>
#include <atomic>
#include <chrono>
#include <condition_variable>
#include <forward_list>
#include <future>
#include <initializer_list>
#include <mutex>
#include <random>
#include <ratio>
#include <regex>
#include <scoped_allocator>
#include <system_error>
#include <thread>
#include <tuple>
#include <typeindex>
#include <type_traits>
#include <unordered_map>
#include <unordered_set>
//#include <boost/foreach.hpp>
//#include <boost/range/algorithm.hpp>
#define rep(i,j,k) for(int i=(int)j;i<(int)k;i++)
#define ll long long
#define Sort(v) sort(all(v))
#define INF 1e9
#define LINF 1e18
#define END return 0
#define pb push_back
#define se second
#define fi first
#define pb push_back
#define all(v) (v).begin() , (v).end()
#define MP make_pair
#define MOD 1000000007LL
#define int long long
using namespace std;
int day[12]={31,28,31,30,31,30,31,31,30,31,30,31};
// int dx[]={0,1,0,-1,1,-1};
// int dy[]={1,0,-1,0,1,-1};
struct edge{int to,cost;};
typedef pair<int,int> P;

bool isupper(char c){if('A'<=c&&c<='Z')return 1;return 0;}
bool islower(char c){if('a'<=c&&c<='z')return 1;return 0;}
bool isPrime(int x){if(x==1)return 0;if(x==2)return 1;if(x%2==0)return 0;for(int i=3;i*i<=x;i++)if(x%i==0)return 0;return 1;}
bool iskaibun(string s){for(int i=0;i<s.size()/2;i++)if(s[i]!=s[s.size()-i-1])return 0;return 1;}
bool isnumber(char c){return ('0'<=c&&c<='9');}
bool isalpha(char c){return (isupper(c)&&islower(c));}
void printvi(vector<int> v){rep(i,0,v.size()){if(i)cout<<" ";cout<<v[i];}cout<<endl;}
void printvil(vector<int> v){rep(i,0,v.size()){cout<<v[i]<<endl;}}
void printvvi(vector<vector<int>> v){
    rep(i,0,v.size()){
        rep(j,0,v[i].size())cout<<v[i][j];
        cout<<endl;
    }
}
void printvstr(vector<string> v){
    rep(i,0,v.size()){
        cout<<v[i]<<endl;
    }
}

signed main (){
    int n,w,h;
    cin>>n>>w>>h;
    vector<string> v(h);
    rep(i,0,h)cin>>v[i];

    rep(leng,1,n+1){
        int ans=0;
        rep(i,0,h){
            rep(j,0,w){
                if(v[i][j]=='.'){
                    int ct=1;
                    while(j+1<w and v[i][j]==v[i][j+1]){
                        j++;
                        ct++;
                    }
                ans+=ct/leng;
                }
            }
        }
        cout<<ans<<endl;
    }


    

}
/*
*/