CF Update

Author: Tanjim131

Codeforces/1200/187-2-B.cpp

@@ -0,0 +1,51 @@
+#include <iostream>
+#include <vector>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+ int n, m;
+ cin >> n >> m;
+ vector <int> a(n + 1);
+ for(int i = 1 ; i <= n ; ++i) cin >> a[i];
+ int increment = 0;
+ for(int i = 1 ; i <= m ; ++i){
+ int t; cin >> t;
+ if(t == 1){
+ int v, x;
+ cin >> v >> x;
+ a[v] = x - increment;
+ } else if(t == 2){
+ int y;
+ cin >> y;
+ increment += y;
+ } else{
+ int q;
+ cin >> q;
+ cout << a[q] + increment << '\n';
+ }
+ }
+ // vector <int> last_updated(n + 1, 0);
+ // vector <int> increments(m + 1, 0); 
+ // for(int i = 1 ; i <= m ; ++i){
+ // increments[i] += increments[i - 1];
+ // int t;
+ // cin >> t;
+ // if(t == 1){
+ // int v, x;
+ // cin >> v >> x;
+ // a[v] = x;
+ // last_updated[v] = i;
+ // } else if(t == 2){
+ // int y;
+ // cin >> y;
+ // increments[i] += y;
+ // } else{
+ // int q;
+ // cin >> q;
+ // cout << a[q] + increments[i] - increments[last_updated[q]] << '\n';
+ // }
+ // }
+ return 0;
+}

Codeforces/1300/263-2-B.cpp

@@ -0,0 +1,32 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <functional>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+ int n, k;
+ cin >> n >> k;
+ string input;
+ cin >> input;
+ vector <int> cards(26);
+ for(int i = 0 ; i < input.length() ; ++i){
+ int _id = input[i] - 'A';
+ ++cards[_id];
+ }
+ sort(cards.begin(), cards.end(), greater<int>());
+ 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
+ answer += 1LL * can * can;
+ } else{ // I can take more than what cards[i] has
+ answer += can;
+ }
+ k -= can;
+ }
+ cout << answer << '\n';
+ return 0;
+}

Codeforces/1300/E4-2-A.cpp

@@ -0,0 +1,52 @@
+#include <iostream>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+ int n, p, q;
+ cin >> n >> p >> q;
+ string s;
+ cin >> s;
+ // find non-negative solutions to px + qy = n
+ // Complexity: O(n^2)
+ int x = -1, y = -1;
+ // for(int i = 0 ; i <= n ; ++i){
+ // for(int j = 0 ; j <= n ; ++j){
+ // if(p * i + q * j == n){
+ // x = i;
+ // y = j;
+ // break;
+ // }
+ // }
+ // }
+ // Complexity: O(n)
+ for(int i = 0 ; i <= n / p ; ++i){ // iterate all possible values for x
+ // check if (n - p * i) % q == 0 
+ if((n - p * i) % q == 0){
+ x = i;
+ y = (n - p * i) / q;
+ break;
+ }
+ }
+ if(x == -1 && y == -1){
+ cout << "-1\n";
+ } else{
+ //cout << "x = " << x << " y = " << y << '\n';
+ cout << x + y << '\n';
+ int index = 0;
+ while(x--){
+ for(int i = 0 ; i < p ; ++i){
+ cout << s[index++];
+ }
+ cout << '\n';
+ }
+ while(y--){
+ for(int i = 0 ; i < q ; ++i){
+ cout << s[index++];
+ }
+ cout << '\n';
+ }
+ }
+ return 0;
+}

Codeforces/1400/187-2-A.cpp

@@ -0,0 +1,42 @@
+#include <iostream>
+#include <vector>
+#include <map>
+
+using namespace std;
+
+struct Bottle{
+ int self, other;
+};
+
+int main(int argc, char const *argv[])
+{
+ // O(nlogn) solution
+ int n;
+ cin >> n;
+ vector <Bottle> bottles(n);
+ vector <int> count(1000 + 1, 0);
+ map <pair<int,int>, int> duplicate;
+ for(int i = 0 ; i < n ; ++i){
+ cin >> bottles[i].self >> bottles[i].other;
+ ++count[bottles[i].self];
+ if(bottles[i].self == bottles[i].other){
+ ++duplicate[{bottles[i].self, bottles[i].other}];
+ } 
+ }
+ for(int i = 0 ; i < n ; ++i){
+ if(count[bottles[i].other] == 0) continue;
+ if(bottles[i].self != bottles[i].other){
+ count[bottles[i].other] = 0; // if a_i != b_i, then a_i can open every bottle of brand b_i
+ } else if(duplicate[{bottles[i].self, bottles[i].other}] > 1){
+ count[bottles[i].other] = 0; // a_i == b_i, this can only be opened if there exists some other pair (a_i', b_i') such that (a_i' == a_i) && (b_i' == b_i) [a_i' != a_i has been handled above]
+ } else{ 
+ count[bottles[i].other] = 1; // otherwise it can open every bottle of b_i except itself
+ }
+ }
+ int unopened = 0;
+ for(int i = 1 ; i < count.size() ; ++i){
+ unopened += count[i];
+ }
+ cout << unopened << '\n';
+ return 0;
+}

Codeforces/665-2-B.cpp

@@ -0,0 +1,26 @@
+#include <iostream>
+#include <algorithm>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+ int t;
+ cin >> t;
+ while(t--){
+ int x1, y1, z1, x2, y2, z2;
+ cin >> x1 >> y1 >> z1 >> x2 >> y2 >> z2;
+ int sum = 0;
+ int q = min(z1, y2);
+ sum += q * 2;
+ z1 -= q;
+ y2 -= q;
+ z2 -= min(z1, z2);
+ z2 -= min(x1, z2);
+ y1 -= min(y1, x2);
+ y1 -= min(y1, y2);
+ sum -= z2 * 2;
+ cout << sum << '\n';
+ } 
+ return 0;
+}

Codeforces/665-2-C.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <vector>
+#include <algorithm>
+#include <limits>
+
+using namespace std;
+
+int main(int argc, char const *argv[])
+{
+ int t;
+ cin >> t;
+ while(t--){
+ int n;
+ cin >> n;
+ vector <int> a(n), sorted(n);
+ int minimum = numeric_limits<int>::max();
+ for(int i = 0 ; i < n ; ++i){
+ cin >> a[i];
+ sorted[i] = a[i];
+ minimum = min(minimum, a[i]);
+ }
+ sort(sorted.begin(), sorted.end());
+ bool possible = true;
+ for(int i = 0 ; i < n ; ++i){
+ if(sorted[i] == a[i]) continue;
+ int g = __gcd(minimum, a[i]);
+ if(g != minimum){
+ possible = false;
+ break;
+ }
+ }
+ cout << (possible ? "YES" : "NO") << '\n';
+ }
+ return 0;
+}