Solve problems 449B and 551B from codeforces and 40. Erase Value and 40. Move the Bishop from csacademy

Author: AliOsm

CS Academy/40. Erase Value.cpp

@@ -0,0 +1,24 @@
+#include <stdio.h>
+#include <algorithm>
+
+using namespace std;
+
+int n, freq[1001];
+
+int main() {
+    scanf("%d", &n);
+    int total = 0;
+    for(int i = 0, tmp; i < n; ++i) {
+        scanf("%d", &tmp);
+        total += tmp;
+        ++freq[tmp];
+    }
+    
+    int res = 1e7;
+    for(int i = 0; i < 1001; ++i)
+        res = min(res, total - (freq[i] * i));
+    
+    printf("%d\n", res);
+    
+    return 0;
+}

CS Academy/40. Move the Bishop.cpp

@@ -0,0 +1,43 @@
+#include <iostream>
+
+using namespace std;
+
+int main() {
+    int x1, y1, x2, y2;
+    scanf("%d %d %d %d", &x1, &y1, &x2, &y2);
+    
+    if(x1 == x2 && y1 == y2) {
+        puts("0");
+        return 0;
+    }
+    
+    if(abs(x1 - x2) == abs(y1 - y2)) {
+        puts("1");
+        return 0;
+    }
+    
+    for(int i = x1 + 1, j = y1 + 1; i <= 8 && j <= 8; ++i, ++j)
+        if(abs(i - x2) == abs(j - y2)) {
+            puts("2");
+            return 0;
+        }
+    for(int i = x1 + 1, j = y1 - 1; i <= 8 && j >= 0; ++i, --j)
+        if(abs(i - x2) == abs(j - y2)) {
+            puts("2");
+            return 0;
+        }
+    for(int i = x1 - 1, j = y1 + 1; i >= 0 && j <= 8; --i, ++j)
+        if(abs(i - x2) == abs(j - y2)) {
+            puts("2");
+            return 0;
+        }
+    for(int i = x1 - 1, j = y1 - 1; i >= 0 && j >= 0; --i, --j)
+        if(abs(i - x2) == abs(j - y2)) {
+            puts("2");
+            return 0;
+        }
+    
+    puts("-1");
+    
+    return 0;
+}

CS Academy/README.md

