0601 jhh

2023/06_June/week1/정환훈/1727_커플 만들기.cpp

@@ -0,0 +1,58 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <cmath>
+using namespace std;
+int n, m;
+int dp[1010][1010];
+vector<int> mv;
+vector<int> gv;
+void input(){
+	cin >> n >> m;
+	mv = vector<int>(n);
+	gv = vector<int>(m);
+	for(int i=0;i<n;i++){
+		cin >> mv[i];		
+	}
+	for(int i=0;i<m;i++){
+		cin >> gv[i];
+	}
+	for(int i=0;i<n;i++){
+		for(int j=0;j<m;j++){
+			dp[i][j] = 987654321;
+		}
+	}
+}
+void solve(){
+	sort(mv.begin(), mv.end());
+	sort(gv.begin(), gv.end());
+	dp[0][0] = abs(mv[0] - gv[0]);
+	for(int i=1;i<gv.size();i++){
+		dp[0][i] = min(dp[0][i-1], abs(mv[0] - gv[i]));
+	}
+	for(int i=1;i<mv.size();i++){
+		dp[i][0] = min(dp[i-1][0], abs(mv[i] - gv[0]));
+	}
+	for(int i=1;i<mv.size();i++){
+		for(int j=1;j<gv.size();j++){
+			if(i == j){
+				dp[i][j] = dp[i-1][j-1] + abs(mv[i] - gv[i]);
+			}
+			else if(i > j){
+				dp[i][j] = min(dp[i-1][j-1] + abs(mv[i]-gv[j]), dp[i-1][j]);
+			}
+			else{
+				dp[i][j] = min(dp[i-1][j-1] + abs(mv[i]-gv[j]), dp[i][j-1]);
+			}
+		}
+	}	
+	cout << dp[n-1][m-1];
+}
+int main(){
+	ios_base::sync_with_stdio(0);
+	cin.tie(0);
+	cout.tie(0);
+	input();
+	solve();
+	return 0;
+}	

2023/06_June/week1/정환훈/17425_약수의 합.cpp

@@ -0,0 +1,38 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+using namespace std;
+typedef long long ll;
+int n;
+ll fn[1000001];
+ll gn[1000001];
+void input(){
+	cin >> n;
+}
+void go(){	
+	for(int i=1;i<=1000000;i++){		
+		for(int j=i;j<=1000000;j+=i){
+			fn[j] += i;
+		}
+	}	
+	for(int i=1;i<=1000000;i++){
+		gn[i] = gn[i-1] + fn[i];
+	}
+
+}
+void solve(){
+	cout << gn[n] << '\n';
+}
+int main(){
+	ios_base::sync_with_stdio(0);
+	cin.tie(0);
+	cout.tie(0);
+	int t;
+	cin >> t;
+	go();
+	for(int i=0;i<t;i++){
+		input();
+		solve();
+	}
+	return 0;
+}	

2023/06_June/week1/정환훈/17779_게리맨더링 2.cpp

@@ -0,0 +1,131 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+using namespace std;
+int board[21][21];
+int temp[21][21];
+int n;
+void input(){
+	cin >> n;
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=n;j++){
+			cin >> board[i][j];
+		}
+	}
+}
+void print(){
+	cout << '\n'; 
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=n;j++){
+			cout << temp[i][j] << " ";
+		}
+		cout << '\n';
+	}
+}
+int go(int x, int y, int d1, int d2){	
+	for(int i=0;i<21;i++){
+		for(int j=0;j<21;j++){
+			temp[i][j] = board[i][j];
+		}
+	}
+
+	for(int r=1;r<x+d1;r++){
+		for(int c=1;c<=y;c++){
+			temp[r][c] = 1;
+		}
+	}
+
+	for(int r=1;r<=x+d2;r++){
+		for(int c=y+1;c<=n;c++){
+			temp[r][c] = 2;
+		}
+	}
+
+	for(int r=x+d1;r<=n;r++){
+		for(int c=1;c<y-d1+d2;c++){
+			temp[r][c] = 3;
+		}
+	}
+
+	for(int r=x+d2+1;r<=n;r++){
+		for(int c=y-d1+d2;c<=n;c++){
+			temp[r][c] = 4;
+		}
+	}
+
+	vector<pair<int,int>> t;
+	for(int i=0;i<=d1;i++){
+		int nx = x + i;
+		int ny = y - i;
+		temp[nx][ny] = 5;
+		t.push_back({nx, ny});
+	}
+	for(int i=0;i<=d2;i++){
+		int nx = x + i;
+		int ny = y + i;
+		temp[nx][ny] = 5;
+		t.push_back({nx, ny});
+	}
+	for(int i=1;i<=d2;i++){
+		int nx = x + d1 + i;
+		int ny = y - d1 + i;
+		temp[nx][ny] = 5;
+		t.push_back({nx, ny});	
+	}
+	for(int i=1;i<=d1;i++){
+		int nx = x + d2 + i;
+		int ny = y + d2 - i;
+		temp[nx][ny] = 5;
+		t.push_back({nx, ny});
+	}
+	sort(t.begin(), t.end());
+	t.erase(unique(t.begin(), t.end()), t.end());	
+	for(int i=1;i<t.size()-1;i+=2){
+		pair<int,int> left = t[i];
+		pair<int,int> right = t[i+1];
+		int lx = left.first; int ly = left.second;
+		int rx = right.first; int ry = right.second;
+		for(int j=ly;j<=ry;j++){			
+			temp[lx][j] = 5;
+		}
+	}
+
+	vector<int> g = vector<int>(6, 0);
+	for(int i=1;i<=n;i++){
+		for(int j=1;j<=n;j++){
+			g[temp[i][j]] += board[i][j];
+		}
+	}	
+	return max({g[1], g[2], g[3], g[4], g[5]}) - min({g[1], g[2], g[3], g[4], g[5]});
+	//print();	
+}
+
+int go(int x, int y){
+	// (d1, d2 �� 1, 1 �� x < x+d1+d2 �� N, 1 �� y-d1 < y < y+d2 �� N)
+	int ret = 99999999;
+	for(int d1=1;d1<=n;d1++){
+		for(int d2=1;d2<=n;d2++){
+			if(d1 >= 1 && d2 >= 1 && 1 <= x && x + d1 + d2 <= n && 1 <= y - d1 && y - d1 < y && y < y + d2 && y + d2 <= n){
+				ret = min(ret, go(x, y, d1, d2));
+			}
+		}
+	}
+	return ret;
+}
+void solve(){	
+int ans = 9999999;
+	for(int i=0;i<n;i++){
+		for(int j=0;j<n;j++){
+			ans = min(ans, go(i, j));
+		}
+	}
+	cout << ans;
+}
+int main(){
+	ios_base::sync_with_stdio(0);
+	cin.tie(0);
+	cout.tie(0);
+	input();
+	solve();
+	return 0;
+}	

