update

OneCodeMonkey · OneCodeMonkey · commit 16c29612d8e2 · 2025-02-02T00:26:50.000+08:00
diff --git a/codeForces/Codeforces_2033A_Sakurako_and_Kosuke.java b/codeForces/Codeforces_2033A_Sakurako_and_Kosuke.java
@@ -0,0 +1,17 @@
+// Time: 249 ms 
+// Memory: 600 KB
+// .
+// T:O(t), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2033A_Sakurako_and_Kosuke {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt();
+            System.out.println(n % 2 == 0 ? "Sakurako" : "Kosuke");
+        }
+    }
+}
diff --git a/codeForces/Codeforces_2036A_Quintomania.java b/codeForces/Codeforces_2036A_Quintomania.java
@@ -0,0 +1,30 @@
+// AC: 265 ms 
+// Memory: 400 KB
+// .
+// T:O(sum(ni)), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2036A_Quintomania {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt(), prev = -1;
+            boolean flag = true;
+            for (int j = 0; j < n; j++) {
+                int a = sc.nextInt(), diff = Math.abs(a - prev);
+                if (j == 0) {
+                    prev = a;
+                    continue;
+                }
+                if (flag && (diff != 5 && diff != 7)) {
+                    flag = false;
+                }
+                prev = a;
+            }
+
+            System.out.println(flag ? "YES" : "NO");
+        }
+    }
+}
diff --git a/codeForces/Codeforces_2036B_Startup.java b/codeForces/Codeforces_2036B_Startup.java
@@ -0,0 +1,32 @@
+// AC: 1264 ms 
+// Memory: 15900 KB
+// greedy.
+// T:O(sum(nilogni)), S:O(max(ni))
+// 
+import java.util.ArrayList;
+import java.util.Collections;
+import java.util.HashMap;
+import java.util.List;
+import java.util.Scanner;
+
+public class Codeforces_2036B_Startup {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt(), k = sc.nextInt(), ret = 0;
+            HashMap<Integer, Integer> typeToCost = new HashMap<>();
+            for (int j = 0; j < k; j++) {
+                int b = sc.nextInt(), c = sc.nextInt();
+                typeToCost.merge(b, c, Integer::sum);
+            }
+            List<Integer> costs = new ArrayList<>(typeToCost.values());
+            Collections.sort(costs, Collections.reverseOrder());
+            for (int j = 0; j < Math.min(n, costs.size()); j++) {
+                ret += costs.get(j);
+            }
+
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/codeForces/Codeforces_2037A_Twice.java b/codeForces/Codeforces_2037A_Twice.java
@@ -0,0 +1,27 @@
+// AC: 296 ms 
+// Memory: 0 KB
+// .
+// T:O(sum(ni)), S:O(max(ni))
+// 
+import java.util.HashMap;
+import java.util.Scanner;
+
+public class Codeforces_2037A_Twice {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt(), ret = 0;
+            HashMap<Integer, Integer> record = new HashMap<>();
+            for (int j = 0; j < n; j++) {
+                int a = sc.nextInt();
+                record.merge(a, 1, Integer::sum);
+            }
+            for (int j : record.keySet()) {
+                ret += record.get(j) / 2;
+            }
+
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/codeForces/Codeforces_2044C_Hard_Problem.java b/codeForces/Codeforces_2044C_Hard_Problem.java
@@ -0,0 +1,20 @@
+// Time: 312 ms 
+// Memory: 500 KB
+// .
+// T:O(t), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2044C_Hard_Problem {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int m = sc.nextInt(), a = sc.nextInt(), b = sc.nextInt(), c = sc.nextInt(), ret = 0;
+            ret = Math.min(m, a) + Math.min(m, b);
+            ret = Math.min(2 * m, ret + c);
+
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/codeForces/Codeforces_2050A_Line_Breaks.java b/codeForces/Codeforces_2050A_Line_Breaks.java
@@ -0,0 +1,30 @@
+// AC: 358 ms 
+// Memory: 800 KB
+// .
+// T:O(sum(ni)), S:O(1)
+// 
+import java.util.Scanner;
+
+public class Codeforces_2050A_Line_Breaks {
+    public static void main(String[] args) {
+        Scanner sc = new Scanner(System.in);
+        int t = sc.nextInt();
+        for (int i = 0; i < t; i++) {
+            int n = sc.nextInt(), m = sc.nextInt(), curLen = 0, ret = 0;
+            boolean flag = true;
+            for (int j = 0; j < n; j++) {
+                String s = sc.next();
+                if (!flag) {
+                    continue;
+                }
+                if (curLen + s.length() <= m) {
+                    curLen += s.length();
+                    ret++;
+                } else {
+                    flag = false;
+                }
+            }
+            System.out.println(ret);
+        }
+    }
+}
diff --git a/leetcode_solved/leetcode_3432_Count_Partitions_with_Even_Sum_Difference.java b/leetcode_solved/leetcode_3432_Count_Partitions_with_Even_Sum_Difference.java
@@ -0,0 +1,21 @@
+// Runtime 0 ms Beats 100.00%
+// Memory 41.89 MB Beats 87.69%
+// .
+// T:O(1), S:O(n)
+// 
+class Solution {
+    public int countPartitions(int[] nums) {
+        int sum = 0, cur = 0, ret = 0;
+        for (int i : nums) {
+            sum += i;
+        }
+        for (int i = 0; i < nums.length - 1; i++) {
+            cur += nums[i];
+            if ((sum - 2 * cur) % 2 == 0) {
+                ret++;
+            }
+        }
+
+        return ret;
+    }
+}
