Taene's

[백준] 브론즈3-팰린드롬인지 확인하기 C++ 10988번

taene_ — Tue, 18 Mar 2025 21:02:15 +0900

// 일반 풀이

#include <iostream>
using namespace std;

string pel;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> pel;
	int start = 0;
	int end = pel.length() - 1;
	while (start <= end)
	{
		if (pel[start] != pel[end])
		{
			cout << 0;
			return 0;
		}

		start++;
		end--;
	}
	cout << 1;

	return 0;
}

// algorithm - reverse() 사용

#include <iostream>
#include <algorithm>
using namespace std;

string pel;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> pel;

	string tmp = pel;
	reverse(pel.begin(), pel.end());
	if (tmp == pel)
		cout << 1;
	else
		cout << 0;

	return 0;
}

[백준] 실버1-효율적인 해킹 C++ 1325번

taene_ — Mon, 24 Feb 2025 15:53:34 +0900

https://www.acmicpc.net/problem/1325

// 범위가 [1~10,000] 이므로 배열의 설정과 초기화는 모두 10001로 해줘야 한다.

#include <iostream>
#include <vector>
using namespace std;

int N, M;
int ret[10001];
int visited[10001];
vector<int> v[10001];

int dfs(int com)
{
	int cnt = 1;
	visited[com] = 1;

	for (auto it : v[com])
	{
		if (visited[it]) continue;
		cnt += dfs(it);
	}

	return cnt;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> N >> M;
	for (int i = 0; i < M; i++)
	{
		int a, b;
		cin >> a >> b;
		v[b].push_back(a);
	}

	int mx = 0;
	for (int i = 1; i <= N; i++)
	{
		//fill(&visited[0], &visited[0] + 10001, 0);
		memset(visited, 0, sizeof(visited));
		ret[i] = dfs(i);
		if (mx <= ret[i])
			mx = ret[i];
	}

	for (int i = 1; i <= N; i++)
	{
		if (mx == ret[i])
			cout << i << ' ';
	}

	return 0;
}

[백준] 골드5-트리 C++ 1068번

taene_ — Mon, 24 Feb 2025 15:09:23 +0900

https://www.acmicpc.net/problem/1068

#include <iostream>
#include <vector>
using namespace std;

int N, temp, root, removeNode;
vector<int> node[50];

int dfs(int searchNode)
{
	int ret = 0;
	int child = 0;
	for (auto i : node[searchNode])
	{
		if (i == removeNode)
			continue;

		ret += dfs(i);
		child++;
	}
	if (!child) return 1;
	return ret;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> temp;
		if (temp == -1)
			root = i;
		else
			node[temp].push_back(i);
	}

	cin >> removeNode;
	if (root == removeNode)
	{
		cout << 0 << '\n';
		return 0;
	}
	else
		cout << dfs(root) << '\n';

	return 0;
}

[백준] 골드4-치즈 C++ 2636번

taene_ — Mon, 24 Feb 2025 14:36:54 +0900

https://www.acmicpc.net/problem/2636

// 자기자신이 1이라면 (adj[y][x]==1) 방문한것도 알수있고 vector에 넣고 return할 수 있다.

#include <iostream>
#include <vector>
using namespace std;

int N, M;
int adj[100][100];
bool visited[100][100];
vector<pair<int, int>> eraser;
int ret, hour;
int dy[] = { -1,1,0,0 };
int dx[] = { 0,0,-1,1 };

void OneHour(int y, int x)
{
	visited[y][x] = 1;
	if (adj[y][x] == 1)
	{
		eraser.push_back({ y,x });
		return;
	}

	for (int i = 0; i < 4; i++)
	{
		int ny = y + dy[i];
		int nx = x + dx[i];

		if (ny < 0 || nx < 0 || ny >= N || nx >= M) continue;
		if (visited[ny][nx]) continue;

		OneHour(ny, nx);
	}

	return;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> N >> M;
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			cin >> adj[i][j];
		}
	}

	while (true)
	{
		fill(&visited[0][0], &visited[0][0] + 100 * 100, 0);
		eraser.clear();

		OneHour(0, 0);

		int cnt = eraser.size();

		if (cnt)
			ret = cnt;
		else
			break;

		for (auto it : eraser)
			adj[it.first][it.second] = 0;

		hour++;
	}
	cout << hour << '\n' << ret << '\n';

	return 0;
}

[백준] 골드4-연구소 C++ 14502번

taene_ — Mon, 24 Feb 2025 00:41:38 +0900

