1R/2016 09 16 - 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 25:		Line 25:
	}node;		}node;

	int visit[1010] = { 0, };		int visit[1010] = { 0, };
	vector<node> in;		vector<node> in;
	vector<int> checked;		vector<int> checked;
Line 31:		Line 31:

	bool choose(int e) {		bool choose(int e) {
	if ((visit[in[e].e] == 1 && visit[in[e].s] == 1) \|\| (visit[in[e].e] == 0 && visit[in[e].s] == 0)) {		if ((visit[in[e].e] == 1 && visit[in[e].s] == 1) \|\| (visit[in[e].e] == 0 && visit[in[e].s] == 0)) {
	return false;		return false;
	}		}
Line 48:		Line 48:
	int min = -1;		int min = -1;
	for (int j = 0; j<M; j++) {		for (int j = 0; j<M; j++) {
	if ((checked.size() == 0 \|\| choose(j)) && (min == -1 \|\| in[min].v > in[j].v)) {		if ((checked.size() == 0 \|\| choose(j)) && (min == -1 \|\| in[min].v > in[j].v)) {
	min = j;		min = j;
	}		}
	}		}
	visit[in[min].s] = 1;		visit[in[min].s] = 1;
	visit[in[min].e] = 1;		visit[in[min].e] = 1;
	checked.push_back(min);		checked.push_back(min);
	}		}
	int answer = 0;		int answer = 0;
	for (int i = 0; i<N - 1; i++) {		for (int i = 0; i<N - 1; i++) {
	answer += in[checked[i]].v;		answer += in[checked[i]].v;
	}		}
	cout << answer << endl;		cout << answer << endl;
Line 67:		Line 67:
	#include <algorithm>		#include <algorithm>
	typedef std::pair<int, int> pair_int;		typedef std::pair<int, int> pair_int;
	std::vector<pair_int> g[10001];		std::vector<pair_int> g[10001];
	bool visit[10001];		bool visit[10001];

	int main()		int main()
Line 77:		Line 77:
	int a, b, c;		int a, b, c;
	std::cin >> a >> b >> c;		std::cin >> a >> b >> c;
	g[a].push_back(pair_int(b, c));		g[a].push_back(pair_int(b, c));
	g[b].push_back(pair_int(a, c));		g[b].push_back(pair_int(a, c));
	}		}
	visit[1] = true;		visit[1] = true;
	for (int i = 1; i < n; i++) {		for (int i = 1; i < n; i++) {
	int x, y, min = 217483647;		int x, y, min = 217483647;
	for (int j = 1; j <= n; j++) {		for (int j = 1; j <= n; j++) {
	if (visit[j]) {		if (visit[j]) {
	for (int k = 0; k < g[j].size(); k++) {		for (int k = 0; k < g[j].size(); k++) {
	if (!visit[g[j][k].first] && g[j][k].second < min)		if (!visit[g[j][k].first] && g[j][k].second < min)
	min = g[j][k].second, x = j, y = g[j][k].first;		min = g[j][k].second, x = j, y = g[j][k].first;
	}		}
	}		}
	}		}
	visit[y] = true;		visit[y] = true;
	res += min;		res += min;
	}		}
Line 108:		Line 108:

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

175.124.46.11 at 10:50, 22 September 2016

2016-09-22T10:50:29Z

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

165.194.27.163 at 04:39, 20 September 2016

2016-09-20T04:39:57Z

@@ Line 2: / Line 2: @@
 = 오늘의 문제 =
-* [https://www.acmicpc.net/problem/1197|최소 스패닝 트리]
+* ~~[https://www.acmicpc.net/problem/1197|최소 스패닝 트리]~~
 = 참가자 =
+* 박인서
 = 코드 =
@@ Line 11: / Line 14: @@
 == 박인서 ==
 == 곽정흠 ==
@@ Line 18: / Line 55: @@
 == 박인서 ==
 == 곽정흠 ==

223.62.229.179: {CREATE}

2016-09-19T17:05:50Z

{CREATE}

New page

__TOC__

= 오늘의 문제 =
* [https://www.acmicpc.net/problem/1197|최소 스패닝 트리]

= 참가자 =
*

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

== 박인서 ==

== 곽정흠 ==

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

== 박인서 ==

== 곽정흠 ==