feat(codeforces): implement solution for p2189B

Author: lzwjava

src/main/java/com/lzw/solutions/codeforces/p2189B/Main.java

@@ -10,11 +10,40 @@ public class Main {
     private static final PrintWriter out = new PrintWriter(System.out, true);
 
     private static void solve() throws IOException {
-        // your code here
+        String line = in.readLine().trim();
+        int t = Integer.parseInt(line);
+        for (int test = 0; test < t; test++) {
+            line = in.readLine().trim();
+            String[] parts = line.split("\\s+");
+            int n = Integer.parseInt(parts[0]);
+            long x = Long.parseLong(parts[1]);
+            long free = 0;
+            long maxp = 0;
+            for (int i = 0; i < n; i++) {
+                line = in.readLine().trim();
+                parts = line.split("\\s+");
+                long a = Long.parseLong(parts[0]);
+                long b = Long.parseLong(parts[1]);
+                long c = Long.parseLong(parts[2]);
+                free += (b - 1) * a;
+                long p = b * a - c;
+                maxp = Math.max(maxp, p);
+            }
+            long ans;
+            if (free >= x) {
+                ans = 0;
+            } else if (maxp <= 0) {
+                ans = -1;
+            } else {
+                long need = x - free;
+                ans = (need + maxp - 1) / maxp;
+            }
+            out.println(ans);
+        }
     }
 
     public static void main(String[] args) throws IOException {
         solve();
         out.close();
     }
-}
+}

src/main/resources/codeforces/p2198B/1.in

@@ -0,0 +1,18 @@
+6
+1 1
+3 3 3
+1 7
+4 2 5
+2 4
+1 2 3
+2 2 4
+5 8
+12 1 11
+10 1 4
+1 1 3
+1 2 5
+2 1 7
+1 1000000000000000000
+1000000 4 654321
+1 10
+2 2 1