@@ -5,3 +5,5 @@
 - [26. Limited Vocabulary](https://csacademy.com/contest/round-26/#task/limited-vocabulary)
 - [26. Odd Pair Sums](https://csacademy.com/contest/round-26/#task/odd-pair-sums)
 - [27. Backpack Packing](https://csacademy.com/contest/round-27/#task/backpack-packing)
+- [40. Erase Value](https://csacademy.com/contest/round-40/task/erase-value)
+- [40. Move the Bishop](https://csacademy.com/contest/round-40/task/move-the-bishop)

CodeForces/449B. Jzzhu and Cities.cpp

@@ -0,0 +1,69 @@
+#include <stdio.h>
+#include <vector>
+#include <queue>
+#include <algorithm>
+
+using namespace std;
+
+int const N = 1e5 + 1;
+int n, m, k, res;
+long long cost[N];
+bool vis[N];
+vector<vector<pair<int, int> > > g;
+priority_queue<pair<pair<long long, int>, bool> > q;
+
+void Dijkstra(int src) {
+	fill(cost, cost + N, 1e18);
+	q.push(make_pair(make_pair(0, src), false));
+	cost[src] = 0;
+
+	while(!q.empty()) {
+		int v = q.top().first.second;
+		long long c = -q.top().first.first;
+		bool train = q.top().second;
+		q.pop();
+
+		if(cost[v] <= c && train) {
+			++res;
+			continue;
+		} else if(cost[v] > c && train)
+			cost[v] = c;
+
+		if(vis[v])
+			continue;
+		vis[v] = true;
+
+		for(int i = 0, u; i < (int)g[v].size(); ++i) {
+			u = g[v][i].first;
+			if(1LL * c + g[v][i].second < cost[u]) {
+				cost[u] = 1LL * c + g[v][i].second;
+				q.push(make_pair(make_pair(-cost[u], u), false));
+			}
+		}
+	}
+}
+
+int main() {
+	scanf("%d %d %d", &n, &m, &k);
+	g.resize(n);
+
+	for(int i = 0, a, b, c; i < m; ++i) {
+		scanf("%d %d %d", &a, &b, &c);
+		--a, --b;
+		g[a].push_back(make_pair(b, c));
+		g[b].push_back(make_pair(a, c));
+	}
+
+	for(int i = 0, a, c; i < k; ++i) {
+		scanf("%d %d", &a, &c);
+		--a;
+		q.push(make_pair(make_pair(-c, a), true));
+	}
+
+	Dijkstra(0);
+
+	printf("%d\n", res);
+
+	return 0;
+}
+

CodeForces/551B. ZgukistringZ.cpp

@@ -0,0 +1,58 @@
+#include <iostream>
+#include <string>
+#include <algorithm>
+#include <memory.h>
+
+using namespace std;
+
+int main() {
+	string a, b, c;
+	cin >> a >> b >> c;
+
+	int fa[26] = {0}, fb[26] = {0}, fc[26] = {0};
+
+	for(int i = 0; i < (int)a.length(); ++i)
+		++fa[a[i] - 'a'];
+	for(int i = 0; i < (int)b.length(); ++i)
+		++fb[b[i] - 'a'];
+	for(int i = 0; i < (int)c.length(); ++i)
+		++fc[c[i] - 'a'];
+
+	int cb = 0, cc = 0;
+
+	for(int i = 0; i < 1e5 + 1; ++i) {
+		int tb = 1e9, tc = 1e9;
+
+		bool ok = true;
+		for(int j = 0; j < 26; ++j)
+			if(fb[j] != 0 && fa[j] < 1LL * fb[j] * i) {
+				ok = false;
+				break;
+			}
+
+		if(!ok)
+			tb = 0;
+		else
+			tb = i;
+
+		for(int j = 0; j < 26; ++j)
+			if(fc[j] != 0)
+				tc = min(1LL * tc, max(0LL, (fa[j] - (1LL * fb[j] * tb)) / fc[j]));
+
+		if(tb + tc > cb + cc)
+			cb = tb, cc = tc;
+	}
+
+	for(int i = 0; i < cb; ++i) cout << b;
+	for(int i = 0; i < cc; ++i) cout << c;
+
+	for(int i = 0; i < 26; ++i) {
+		fa[i] -= (fb[i] * cb) + (fc[i] * cc);
+		for(int j = 0; j < fa[i]; ++j)
+			cout << char(i + 'a');
+	}
+	cout << endl;
+
+	return 0;
+}
+

CodeForces/README.md

@@ -94,6 +94,7 @@
 - [441C. Valera and Tubes](http://codeforces.com/contest/441/problem/C)
 - [443A. Anton and Letters](http://codeforces.com/problemset/problem/443/A)
 - [448A. Rewards](http://codeforces.com/problemset/problem/448/A)
+- [449B. Jzzhu and Cities](http://codeforces.com/contest/449/problem/B)
 - [451A. Game With Sticks](http://codeforces.com/contest/451/problem/A)
 - [452A. Eevee](http://codeforces.com/problemset/problem/452/A)
 - [454A. Little Pony and Crystal Mine](http://codeforces.com/problemset/problem/454/A)
@@ -126,6 +127,7 @@
 - [546C - Soldier and Cards](http://codeforces.com/problemset/problem/546/C)
 - [546A. Soldier and Bananas](http://codeforces.com/contest/546/problem/A)
 - [550C. Divisibility by Eight](http://codeforces.com/problemset/problem/550/C)
+- [551B. ZgukistringZ](http://codeforces.com/contest/551/problem/B)
 - [552C. Vanya and Scales](http://codeforces.com/contest/552/problem/C)
 - [573A. Bear and Poker](http://codeforces.com/contest/573/problem/A)
 - [577B. Modulo Sum](http://codeforces.com/contest/577/problem/B)