[WiP] 201902654

201902654/10026.cpp

@@ -0,0 +1,74 @@
+#include <string>
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <stack>
+#include <algorithm>
+
+using namespace std;
+#define X first
+#define Y second
+int dx[4] = {0, 0, 1, -1};
+int dy[4] = {1, -1, 0, 0};
+char board[101][101];
+bool is_visit[101][101];
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    int N;
+    int normal_result = 0;
+    int abnormal_result = 0;
+    queue<pair<int, int> > Q;
+    cin >> N;
+    for (int i=0;i<N;i++) {
+      string line;
+      cin >> line;
+      for (int j=0;j<N;j++) {
+        board[i][j] = line.at(j);
+      }
+    }
+    for (int y=0;y<N;y++) {
+      for (int x=0;x<N;x++) {
+        if (!is_visit[y][x]) {
+          normal_result++;
+          is_visit[y][x] = true;
+          Q.push(make_pair(x, y));
+          while (!Q.empty()) {
+            pair<int, int> top = Q.front(); Q.pop();
+            for (int i=0;i<4;i++) {
+              int nx = top.X + dx[i];
+              int ny = top.Y + dy[i];
+              if (0 <= nx && nx < N && 0 <= ny && ny < N && !is_visit[ny][nx] && board[ny][nx] == board[top.Y][top.X]) {
+                is_visit[ny][nx] = true;
+                Q.push(make_pair(nx, ny));
+              }
+            }
+          }
+        }
+      }
+    }
+    for (int i=0;i<N;i++) fill(is_visit[i], is_visit[i] + N, false);
+    for (int y=0;y<N;y++) {
+      for (int x=0;x<N;x++) {
+        if (!is_visit[y][x]) {
+          abnormal_result++;
+          is_visit[y][x] = true;
+          Q.push(make_pair(x, y));
+          while (!Q.empty()) {
+            pair<int, int> top = Q.front(); Q.pop();
+            for (int i=0;i<4;i++) {
+              int nx = top.X + dx[i];
+              int ny = top.Y + dy[i];
+              if (0 <= nx && nx < N && 0 <= ny && ny < N && !is_visit[ny][nx] && (board[ny][nx] == board[top.Y][top.X] || (board[ny][nx] == 'R' && board[top.Y][top.X] == 'G') || (board[ny][nx] == 'G' && board[top.Y][top.X] == 'R'))) {
+                is_visit[ny][nx] = true;
+                Q.push(make_pair(nx, ny));
+              }
+            }
+          }
+        }
+      }
+    }
+    cout << normal_result << ' ' << abnormal_result;
+    return 0;
+}

201902654/1012.cpp

@@ -0,0 +1,59 @@
+#include <string>
+#include <vector>
+#include <iostream>
+#include <queue>
+#include <stack>
+#include <algorithm>
+
+using namespace std;
+#define X first
+#define Y second
+int dx[4] = {0, 0, 1, -1};
+int dy[4] = {1, -1, 0, 0};
+int board[51][51];
+int is_visit[51][51];
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    int T;
+    cin >> T;
+    for (int i=0;i<T;i++) {
+      int M, N, K;
+      int result = 0;
+      queue<pair<int, int> > Q;
+      cin >> M >> N >> K;
+      for (int y=0;y<N;y++) {
+        fill(board[y], board[y] + M, 0);
+        fill(is_visit[y], is_visit[y] + M, false);
+      }
+      for (int i=0;i<K;i++) {
+        int x, y;
+        cin >> x >> y;
+        board[y][x] = 1;
+      }
+      for (int y=0;y<N;y++) {
+        for (int x=0;x<M;x++) {
+          if (board[y][x] == 1 && !is_visit[y][x]) {
+            result++;
+            Q.push(make_pair(x, y));
+            is_visit[y][x] = true;
+            while (!Q.empty()) {
+              pair<int, int> top = Q.front(); Q.pop();
+              for (int i=0;i<4;i++) {
+                int nx = top.X + dx[i];
+                int ny = top.Y + dy[i];
+                if (0 <= nx && nx < M && 0 <= ny && ny < N && is_visit[ny][nx] == false && board[ny][nx] == 1) {
+                  is_visit[ny][nx] = true;
+                  Q.push(make_pair(nx, ny));
+                }
+              }
+            }
+          }
+        }
+      }
+      cout << result << '\n';
+    }
+
+    return 0;
+}

201902654/1021.cpp

