[ 트리 ] 11월 21일

12_트리/1390.cpp

@@ -0,0 +1,69 @@
+#include <iostream>
+#include <queue>
+
+using namespace std;
+
+int main(){
+
+    int n, x_in, y_in , k, l, cnt=0, dir=0, x=0, y=0;
+    char d;
+
+    int board[101][101];
+    bool visited[101][101];
+    queue<pair<int, int>> snake;
+    int dx[4]={1, 0, -1, 0};
+    int dy[4]={0, 1, 0, -1};
+
+    snake.push(make_pair(x, y));
+
+    cin >> n;
+    cin >> k;
+
+    for(int i=0;i<k;i++){
+        cin >> x_in >> y_in;
+        board[x_in-1][y_in-1]=1;
+    }
+
+    cin>>l;
+
+    for(int i=0;i<l;i++){
+
+        int num;
+
+        cin >> num >> d;
+
+        while(cnt<num||i==l-1){ 
+            int nx=x+dx[dir];
+            int ny=y+dy[dir];
+            cnt++;
+
+            if(nx<0||ny<0||nx>=n||ny>=n||visited[ny][nx]){
+                cout << cnt;
+                return 0;
+            }
+            if(board[ny][nx]==1){
+                board[ny][nx]=0;
+                snake.push(make_pair(nx, ny));
+                visited[ny][nx]=true;
+                }
+            else{
+                snake.push(make_pair(nx,ny)); 
+                visited[ny][nx]=true; 
+                visited[snake.front().second][snake.front().first]=false;
+                snake.pop();
+                }
+
+            x=nx;
+            y=ny;
+            if(cnt==num){
+                if(d=='D'){
+                    dir=(dir+1)%4; 
+                }
+                else if(d=='L'){
+                    dir=(dir+3)%4;
+                }
+            }
+        }
+    }
+    return 0;
+}

12_트리/15681.cpp

@@ -0,0 +1,50 @@
+#include <iostream>
+#include <vector>
+#include <cstring>
+
+using namespace std;
+
+vector<int> v[100001];
+bool visited[100001];
+int num_arr[100001];
+
+void dfs(int num, int upperN) {
+	visited[num]=true;
+	for(int i=0;i<v[num].size();i++){
+		int next=v[num][i];
+		if(visited[next]==false){
+         dfs(next,num);   
+        }
+	}
+	if(upperN!=-1){
+        num_arr[upperN]+=num_arr[num];
+    }
+}
+
+int main() {
+
+	ios_base::sync_with_stdio(false); 
+    cin.tie(NULL);cout.tie(NULL);
+
+    int n, q, r;
+
+	cin >> n >> r >> q;
+    fill_n(num_arr,100001,1);
+
+	for(int i=0;i<n-1;i++){
+        int temp1,temp2;
+
+		cin >> temp1 >> temp2;
+		v[temp1].push_back(temp2);
+		v[temp2].push_back(temp1);
+	}
+
+    dfs(r, -1);
+
+	for(int i=0;i<q;i++){
+        int temp;
+		cin >> temp;
+		cout << num_arr[temp] << '\n';
+	}
+	return 0;
+}

12_트리/1967.cpp

@@ -0,0 +1,54 @@
+#include<iostream>
+#include<vector>
+#include<cstring>
+
+using namespace std;
+
+bool visited[100001];
+vector<pair<int, int>> board[100001];
+int endI;
+
+void dfs(int x, int len, int &answer){
+
+    if(visited[x]==true){
+        return;
+    }
+
+	visited[x]=true;
+
+	if(len>answer){
+		answer=len;
+		endI=x;
+	}
+
+	for(int i=0;i<board[x].size();i++){
+		dfs(board[x][i].first,len+board[x][i].second,answer);
+	}
+}
+
+int main()
+{
+	ios::sync_with_stdio(false);
+	cin.tie(NULL);cout.tie(NULL);
+
+	int n, o, p, q, answer=0;
+
+	cin >> n;
+
+	for(int i=1;i<n;i++){
+		cin >> o >> p >> q;
+
+		board[o].push_back(make_pair(p,q));
+		board[p].push_back(make_pair(o,q));
+	}
+
+	dfs(1,0,answer);
+
+	memset(visited,false,sizeof(visited));
+
+	dfs(endI,0,answer);
+
+	cout << answer;
+
+	return 0;
+}

12_트리/24545.cpp

@@ -0,0 +1,90 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+vector<vector<int>> vec(100001, vector<int>());
+int twoV[2]={0,0};
+int max_len=-1;
+vector<int> board(100001, 0);
+bool visited[100001];
+
+void dfs(int nowN, int prevN, int len, int i, int &n){
+	if(max_len<len){
+		max_len=len;
+		twoV[i]=nowN;
+	}
+	for(int j=0;j<vec[nowN].size();j++){
+		int nextN=vec[nowN][j];
+		if(nextN!=prevN){
+		    dfs(nextN, nowN, len+1, i, n);
+		}
+	}
+}
+
+bool route(int nowN, int pointN, int prevN, int len){
+	board[len]=nowN;
+	if(nowN==pointN){
+		return true;
+	}
+	bool forCheck=false;
+	for(int j=0;j<vec[nowN].size();j++){
+		int nextN=vec[nowN][j];
+		if(nextN==prevN){
+		    continue;
+		}
+		forCheck|=route(nextN, pointN, nowN, len+1);
+		if(forCheck==true){
+		    break;
+		}
+	}
+	return forCheck;
+}
+
+int dfs2(int nowN){
+	int maxInt=0;
+	for(int j=0;j<vec[nowN].size();j++){
+		int nextN=vec[nowN][j];
+		if(visited[nextN]){
+		    continue;
+		}
+		visited[nextN]=true;
+		maxInt=max(maxInt,dfs2(nextN));
+	}
+	return maxInt+1;
+}
+
+int main()
+{
+	ios_base::sync_with_stdio(false);
+    cin.tie(NULL);cout.tie(NULL);
+
+	int n;
+
+	cin >> n;
+
+	for(int i=1;i<=n-1;i++){
+		int temp1, temp2;
+		cin >> temp1 >> temp2;
+		vec[temp1].push_back(temp2);
+		vec[temp2].push_back(temp1);
+	}
+	for(int i=0;i<100001;i++){
+		visited[i]=false;
+	}
+	dfs(1, 0, 0, 0, n);
+	max_len=-1;
+	dfs(twoV[0], 0, 0, 1, n);
+	route(twoV[0], twoV[1], 0, 0);
+
+	for(int i=0;i<=max_len;i++){
+		visited[board[i]]=true;
+	}
+	int maxInt=1;
+	for(int i=1;i<=max_len-1;i++){
+		maxInt=max(maxInt,dfs2(board[i]));
+	}
+	cout << (maxInt==1?0:max_len+maxInt);
+
+	return 0;
+}

12_트리/5639.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+vector<int> tree;
+
+void searchTree(int start, int end){
+    int i;
+
+	if(start>=end){
+		return;
+	}
+	if(start==end-1){
+	    cout << tree[start] << '\n';
+	    return;
+	}
+
+	for(i=start+1;i<end;i++){
+	    if(tree[start]<tree[i]){
+	        break;
+	    }
+	}
+
+	searchTree(start+1,i);
+	searchTree(i,end);
+	cout << tree[start] << '\n';
+}
+
+int main(){
+	ios::sync_with_stdio(false);
+	cin.tie(NULL);cout.tie(NULL);
+
+	int n;
+	while(cin >> n){
+		tree.push_back(n);
+	}
+
+	searchTree(0,tree.size());
+
+	return 0;
+}