2023/06_June/week1/정환훈/21278_호석이 두 마리 치킨.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+using namespace std;
+int d[101][101];
+vector<pair<int, pair<int,int>>> v;
+int n, m;
+void input(){
+	cin >> n >> m;
+	for(int i=1;i<101;i++){
+		for(int j=1;j<101;j++){
+			d[i][j] = 987654321;			
+		}
+		d[i][i] = 0;
+	}	
+	for(int i=0;i<m;i++){
+		int from, to;
+		cin >> from >> to;
+		d[from][to] = 1;
+		d[to][from] = 1;
+	}
+}
+void go(int a, int b){
+	int ret = 0;
+	for(int i=1;i<=n;i++){
+		ret += min(d[i][a], d[i][b]) * 2;
+	}
+	v.push_back({ret, {a, b}});
+}
+void solve(){
+	for(int k=1;k<=n;k++){
+		for(int i=1;i<=n;i++){
+			for(int j=1;j<=n;j++){
+				d[i][j] = min(d[i][j], d[i][k] + d[k][j]);
+			}
+		}		
+	}
+	for(int i=1;i<=n;i++){
+		for(int j=i+1;j<=n;j++){
+			go(i, j);
+		}
+	}
+	sort(v.begin(), v.end());
+	cout << v.front().second.first << " " << v.front().second.second << " " << v.front().first; 
+}
+int main(){
+	ios_base::sync_with_stdio(0);
+	cin.tie(0);
+	cout.tie(0);
+	input();
+	solve();	
+	return 0;
+}	

2023/06_June/week1/정환훈/21758_꿀 따기.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+using namespace std;
+int n;
+vector<int> v;
+vector<int> pSum;
+void input(){
+	cin >> n;
+	v = vector<int>(n+1);
+	pSum = vector<int>(n+1);
+	for(int i=1;i<=n;i++){
+		cin >> v[i];
+		pSum[i] = pSum[i-1] + v[i];
+	}
+}
+void solve(){
+	int ans = 0;
+	// i k j
+	// i+1~k + k+1~j
+	for(int k=2;k<n;k++){		
+		ans = max(ans, pSum[k] - pSum[1] + pSum[n-1] - pSum[k-1]);
+	}
+	// i j k
+	// i+1~k + j+1~k
+	for(int j=2;j<n;j++){
+		ans = max(ans, pSum[n]- pSum[1] + pSum[n] - pSum[j] - v[j]);
+	}	
+	// 0 i n
+	// 0~i-1 + 0~n - v[i]
+	for(int i=2;i<n;i++){
+		ans = max(ans, pSum[i-1] + pSum[n-1] - v[i]);
+	}	
+	cout << ans;
+}
+int main(){
+	ios_base::sync_with_stdio(0);
+	cin.tie(0);
+	cout.tie(0);
+	input();
+	solve();	
+	return 0;
+}	

2023/06_June/week1/정환훈/22871_징검다리 건너기(large).cpp

@@ -0,0 +1,44 @@
+#include <iostream>
+#include <algorithm>
+#include <vector>
+#include <cmath>
+typedef long long ll;
+using namespace std;
+int n;
+ll v[5050];
+ll d[5050][5050];
+ll dp[5050];
+bool flag = false;
+void input(){
+	cin >> n;
+	for(int i=0;i<n;i++){
+		cin >> v[i];
+		dp[i] = 987654321;
+	}
+	for(int i=0;i<n;i++){
+		for(int j=i+1;j<n;j++){
+			d[i][j] = (j-i) * (1+abs(v[j] - v[i]));
+		}
+	}
+}
+void solve(){
+	// dp[3] = d[3][4]
+	// dp[2] = min(max(d[2][3], dp[3]), d[2][4])
+	// dp[1] = min(max(d[1][2], dp[2]), max(d[1][3], dp[3]), max(d[1][4], dp[4]))
+	dp[n-1] = 0;
+	dp[n-2] = d[n-2][n-1];
+	for(int i=3;i<=n;i++){
+		for(int j=0;j<i;j++){			 
+			dp[n-i] = min(dp[n-i], max(d[n-i][n-i+j], dp[n-i+j]));	
+		}
+	}	
+	cout << dp[0];
+}
+int main(){
+	ios_base::sync_with_stdio(0);
+	cin.tie(0);
+	cout.tie(0);
+	input();
+	solve();	
+	return 0;
+}