https://www.acmicpc.net/problem/14502

// 로직 1번 - 최대 64개 중 3개를 골라 벽을 세운다(조합)

// 로직 2번 - 최대 64개 중 바이러스(2)가 있는 곳으로부터 바이러스를 퍼트린다(dfs, bfs)

// 로직 3번 - 최대 64개 중 바이러스가 없는 안전구역(0)의 넓이를 구한다(counting)

// 최대 시간복잡도는 대충 64C3 * (64 + 64) ~= 5,000,000으로 시간복잡도 천만 이하는 효율 고려하지 않고 무식하게 푼다.

#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;

int N, M;
int adj[8][8];
bool visited[8][8];
vector<pair<int, int>> wall;
vector<pair<int, int>> virus;
int dy[] = { -1,1,0,0 };
int dx[] = { 0,0,-1,1 };
int ret;

void vir(int y, int x)
{
	visited[y][x] = 1;

	for (int i = 0; i < 4; i++)
	{
		int ny = y + dy[i];
		int nx = x + dx[i];

		if (ny < 0 || nx < 0 || ny >= N || nx >= M) continue;
		if (visited[ny][nx]) continue;
		if (adj[ny][nx] == 1) continue;

		vir(ny, nx);
	}
	return;
}

int solve()
{
	fill(&visited[0][0], &visited[0][0] + 8 * 8, 0);
	for (pair<int, int> i : virus)
	{
		vir(i.first, i.second);
	}

	int cnt = 0;
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			if (adj[i][j] == 0 && !visited[i][j])
				cnt++;
		}
	}
	return cnt;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> N >> M;
	for (int i = 0; i < N; i++)
	{
		for (int j = 0; j < M; j++)
		{
			cin >> adj[i][j];
			if (adj[i][j] == 2) virus.push_back({ i,j });
			if (adj[i][j] == 0) wall.push_back({ i,j });
		}
	}

	for (int i = 0; i < wall.size(); i++)
	{
		for (int j = 0; j < i; j++)
		{
			for (int k = 0; k < j; k++)
			{
				adj[wall[i].first][wall[i].second] = 1;
				adj[wall[j].first][wall[j].second] = 1;
				adj[wall[k].first][wall[k].second] = 1;
				
				ret = max(ret, solve());

				adj[wall[i].first][wall[i].second] = 0;
				adj[wall[j].first][wall[j].second] = 0;
				adj[wall[k].first][wall[k].second] = 0;
			}
		}
	}
	cout << ret;

	return 0;
}

[백준] 실버5-영화감독 숌 C++ 1436번

taene_ — Sun, 23 Feb 2025 23:10:20 +0900

https://www.acmicpc.net/problem/1436

#include <iostream>
#include <string>
using namespace std;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	int n;
	cin >> n;

	int i = 666;
	while (true)
	{
		if (to_string(i).find("666") != string::npos)
			n--;
		if (n == 0) break;
		i++;
	}
	cout << i;

	return 0;
}

[백준] 실버4-수학숙제 C++ 2870번

taene_ — Sun, 23 Feb 2025 22:00:41 +0900

https://www.acmicpc.net/problem/2870

#include <iostream>
#include <vector>
#include <string>
#include <algorithm>
using namespace std;

int N;
string s, ret;
vector<string> v;

bool cmp(string a, string b)
{
	if (a.size() == b.size())
		return a < b;
	return a.size() < b.size();
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> N;
	for (int i = 0; i < N; i++)
	{
		cin >> s;
		ret = "";

		for (int j = 0; j < s.size(); j++)
		{
			if (s[j] >= '0' && s[j] <= '9')
			{
				ret += s[j];
			}
			else
			{
				if (ret.size())
				{
					int k = 0;
					for (; ret[k] == '0'; k++);
					if (k == ret.size())
						k--;
					v.push_back(ret.substr(k));
					ret = "";
				}
			}
		}

		if (ret.size())
		{
			int k = 0;
			for (; ret[k] == '0'; k++);
			if (k == ret.size())
				k--;
			v.push_back(ret.substr(k));
			ret = "";
		}
	}

	sort(v.begin(), v.end(), cmp);
	for (string i : v)
		cout << i << '\n';

	return 0;
}

[백준] 실버5-비밀번호 발음하기 C++ 4659번

taene_ — Sun, 23 Feb 2025 19:39:06 +0900

https://www.acmicpc.net/problem/4659

// 단순 구현

#include <iostream>
using namespace std;

