1R/2016 09 14

2016-09-14T12:41:11Z

223.62.67.19:

__TOC__

= 오늘의 문제 =
* [https://www.acmicpc.net/problem/2667|단지번호붙이기]

= 참가자 =
* 박인서
= 코드 =
== 15이원준 ==

== 박인서 ==
#include <iostream>
#include <vector>
#include <algorithm>
char a[30][30];
bool visit[30][30];
int n;
std::vector<int> res;

int dfs (int i,int j){
int cnt=1;
visit[i][j]=true;

if (i!=1 && a[i-1][j]=='1' && !visit[i-1][j])
cnt+=dfs(i-1,j);
if (i!=n && a[i+1][j]=='1' && !visit[i+1][j])
cnt+=dfs(i+1,j);
if (j!=1 && a[i][j-1]=='1' && !visit[i][j-1])
cnt+=dfs(i,j-1);
if (j!=n && a[i][j+1]=='1' && !visit[i][j+1])
cnt+=dfs(i,j+1);

return cnt;
}

int main (){
std::cin>>n;
for (int i=1;i<=n;i++){
for (int j=1;j<=n;j++){
std::cin>>a[i][j];
}
}

for (int i=1;i<=n;i++){
for (int j=1;j<=n;j++){
if (a[i][j]=='1' && !visit[i][j])
res.push_back(dfs(i,j));
}
}

std::cout<<res.size()<<std::endl;
std::sort(res.begin(),res.end());
for(int i=0;i<res.size();i++)
std::cout<<res[i]<<std::endl;

return 0;
}

== 곽정흠 ==

= 아이디어 =
== 15이원준 ==

== 박인서 ==

== 곽정흠 ==

ZeroWiki - User contributions [en]

1R/2016 09 14