[투포인터] 11월 14일

11_투포인터/14503.cpp

@@ -0,0 +1,63 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+const int max_n = 50;
+const int max_m = 50;
+
+const int dx[] = {-1, 0, 1, 0};
+const int dy[] = {0, 1, 0, -1};
+
+int cleanRoom(int n, int m, int robotr, int robotc, int robotf, int room[max_n][max_m])
+{
+    int count = 0;
+
+    while (true) {
+        if (room[robotr][robotc] == 0) {
+            room[robotr][robotc] = -1;
+            count++;
+        }
+
+        if (room[robotr - 1][robotc] != 0 && room[robotr][robotc + 1] != 0 &&
+            room[robotr + 1][robotc] != 0 && room[robotr][robotc - 1] != 0) {
+            int backr = robotr - dx[robotf];
+            int backc = robotc - dy[robotf];
+            if (room[backr][backc] == 1) {
+                break;
+            }
+            robotr = backr;
+            robotc = backc;
+        } else {
+            robotf = (robotf + 3) % 4;
+            int nextr = robotr + dx[robotf];
+            int nextc = robotc + dy[robotf];
+
+            if (room[nextr][nextc] == 0) {
+                robotr = nextr;
+                robotc = nextc;
+            }
+        }
+    }
+
+    return count;
+}
+
+
+int main()
+{
+    int n, m, result, robot_r, robot_c, robot_f;
+    int room[max_n][max_m];
+    cin >> n >> m;
+    cin >> robot_r >> robot_c >> robot_f;
+
+    for(int i = 0; i < n; i++){
+        for(int j = 0; j < m; j++){
+            cin >> room[i][j];
+        }
+    }
+
+    result = cleanRoom(n, m, robot_r, robot_c, robot_f, room);
+    cout << result;
+
+    return 0;
+}

11_투포인터/20922.cpp

@@ -0,0 +1,40 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+const int max_num = 100001;
+
+int maxLength(int n, int k, vector<int>& list)
+{
+    vector<int> count(max_num, 0);
+    int max_length = 0;
+    int left = 0;
+
+    for(int right = 0; right < n; right++){
+        count[list[right]] += 1;
+
+        while(count[list[right]] > k){
+            count[list[left]] -= 1;
+            left++;
+        }
+        max_length = max(max_length, right-left+1);
+    }
+    return max_length;
+}
+
+
+int main()
+{
+    int n, k, result;
+    cin >> n >> k;
+
+    vector<int> list(n);
+    for(int i = 0; i < n; i++){s
+        cin >> list[i];
+    }
+
+    result = maxLength(n, k, list);
+    cout << result;
+
+    return 0;
+}

11_투포인터/2531.cpp

@@ -0,0 +1,57 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int maxSushi(int n, int d, int k, int c, vector<int>& belt)
+{
+    vector<int> count(d+1, 0);
+    int plate = 0;
+    int max_plate = 0;
+
+    for(int i = 0; i < k; i++){
+        if(count[belt[i]] == 0){
+            plate += 1;
+        }
+        count[belt[i]] += 1;
+    }
+
+    for(int i = 0; i < n; i++){
+        count[belt[i]] -= 1;
+        if(count[belt[i]] == 0){
+            plate -= 1;
+        }
+
+        int temp = (i+k) % n;
+        count[belt[temp]] += 1;
+        if(count[belt[temp]] == 1){
+            plate += 1;
+        }
+
+        if(count[c] == 0){
+            max_plate = max(max_plate, plate + 1);
+        }
+        else{
+            max_plate = max(max_plate, plate);
+        }
+
+    }
+    return max_plate;
+}
+
+
+int main()
+{
+    int n, d, k, c, result;
+    cin >> n >> d >> k >> c;
+
+    vector<int> belt(n);
+    for(int i = 0; i < n; i++){
+        cin >> belt[i];
+    }
+
+    result = maxSushi(n, d, k, c, belt);
+    cout << result;
+
+    return 0;
+}