@@ -0,0 +1,61 @@
+#include <string>
+#include <deque>
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int N, M;
+    int result = 0;
+    deque<int> D;
+    cin >> N >> M;
+    for (int i=0;i<N;i++) {
+      D.push_back(i+1);
+    }
+    for (int i=0;i<M;i++) {
+      int value;
+      cin >> value;
+      int front_count = 0;
+      int back_count = 0;
+      while (D.front() != value) {
+        D.push_back(D.front());
+        D.pop_front();
+        front_count++;
+      }
+      for (int i=0;i<front_count;i++) {
+        D.push_front(D.back());
+        D.pop_back();
+      }
+      while (D.front() != value) {
+        D.push_front(D.back());
+        D.pop_back();
+        back_count++;
+      }
+      for (int i=0;i<back_count;i++) {
+        D.push_back(D.front());
+        D.pop_front();
+      }
+
+      if (front_count > back_count) {
+        for (int i=0;i<back_count;i++) {
+          D.push_front(D.back());
+          D.pop_back();
+        }
+        D.pop_front();
+        result = result + back_count;
+      } else {
+        for (int i=0;i<front_count;i++) {
+          D.push_back(D.front());
+          D.pop_front();
+        }
+        D.pop_front();
+        result = result + front_count;
+      }
+    }
+    cout << result;
+
+    return 0;
+}

201902654/1074.cpp

@@ -0,0 +1,29 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+#define X first
+#define Y second
+int order;
+int N, r, c;
+
+int record(int N, int x, int y) {
+  int half = pow(2, N-1);
+  if (N == 0) {
+    return 0;
+  }
+  if (x < half && y < half) return record(N-1, x, y);
+  if (x >= half && y < half) return half * half * 1 + record(N-1, x-half, y);
+  if (x < half && y >= half) return half * half * 2 + record(N-1, x, y-half);
+  if (x >= half && y >= half) return half * half * 3 + record(N-1, x-half, y-half);
+}
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    cin >> N >> r >> c;
+
+    cout << record(N, c, r);
+
+
+    return 0;
+}

201902654/10773.cpp

@@ -0,0 +1,35 @@
+#include <string>
+#include <stack>
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int K;
+    long result = 0;
+    stack<int> stack;
+    cin >> K;
+
+    for (int i=0;i<K;i++) {
+      int input;
+      cin >> input;
+
+      if (input == 0) {
+        stack.pop();
+      } else {
+        stack.push(input);
+      }
+    }
+
+    while (!stack.empty()) {
+      result = result + stack.top();
+      stack.pop();
+    }
+
+    cout << result;
+
+    return 0;
+}

201902654/10799.cpp

@@ -0,0 +1,32 @@
+#include <string>
+#include <stack>
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    string line;
+    stack<char> S;
+    long result = 0;
+    cin >> line;
+    for (int i=0;i<line.size();i++) {
+      char ch = line.at(i);
+      if (ch == '(') {
+        S.push(ch);
+      } else {
+        if (line.at(i - 1) == '(') {
+          S.pop();
+          result += S.size();
+        } else {
+          S.pop();
+          result++;
+        }
+      }
+    }
+    cout << result;
+
+    return 0;
+}

201902654/10807.cpp

@@ -0,0 +1,24 @@
+#include <string>
+#include <vector>
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+    int N;
+    cin >> N;
+    int count[201];
+    fill(count, count+201, 0);
+    for (int i=0;i<N;i++) {
+      int val;
+      cin >> val;
+      count[val + 100]++;
+    }
+    int find;
+    cin >> find;
+    cout << count[find+100];
+
+    return 0;
+}

201902654/10808.cpp

@@ -0,0 +1,20 @@
+#include <iostream>
+#include <vector>
+#include <string>
+
+using namespace std;
+
+int main(void) {
+  string s;
+  getline(cin, s);
+  vector<int> alpha(26, 0);
+
+  for (int i=0;i<s.length();++i){
+    int index = s[i] - 'a';
+    ++alpha[index];
+  }
+
+  for (int iter : alpha) {
+    cout << iter << ' ';
+  }
+}

201902654/10828.cpp

@@ -0,0 +1,46 @@
+#include <stack>
+#include <string>
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    ios::sync_with_stdio(0);
+    cin.tie(0);
+
+    int N;
+    stack<int> stack;
+    cin >> N;
+    for (int i=0;i<N;i++) {
+      string command;
+      cin >> command;
+      if (command == "push") {
+        int val;
+        cin >> val;
+        stack.push(val);
+      } else if (command == "pop") {
+        if (stack.empty()) {
+          cout << -1 << '\n';
+        } else {
+          cout << stack.top() << '\n';
+          stack.pop();
+        }
+      } else if (command == "size") {
+        cout << stack.size() << '\n';
+      } else if (command == "empty") {
+        if (stack.empty()) {
+          cout << 1 << '\n';
+        } else {
+          cout << 0 << '\n';
+        }
+      } else {
+        if (stack.empty()) {
+          cout << -1 << '\n';
+        } else {
+          cout << stack.top() << '\n';
+        }
+      }
+    }
+
+    return 0;
+}