CF Update

Author: Tanjim131

Codeforces/1300/263-2-B.cpp

@@ -20,7 +20,7 @@ int main(int argc, char const *argv[])
  long long answer = 0;
  for(int i = 0 ; i < 26 && k != 0 ; ++i){
  int can = min(cards[i], k);
- if(can <= cards[i]){ // if I can't take more than what cards[i] has, then double the quantity
+ if(can <= cards[i]){ // if I can't take more than what cards[i] has, then square the quantity
  answer += 1LL * can * can;
  } else{ // I can take more than what cards[i] has
  answer += can;

Codeforces/EDU/Binary Search/2-F.cpp

@@ -0,0 +1,53 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+// is p a sub-sequence of modified
+bool isSubsequence(const string &modified, const string &p){
+ int index = 0;
+ for(int i = 0 ; i < modified.length() && index < p.length() ; ++i){
+ if(modified[i] == p[index]){
+ ++index;
+ }
+ }
+ return index == p.length();
+}
+
+bool ok(const string &t, const string &p, const vector <int> &perm, int value){
+ string modified{t};
+ for(int i = 0; i < value ; ++i){
+ modified[perm[i] - 1] = '#'; // any dummy character
+ }
+ return isSubsequence(modified, p);
+}
+
+int binary_search(const string &t, const string &p, const vector <int> &perm){
+ int low = 0, high = t.length() - 1;
+ int ans = -1;
+ while(low <= high){
+ int mid = (low + high) / 2;
+ if(ok(t, p, perm, mid)){
+ ans = mid;
+ low = mid + 1;
+ } else{
+ high = mid - 1;
+ }
+ }
+ return ans;
+}
+
+int main(int argc, char const *argv[])
+{
+ // ios_base::sync_with_stdio(false);
+ // cin.tie(0);
+ string t, p;
+ cin >> t >> p;
+ vector <int> perm(t.length());
+ for(int i = 0 ; i < perm.size() ; ++i){
+ cin >> perm[i];
+ }
+ cout << binary_search(t, p, perm) << '\n';
+ return 0;
+}

Codeforces/EDU/Binary Search/2-G.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+
+using namespace std;
+
+bool ok(const vector <int> &g, int k, long long councils){
+ long long sum = 0;
+ for(int i = 0 ; i < (int) g.size() ; ++i){
+ long long limit = min(1LL * g[i], councils);
+ sum += limit;
+ }
+ return sum / councils >= k;
+}
+
+long long binary_search(const vector <int> &g, int k){
+ long long low = 1, high = 1e11;
+ long long ans = 0;
+ while(low <= high){
+ long long mid = (low + high) / 2;
+ if(ok(g, k, mid)){
+ ans = mid;
+ low = mid + 1;
+ } else{
+ high = mid - 1;
+ }
+ }
+ return ans;
+}
+
+int main(int argc, char const *argv[])
+{
+ int k;
+ cin >> k;
+ int n;
+ cin >> n;
+ vector <int> g(n);
+ for(int i = 0 ; i < n ; ++i){
+ cin >> g[i];
+ }
+ cout << binary_search(g, k) << '\n';
+ return 0;
+}

Codeforces/EDU/Binary Search/2-H.cpp

@@ -0,0 +1,66 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+bool ok(int b, int s, int c, int nb, int ns, int nc, int pb, int ps, int pc, long long r, long long value){
+ // with the ingredients I already have, I can make 'minimum' amount of burgers
+ int minimum = min({b == 0 ? 0 : nb / b, s == 0 ? 0 : ns / s, c == 0 ? 0 : nc / c});
+ nb -= b * minimum;
+ ns -= s * minimum;
+ nc -= c * minimum;
+ if(minimum >= value) return true;
+ value -= minimum;
+ // now I cannot make any more burgers without buying
+ // I have to make the remaining 'value' amount of burgers with 'r' rubles
+ if(nb < value * b){ // need extra bread
+ long long bn = value * b - nb; // this amount of extra bread is needed
+ if(r < bn * pb) return false;
+ r -= bn * pb;
+ }
+ if(ns < value * s){ // need extra sausage
+ long long sn = value * s - ns;
+ if(r < sn * ps) return false;
+ r -= sn * ps;
+ }
+ if(nc < value * c){ // need extra cheese
+ long long cn = value * c - nc;
+ if(r < cn * pc) return false;
+ }
+ return true;
+}
+
+long long binary_search(int b, int s, int c, int nb, int ns, int nc, int pb, int ps, int pc, long long r){
+ long long low = 0, high = 1e13;
+ long long ans = -1;
+ while(low <= high){
+ long long mid = (low + high) / 2;
+ if(ok(b, s, c, nb, ns, nc, pb, ps, pc, r, mid)){
+ ans = mid;
+ low = mid + 1;
+ } else{
+ high = mid - 1;
+ }
+ }
+ return ans;
+}
+
+int main(int argc, char const *argv[])
+{
+ string recipe;
+ cin >> recipe;
+ int b = 0, s = 0, c = 0;
+ for(int i = 0 ; i < recipe.length() ; ++i){
+ if(recipe[i] == 'B') ++b;
+ else if(recipe[i] == 'S') ++s;
+ else ++c;
+ }
+ int nb, ns, nc;
+ cin >> nb >> ns >> nc;
+ int pb, ps, pc;
+ cin >> pb >> ps >> pc;
+ long long r;
+ cin >> r;
+ cout << binary_search(b, s, c, nb, ns, nc, pb, ps, pc, r) << '\n';
+ return 0;
+}