string s;

bool isVowel(char c)
{
	return (c == 'a' || c == 'e'
		|| c == 'i' || c == 'o' || c == 'u');
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	while (true)
	{
		cin >> s;
		if (s == "end") break;

		bool isaeiou = false;
		int vowelCnt = 0;	//모음
		int consonantCnt = 0;	//자음
		bool isContinuous = false;
		bool isSame = false;

		for (int i = 0; i < s.size(); i++)
		{
			if (!isaeiou && isVowel(s[i]))
				isaeiou = true;

			if (isVowel(s[i]))
			{
				vowelCnt++;
				consonantCnt = 0;
			}
			else
			{
				consonantCnt++;
				vowelCnt = 0;
			}

			if (vowelCnt == 3 || consonantCnt == 3)
				isContinuous = true;
		}
		for (int i = 0; i < s.size() - 1; i++)
		{
			if (s[i] == s[i + 1] && s[i] != 'e' && s[i] != 'o')
				isSame = true;
		}
		if (isaeiou && !isContinuous && !isSame)
			cout << "<" << s << ">" << " is acceptable." << '\n';
		else
			cout << "<" << s << ">" << " is not acceptable." << '\n';
	}
	

	return 0;
}

#include <iostream>
using namespace std;

string s;

bool isVowel(char c)
{
	return (c == 'a' || c == 'e'
		|| c == 'i' || c == 'o' || c == 'u');
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	while (true)
	{
		cin >> s;
		if (s == "end") break;

		bool isaeiou = false;
		int vowelCnt = 0;	//모음
		int consonantCnt = 0;	//자음
		bool isContinuous = false;
		bool isSame = false;
		int prev = -1;

		for (int i = 0; i < s.size(); i++)
		{
			if (isVowel(s[i]))
			{
				isaeiou = true;
				vowelCnt++;
				consonantCnt = 0;
			}
			else
			{
				consonantCnt++;
				vowelCnt = 0;
			}

			if (vowelCnt == 3 || consonantCnt == 3)
				isContinuous = true;

			if (i >= 1&&s[i] == s[prev] && s[i] != 'e' && s[i] != 'o')
				isSame = true;

			prev = i;
		}
		if (isaeiou && !isContinuous && !isSame)
			cout << "<" << s << ">" << " is acceptable." << '\n';
		else
			cout << "<" << s << ">" << " is not acceptable." << '\n';
	}

	return 0;
}

[백준] 실버3-빈도 정렬 C++ 2910번

taene_ — Sun, 23 Feb 2025 16:55:21 +0900

https://www.acmicpc.net/problem/2910

// map 배열을 key가 아닌 value를 기준으로 정렬하고 싶다면,

// vector에 넣어서 (custom operator 기준으로) sort를 해야한다.

#include <iostream>
#include <vector>
#include <map>
#include <algorithm>
using namespace std;

int n, c;
map<int, pair<int, int>> mp;	// key, {count, index}

bool cmp(pair<int, pair<int, int>>& a, pair<int, pair<int, int>>& b)
{
	if (a.second.first == b.second.first)
		return a.second.second < b.second.second;
	return a.second.first > b.second.first;
}

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> n >> c;
	for (int i = 0; i < n; i++)
	{
		int temp;
		cin >> temp;
		if (mp.find(temp) != mp.end())
		{
			mp[temp].first++;
		}
		else
			mp.insert({ temp,{1,i} });
	}

	vector<pair<int, pair<int, int>>> v(mp.begin(), mp.end());

	sort(v.begin(), v.end(), cmp);

	for (auto it : v)
	{
		int cnt = it.second.first;
		while (cnt--)
		{
			cout << it.first << ' ';
		}
	}

	return 0;
}

[백준] 실버5-사과 담기 게임 C++ 2828번

taene_ — Sun, 23 Feb 2025 14:44:29 +0900

https://www.acmicpc.net/problem/2828

#include <iostream>
#include <vector>
using namespace std;

int N, M, J;
int l, r;
int cnt;

int main()
{
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);

	cin >> N >> M;
	cin >> J;
	l = 1;
	r = l + M - 1;
	for (int i = 0; i < J; i++)
	{
		int local;
		cin >> local;

		if (local < l)
		{
			cnt += l - local;
			l = local;
			r = l + M - 1;
		}
		else if (local > r)
		{
			cnt += local - r;
			r = local;
			l = r - M + 1;
		}
	}
	cout << cnt;

	return 0;
}