1R/2016 09 14 - Revision history

Maintenance script: Repair pages found by live-compare batch 0001

2026-03-26T14:46:15Z

Repair pages found by live-compare batch 0001

← Older revision		Revision as of 14:46, 26 March 2026
Line 14:		Line 14:
	using namespace std;		using namespace std;

	int arr[27][27] = { 0, };		int arr[27][27] = { 0, };
	int N, num = 0;		int N, num = 0;
	vector<int> v;		vector<int> v;

	void search(int i, int j) {		void search(int i, int j) {
	v[num]++;		v[num]++;
	arr[i][j] = -1;		arr[i][j] = -1;
	if(arr[i+1][j] == 1)		if(arr[i+1][j] == 1)
	search(i + 1, j);		search(i + 1, j);
	if(arr[i-1][j] == 1)		if(arr[i-1][j] == 1)
	search(i - 1, j);		search(i - 1, j);
	if(arr[i][j+1] == 1)		if(arr[i][j+1] == 1)
	search(i, j + 1);		search(i, j + 1);
	if(arr[i][j-1] == 1)		if(arr[i][j-1] == 1)
	search(i, j - 1);		search(i, j - 1);
	}		}
Line 35:		Line 35:
	for (int i = 0; i<27; i++) {		for (int i = 0; i<27; i++) {
	for (int j = 0; j<27; j++) {		for (int j = 0; j<27; j++) {
	arr[i][j] = 0;		arr[i][j] = 0;
	}		}
	}		}
Line 43:		Line 43:
	int tmp;		int tmp;
	scanf("%1d", &tmp);		scanf("%1d", &tmp);
	arr[i][j] = tmp;		arr[i][j] = tmp;
	}		}
	}		}
	for (int i = 1; i <= N; i++) {		for (int i = 1; i <= N; i++) {
	for (int j = 1; j <= N; j++) {		for (int j = 1; j <= N; j++) {
	if (arr[i][j] == 1) {		if (arr[i][j] == 1) {
	v.push_back(0);		v.push_back(0);
	search(i, j);		search(i, j);
Line 58:		Line 58:
	cout<<v.size()<<endl;		cout<<v.size()<<endl;
	for (int i = 0; i<v.size(); i++) {		for (int i = 0; i<v.size(); i++) {
	cout << v[i] << endl;		cout << v[i] << endl;
	}		}
	}		}
Line 65:		Line 65:
	#include <vector>		#include <vector>
	#include <algorithm>		#include <algorithm>
	char a[30][30];		char a[30][30];
	bool visit[30][30];		bool visit[30][30];
	int n;		int n;
	std::vector<int> res;		std::vector<int> res;
Line 72:		Line 72:
	int dfs (int i,int j){		int dfs (int i,int j){
	int cnt=1;		int cnt=1;
	visit[i][j]=true;		visit[i][j]=true;

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

Line 90:		Line 90:
	for (int i=1;i<=n;i++){		for (int i=1;i<=n;i++){
	for (int j=1;j<=n;j++){		for (int j=1;j<=n;j++){
	std::cin>>a[i][j];		std::cin>>a[i][j];
	}		}
	}		}
Line 97:		Line 97:
	for (int i=1;i<=n;i++){		for (int i=1;i<=n;i++){
	for (int j=1;j<=n;j++){		for (int j=1;j<=n;j++){
	if (a[i][j]=='1' && !visit[i][j])		if (a[i][j]=='1' && !visit[i][j])
	res.push_back(dfs(i,j));		res.push_back(dfs(i,j));
	}		}
Line 105:		Line 105:
	std::sort(res.begin(),res.end());		std::sort(res.begin(),res.end());
	for(int i=0;i<res.size();i++)		for(int i=0;i<res.size();i++)
	std::cout<<res[i]<<std::endl;		std::cout<<res[i]<<std::endl;

	return 0;		return 0;
Line 119:		Line 119:

	== 곽정흠 ==		== 곽정흠 ==

175.124.46.11 at 07:29, 22 September 2016

2016-09-22T07:29:29Z

@@ Line 8: / Line 8: @@
 = 코드 =
 == 15이원준 ==
+ #include&lt;iostream&gt;
 == 박인서 ==
   #include &lt;iostream&gt;

1.228.80.74 at 12:45, 14 September 2016

2016-09-14T12:45:24Z

← Older revision		Revision as of 12:45, 14 September 2016
Line 64:		Line 64:

	== 박인서 ==		== 박인서 ==
			* 단지 중 1곳 파악->단지 완전 탐색 순서로 단지를 탐색하면 된다

	== 곽정흠 ==		== 곽정흠 ==

223.62.67.19 at 12:41, 14 September 2016

2016-09-14T12:41:11Z

@@ Line 10: / Line 10: @@
 == 박인서 ==
+  #include &lt;iostream&gt;
 == 곽정흠 ==

1.228.80.74 at 12:36, 14 September 2016

2016-09-14T12:36:33Z

← Older revision		Revision as of 12:36, 14 September 2016
Line 10:		Line 10:

	== 박인서 ==		== 박인서 ==


	== 곽정흠 ==		== 곽정흠 ==

1.228.80.74: {CREATE}

2016-09-14T07:25:20Z

{CREATE}

New page

__TOC__

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

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

== 박인서 ==

== 곽정흠 ==

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

== 박인서 ==

== 곽정흠 ==