Strongly Connected Component 문제 링크 https://www.acmicpc.net/problem/2150 문제 풀이 #pragma warning(disable:4996) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define MAX 26 #define INF 987654321 using namespace std; int v,e; vector graph, reverseGraph; stack node; vector visited; vector scc; vector res; void makeNode(int..
음악프로그램(백준, 2623번) 링크 : https://www.acmicpc.net/problem/2623 풀이 #pragma warning(disable:4996) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define MAX 26 #define INF 987654321 using namespace std; int n, k; vector res; vector graph; vector indegree; int main(void) { ios_base::sync_with_stdio(false); cin.tie(NULL); co..
문제 링크 : https://www.acmicpc.net/problem/1005 문제 풀이 #pragma warning(disable:4996) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define MAX 26 #define INF 987654321 using namespace std; int n, k; vector cost; vector visited; vector graph; vector output; int dfs(int idx) { if (visited[idx]) return visited[idx]; if (!ou..
줄 세우기 https://www.acmicpc.net/problem/2252 BFS로 작성시 #pragma warning(disable:4996) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define MAX 26 using namespace std; int n, m; vector mp; vector visited; vector res; bool isPure(int idx) { int counter = 0; for (int i = 0; i < n; i++) { if (mp[i][idx]) counter += 1; } ret..
#pragma warning(disable:4996) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define SIZE 52 #define MAX(X, Y) (X) > (Y) ? (X) : (Y) using namespace std; int mapp[SIZE][SIZE], dp[SIZE][SIZE], visited[SIZE][SIZE]; int dx[] = { 0, 0, -1, 1 }; int dy[] = { -1, 1, 0, 0 }; int N, M; int dfs(int y, int x) { if (y < 0 || x <..
#pragma warning(disable:4996) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define ll long long #define INF 987654321 #define pa pair int dirX[] = { 1,0 ,-1,0 }; int dirY[] = { 0,1,0,-1 }; using namespace std; int n, m; int mapp[101][101]; int visited[101][101]; void checkOutdoor() { queue q; q.push({ 0,0 }); visite..
#pragma warning(disable:4996) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define ll long long #define INF 987654321 #define pa pair using namespace std; int n, m; vectormapp; int dirX[] = { 1,0 ,-1,0 }; int dirY[] = { 0,1,0,-1 }; int day = 0; void dfs() { vector visited; visited = vector(n, vector(m, false)); int ..
문제 링크(www.acmicpc.net/problem/11066)](www.acmicpc.net/problem/11066) 내 코드(https://github.com/haung921209/TIL/blob/master/Documents/PS/DP/11066.md) 1. 첫번째 풀이 - 참조 후 푼 문제. 코드 #pragma warning(disable:4996) #include #include #include #include #include #include #include #include #include #include #include #include #include #include #define ll long long #define INF 987654321 using namespace std; vecto..