[트리]11월 22일

1121/14503.cpp

@@ -0,0 +1,66 @@
+//
+// Created by LG on 2021-11-17.
+//
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int r, c, dir, cnt;
+
+bool check(vector<vector<int>> board, int n, int m){
+    int dx[4] = {-1, 0, 1,0};
+    int dy[4] = {0, 1, 0, -1}; //왼쪽, 아래, 오른쪽, 위
+
+    for(int i=3; i>=0; i--){
+        r += dx[(dir+i)%4];
+        c += dy[(dir+i)%4];
+        if(r >= 0 && r < n && c >=0 && c < m && board[r][c]==0){
+            dir = (dir+i)%4;
+            return true;
+        }
+        r -= dx[(dir+i)%4];
+        c -= dy[(dir+i)%4];
+    }
+
+    r += dx[(dir+2)%4];
+    c += dy[(dir+2)%4];
+    if(r < 0 || r >=n || c < 0 || c >=m || board[r][c] == 1){
+        r -= dx[(dir+2)%4];
+        c -= dy[(dir+2)%4];
+        return false;
+    }
+    else
+        check(board, n, m);
+
+    return true;
+
+}
+
+int clean(vector<vector<int>> &board, int n, int m){
+    if(board[r][c] == 0){
+        board[r][c] = 2;
+        cnt++;
+    }
+
+    bool flag = check(board, n, m);
+    if(flag)
+        clean(board, n, m);
+    else
+        return cnt;
+
+    return cnt;
+}
+
+int main(){
+    int n, m;
+    cin >> n >> m >> r >> c >> dir;
+    vector<vector<int>> board(n, vector<int>(m, 0));
+    for(int i=0; i<n; i++){
+        for(int j=0; j<m; j++)
+            cin >> board[i][j];
+    }
+
+    cout << clean(board, n, m);
+
+}

1121/14675.cpp

@@ -0,0 +1,31 @@
+//
+// Created by LG on 2021-11-20.
+//
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main(){
+    ios_base :: sync_with_stdio(false);
+    cin.tie(NULL);
+    cout.tie(NULL);
+    int n, a, b, q, t, k;
+    cin >> n;
+    vector<int> tree(n+1);
+    for(int i=0; i<n-1; i++){
+        cin >> a >> b;
+        tree[a]++;
+        tree[b]++;
+    }
+
+    cin >> q;
+    while(q--){
+        cin >> t >> k;
+        if(t==1 && tree[k] == 1)
+            cout << "no\n";
+        else
+            cout << "yes\n";
+    }
+
+}

1121/15681.cpp

@@ -0,0 +1,53 @@
+//
+// Created by LG on 2021-11-20.
+//
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+vector<vector<int>> graph;
+vector<vector<int>> tree;
+vector<int> sizee;
+
+void makeTree(int currentNode, int parent){
+    for(int i=0; i<graph[currentNode].size(); i++){
+        if(graph[currentNode][i] != parent) {
+            tree[currentNode].push_back(graph[currentNode][i]);
+            makeTree(graph[currentNode][i], currentNode);
+        }
+    }
+}
+
+void countSubtreeNodes(int currentNode){
+    sizee[currentNode] = 1;
+    for(int i=0; i<tree[currentNode].size(); i++){
+        countSubtreeNodes(tree[currentNode][i]);
+        sizee[currentNode] += sizee[tree[currentNode][i]];
+    }
+}
+
+int main(){
+    int n, r, q, u, v;
+    cin >> n >> r >> q;
+    graph.assign(n+1, vector<int>(0));
+    tree.assign(n+1, vector<int>(0));
+    sizee.assign(n+1, 0);
+
+    n--;
+    while(n--){
+        cin >> u >> v;
+        graph[u].push_back(v);
+        graph[v].push_back(u);
+    }
+
+    makeTree(r, -1);
+    countSubtreeNodes(r);
+
+    while(q--){
+        cin >> u;
+        cout << sizee[u] << '\n';
+    }
+
+    return 0;
+}

1121/2011.cpp

@@ -0,0 +1,59 @@
+//
+// Created by LG on 2021-11-17.
+//
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+vector<int> pw;
+long long dp[5001];
+int len;
+
+int find(){
+
+    if(pw[0] == 0)
+        return 0;
+    dp[0] = 1;
+
+    if(pw[1] == 0) {
+        if (pw[0] < 3)
+            dp[1] = 1;
+    }
+    else{
+        if(pw[0] == 1 || (pw[0] == 2 && pw[1] < 7))
+            dp[1] = 2;
+        else
+            dp[1] = 1;
+    }
+
+    for(int i=2; i<len; i++){
+        if(pw[i] == 0){
+            if(pw[i-1] < 3 && pw[i-1] != 0)
+                dp[i] = dp[i-2];
+            else
+                return 0;
+        }
+        else{
+            if(pw[i-1] == 0)
+                    dp[i] = dp[i - 1];
+            else if(pw[i-1] == 1 || (pw[i-1] ==2 && pw[i] < 7))
+                dp[i] = dp[i-1] + dp[i-2];
+            else
+                dp[i] = dp[i-1];
+        }
+    }
+
+    return dp[len-1]%1000000;
+}
+
+int main(){
+    string s;
+    cin >> s;
+    len = s.length();
+    for(int i=0; i<len; i++){
+        pw.push_back(s[i]-'0');
+    }
+    cout << find();
+
+}

1121/5639.cpp

@@ -0,0 +1,33 @@
+//
+// Created by LG on 2021-11-20.
+//
+#include <iostream>
+#include <vector>
+#include <map>
+
+using namespace std;
+
+map<int, pair<int, int>> tree;
+vector<int> preorder;
+
+void divide(int left, int right){
+    if(left > right)
+        return;
+    int root = preorder[left];
+    int next = left+1;
+    while(preorder[next] < root && next < preorder.size())
+        next++;
+    divide(left+1, next-1);
+    divide(next, right);
+    cout << root << '\n';
+}
+int main(){
+    int root, node;
+    cin >> root;
+    preorder.push_back(root);
+    while(cin >> node){
+        preorder.push_back(node);
+    }
+    divide(0, preorder.size()-1);
+    return 0;
+}