1R/2016 09 23 - Revision history

Maintenance script: Repair batch-0001 pages from live compare

2026-03-26T23:55:57Z

Repair batch-0001 pages from live compare

← Older revision		Revision as of 23:55, 26 March 2026
Line 7:		Line 7:
	* 15이원준		* 15이원준
	* 박인서		* 박인서
	* 곽정흠		* [[곽정흠]]

	= 코드 =		= 코드 =

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 7:		Line 7:
	* 15이원준		* 15이원준
	* 박인서		* 박인서
	* [[곽정흠]]		* 곽정흠

	= 코드 =		= 코드 =
Line 19:		Line 19:

	int main(){		int main(){
	int arr[100001] = {0,};		int arr[100001] = {0,};
	int N, M, ans;		int N, M, ans;
	queue<pair<int, int>> que;		queue<pair<int, int>> que;
Line 33:		Line 33:
	dep = que.front().second;		dep = que.front().second;
	que.pop();		que.pop();
	if(n-1 >= 0 && !arr[n-1]){		if(n-1 >= 0 && !arr[n-1]){
	arr[n-1] = 1;		arr[n-1] = 1;
	que.push(make_pair(n - 1, dep + 1));		que.push(make_pair(n - 1, dep + 1));
	}		}
	if(n+1 <= 100000 && !arr[n+1]){		if(n+1 <= 100000 && !arr[n+1]){
	arr[n+1] = 1;		arr[n+1] = 1;
	que.push(make_pair(n + 1, dep + 1));		que.push(make_pair(n + 1, dep + 1));
	}		}
	if(n * 2 <= 100000 && !arr[n*2]){		if(n * 2 <= 100000 && !arr[n*2]){
	arr[n*2] = 1;		arr[n*2] = 1;
	que.push(make_pair(n * 2, dep + 1));		que.push(make_pair(n * 2, dep + 1));
	}		}
Line 54:		Line 54:
	typedef std::pair<int, int> pair_int;		typedef std::pair<int, int> pair_int;
	std::queue<pair_int> q;		std::queue<pair_int> q;
	bool visit[200001];		bool visit[200001];

	int main()		int main()
Line 64:		Line 64:
	while (q.front().first != e) {		while (q.front().first != e) {
	pair_int tq = q.front();		pair_int tq = q.front();
	if (tq.first < e && !visit[tq.first * 2])		if (tq.first < e && !visit[tq.first * 2])
	q.push(pair_int(tq.first * 2, tq.second + 1)), visit[tq.first * 2] = true;		q.push(pair_int(tq.first * 2, tq.second + 1)), visit[tq.first * 2] = true;
	if (tq.first < e && !visit[tq.first + 1])		if (tq.first < e && !visit[tq.first + 1])
	q.push(pair_int(tq.first + 1, tq.second + 1)), visit[tq.first + 1] = true;		q.push(pair_int(tq.first + 1, tq.second + 1)), visit[tq.first + 1] = true;
	if (tq.first > 0 && !visit[tq.first - 1])		if (tq.first > 0 && !visit[tq.first - 1])
	q.push(pair_int(tq.first - 1, tq.second + 1)), visit[tq.first - 1] = true;		q.push(pair_int(tq.first - 1, tq.second + 1)), visit[tq.first - 1] = true;
	q.pop();		q.pop();
	}		}
Line 84:		Line 84:
	#define MAX_NODE 100001		#define MAX_NODE 100001

	int distance[MAX_NODE];		int distance[MAX_NODE];
	int queue[MAX_QUEUE];		int queue[MAX_QUEUE];
	int first = 0, last = 0;		int first = 0, last = 0;

Line 91:		Line 91:
	if (last == MAX_QUEUE) {		if (last == MAX_QUEUE) {
	last = 0;		last = 0;
	queue[last++] = tmp;		queue[last++] = tmp;
	}		}
	else {		else {
	queue[last++] = tmp;		queue[last++] = tmp;
	}		}
	}		}
