Problem A, B, C - CR 684, 685

Author: azecoder

Codeforces/1451A.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+
+#define range(a,b,c) for(int a=b; a<c; a++)
+#define MX 1e4+5
+
+using namespace std;
+
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+typedef vector<pii> vii;
+typedef vector<vi> vvi;
+
+
+
+
+void solve() {
+	//
+	int n;
+	cin >> n;
+
+	if(n == 1)
+		cout << "0\n";
+	else if(n == 2)
+		cout << "1\n";
+	else if(n == 3)
+		cout << "2\n";
+	else
+		cout << 2 + n%2 << "\n";
+}
+
+
+int main() {
+	//
+	ios_base::sync_with_stdio(false);
+	int T;	
+	cin >> T;
+	while(T--)
+		solve();
+
+	return 0;
+}

Codeforces/1451B.cpp

@@ -0,0 +1,62 @@
+#include <bits/stdc++.h>
+
+#define range(a,b,c) for(int a=b; a<c; a++)
+#define MX 1e4+5
+
+using namespace std;
+
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+typedef vector<pii> vii;
+typedef vector<vi> vvi;
+
+
+
+
+void solve() {
+	//
+	int n, q;
+	cin >> n >> q;
+
+	string s;
+	cin >> s;
+	
+	range(i, 0, q) {
+		int l, r;
+		cin >> l >> r;
+		l--;
+		r--;
+		
+		bool flag = false;
+		char last = s[r];
+		for(int j = r+1; j < n; j++)
+			if(s[j] == last) {
+				cout << "YES\n";
+				flag = true;
+				break;
+			}
+		if(!flag) {
+			char first = s[l];
+			for(int j = l-1; j >= 0; j--)
+				if(s[j] == first) {
+					cout << "YES\n";
+					flag = true;
+					break;
+				}
+		}
+		if(!flag)
+			cout << "NO\n";
+	}
+}
+
+
+int main() {
+	//
+	ios_base::sync_with_stdio(false);
+	int T;	
+	cin >> T;
+	while(T--)
+		solve();
+
+	return 0;
+}

Codeforces/1451C.cpp

@@ -0,0 +1,103 @@
+#include <bits/stdc++.h>
+
+#define range(a,b,c) for(int a=b; a<c; a++)
+#define MX 1e4+5
+
+using namespace std;
+
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+typedef vector<pii> vii;
+typedef vector<vi> vvi;
+
+
+
+
+void solve() {
+	//
+	int n, k;
+	cin >> n >> k;
+
+	string a;
+	cin >> a;
+	
+	vi ac(26, 0);
+	for(char ch: a) {
+		int i = int(ch - 'a');
+		ac[i]++;
+	}
+	
+	string b;
+	cin >> b;
+	
+	vi bc(26, 0);
+	for(char ch: b) {
+		int i = int(ch - 'a');
+		bc[i]++;
+	}
+	
+	vi have(n, 0);
+	range(i, 0, n) {
+		int id = int(b[i] - 'a');
+		if(ac[id]) {
+			ac[id]--;
+			have[i] = 1;
+		}
+	}
+	
+	range(i, 0, n) {
+		if(have[i])
+			continue;
+		
+		char ch = b[i];
+		//cout << "ch: " << i << " " << ch << " \n"; 
+		int id = int(b[i] - 'a');
+		range(j, i+1, i+k) {
+			if(ch != b[j]) {
+				//cout << "bj " << j << " " << b[j] << "\n";
+				cout << "No\n";
+				return;
+			}
+		}
+		
+		range(j, 0, id+1) {
+			if(ac[j] >= k) {
+				cout << "salam: " << a[j] << "\n";
+				ac[j] -= max(0,k);
+				range(ii, i, i+k)
+					have[ii] = 1;
+			}
+		}
+		
+		cout << "HV: ";
+		for(int x: have)
+			cout << x << " ";
+		cout << "\n";
+	}
+	
+	cout << "AC: ";
+	for(int x: ac)
+		cout << x << " ";
+	cout << "\n";
+	
+	cout << "HV: ";
+	for(int x: have)
+		cout << x << " ";
+	cout << "\n";
+	
+	cout << "Yes\n";
+	return;
+	
+}
+
+
+int main() {
+	//
+	ios_base::sync_with_stdio(false);
+	int T;	
+	cin >> T;
+	while(T--)
+		solve();
+
+	return 0;
+}

Codeforces/1452B.cpp

@@ -0,0 +1,48 @@
+#include <bits/stdc++.h>
+
+#define MX 1e4+5
+
+using namespace std;
+
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+typedef vector<pii> vii;
+typedef vector<vi> vvi;
+
+
+
+
+void solve() {
+	//
+	int n;
+	cin >> n;
+	
+	vi a(n);
+	int sum = 0;
+	int mx = INT_MIN;
+	for(int i = 0; i < n; i++) {
+		cin >> a[i];
+		sum += a[i];
+		mx = max(mx, a[i]);
+	}
+		
+	sum -= mx;
+	int x = sum / mx;
+	x++;
+	//cout << "x: " << x << " " << mx << " " << sum << "\n";
+	
+	cout << (x * mx - sum) % (n-1) << "\n";
+	
+}
+
+
+int main() {
+	//
+	ios_base::sync_with_stdio(false);
+	int T;	
+	cin >> T;
+	while(T--)
+		solve();
+
+	return 0;
+}

Codeforces/1454A.cpp

@@ -0,0 +1,41 @@
+#include <bits/stdc++.h>
+
+#define range(a,b,c) for(int a=b; a<c; a++)
+#define MX 1e4+5
+
+using namespace std;
+
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+typedef vector<pii> vii;
+typedef vector<vi> vvi;
+
+
+
+
+void solve() {
+	//
+	int n;
+	cin >> n;
+
+	if(n == 1)
+		cout << "0\n";
+	else if(n == 2)
+		cout << "1\n";
+	else if(n == 3)
+		cout << "2\n";
+	else
+		cout << 2 + n%2 << "\n";
+}
+
+
+int main() {
+	//
+	ios_base::sync_with_stdio(false);
+	int T;	
+	cin >> T;
+	while(T--)
+		solve();
+
+	return 0;
+}

Codeforces/1454B.cpp

@@ -0,0 +1,62 @@
+#include <bits/stdc++.h>
+
+#define range(a,b,c) for(int a=b; a<c; a++)
+#define MX 1e4+5
+
+using namespace std;
+
+typedef pair<int, int> pii;
+typedef vector<int> vi;
+typedef vector<pii> vii;
+typedef vector<vi> vvi;
+
+
+
+
+void solve() {
+	//
+	int n, q;
+	cin >> n >> q;
+
+	string s;
+	cin >> s;
+	
+	range(i, 0, q) {
+		int l, r;
+		cin >> l >> r;
+		l--;
+		r--;
+		
+		bool flag = false;
+		char last = s[r];
+		for(int j = r+1; j < n; j++)
+			if(s[j] == last) {
+				cout << "YES\n";
+				flag = true;
+				break;
+			}
+		if(!flag) {
+			char first = s[l];
+			for(int j = l-1; j >= 0; j--)
+				if(s[j] == first) {
+					cout << "YES\n";
+					flag = true;
+					break;
+				}
+		}
+		if(!flag)
+			cout << "NO\n";
+	}
+}
+
+
+int main() {
+	//
+	ios_base::sync_with_stdio(false);
+	int T;	
+	cin >> T;
+	while(T--)
+		solve();
+
+	return 0;
+}