Line 100:		Line 100:
	if (first == MAX_QUEUE - 1) {		if (first == MAX_QUEUE - 1) {
	first = 0;		first = 0;
	return queue[MAX_QUEUE-1];		return queue[MAX_QUEUE-1];
	}		}
	else {		else {
	return queue[first++];		return queue[first++];
	}		}
	}		}
Line 112:		Line 112:
	}		}
	if (tmp * 2 <= k+1) {		if (tmp * 2 <= k+1) {
	if (distance[tmp * 2] > distance[tmp] + 1) {		if (distance[tmp * 2] > distance[tmp] + 1) {
	distance[tmp * 2] = distance[tmp] + 1;		distance[tmp * 2] = distance[tmp] + 1;
	add(tmp * 2);		add(tmp * 2);
	}		}
	}		}
	if (distance[tmp + 1] > distance[tmp] + 1) {		if (distance[tmp + 1] > distance[tmp] + 1) {
	distance[tmp +1] = distance[tmp] + 1;		distance[tmp +1] = distance[tmp] + 1;
	add(tmp + 1);		add(tmp + 1);
	}		}
	if (tmp - 1 >= 0&&distance[tmp-1]>distance[tmp]+1) {		if (tmp - 1 >= 0&&distance[tmp-1]>distance[tmp]+1) {
	distance[tmp -1] = distance[tmp] + 1;		distance[tmp -1] = distance[tmp] + 1;
	add(tmp - 1);		add(tmp - 1);
	}		}
Line 131:		Line 131:
	int n, k;		int n, k;
	for (int i = 0; i < MAX_NODE; i++) {		for (int i = 0; i < MAX_NODE; i++) {
	distance[i] = MAX_NODE;		distance[i] = MAX_NODE;
	}		}
	scanf("%d%d", &n, &k);		scanf("%d%d", &n, &k);
	distance[n] = 0;		distance[n] = 0;
	add(n);		add(n);
	while (bnf(n, k) == 0) {		while (bnf(n, k) == 0) {

	}		}
	printf("%d\n", distance[k]);		printf("%d\n", distance[k]);

	return 0;		return 0;
Line 152:		Line 152:

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

124.49.27.23 at 15:11, 30 September 2016

2016-09-30T15:11:33Z

@@ Line 80: / Line 80: @@
 == 곽정흠 ==
+ #include &lt;stdio.h&gt;
 = 아이디어 =
 == 15이원준 ==

175.124.46.11 at 14:13, 25 September 2016

2016-09-25T14:13:58Z

← Older revision		Revision as of 14:13, 25 September 2016
Line 5:		Line 5:

	= 참가자 =		= 참가자 =
			* 15이원준
	* 박인서		* 박인서
	* [[곽정흠]]		* [[곽정흠]]

175.124.46.11 at 02:22, 25 September 2016

2016-09-25T02:22:45Z

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

165.194.27.163 at 08:48, 24 September 2016

2016-09-24T08:48:12Z

@@ Line 12: / Line 12: @@
 == 박인서 ==
 == 곽정흠 ==
@@ Line 19: / Line 47: @@
 == 박인서 ==
 == 곽정흠 ==

124.49.27.23 at 12:25, 23 September 2016

2016-09-23T12:25:14Z

← Older revision		Revision as of 12:25, 23 September 2016
Line 6:		Line 6:
	= 참가자 =		= 참가자 =
	* 박인서		* 박인서
			* [[곽정흠]]

	= 코드 =		= 코드 =

223.62.229.22: {CREATE}

2016-09-22T15:17:50Z

{CREATE}

New page

__TOC__

= 오늘의 문제 =
* [https://www.acmicpc.net/problem/1697|숨바꼭질]

= 참가자 =
* 박인서

= 코드 =
== 15이원준 ==

== 박인서 ==

== 곽정흠 ==

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

== 박인서 ==

== 곽정흠 ==