aboutsummaryrefslogtreecommitdiff
path: root/contests/Round853/B
diff options
context:
space:
mode:
Diffstat (limited to 'contests/Round853/B')
-rw-r--r--contests/Round853/B/\105
-rwxr-xr-xcontests/Round853/B/mainbin0 -> 50488 bytes
-rwxr-xr-xcontests/Round853/B/main.cpp107
-rw-r--r--contests/Round853/B/main_input0.txt7
-rw-r--r--contests/Round853/B/main_input1.txt3
-rw-r--r--contests/Round853/B/main_input2.txt3
-rw-r--r--contests/Round853/B/main_input3.txt3
-rw-r--r--contests/Round853/B/main_input4.txt3
-rw-r--r--contests/Round853/B/main_input5.txt3
-rw-r--r--contests/Round853/B/main_input6.txt3
-rw-r--r--contests/Round853/B/main_input7.txt3
-rw-r--r--contests/Round853/B/main_output0.txt3
-rw-r--r--contests/Round853/B/main_output1.txt1
-rw-r--r--contests/Round853/B/main_output2.txt1
-rw-r--r--contests/Round853/B/main_output3.txt1
-rw-r--r--contests/Round853/B/main_output4.txt1
-rw-r--r--contests/Round853/B/main_output5.txt1
-rw-r--r--contests/Round853/B/main_output6.txt1
-rw-r--r--contests/Round853/B/main_output7.txt1
19 files changed, 250 insertions, 0 deletions
diff --git a/contests/Round853/B/\ b/contests/Round853/B/\
new file mode 100644
index 0000000..499f739
--- /dev/null
+++ b/contests/Round853/B/\
@@ -0,0 +1,105 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+// pretty printing
+template <typename K, typename V> void printm(const map<K, V> &mp) {
+ cerr << "{" << endl;
+ for (auto p : mp) {
+ cerr << " { " << p.first << " : " << p.second << " }\n";
+ }
+ cerr << "}" << endl;
+}
+template <typename T> void printv(const vector<T> &v) {
+ cerr << "[";
+ for (int i = 0; i < v.size(); i++) {
+ if (i == v.size() - 1) {
+ cerr << v[i];
+ } else {
+ cerr << v[i] << ", ";
+ }
+ }
+ cerr << "]\n";
+}
+
+template <typename T> void printvv(const vector<vector<T>> &v) {
+ cerr << "[\n";
+ for (auto &vec : v) {
+ cout << " ";
+ printv(vec);
+ }
+ cerr << "]\n";
+}
+void print() { cerr << "\n"; }
+
+template <typename T, typename... TS> void print(T val, TS... vals) {
+ cerr << val << " ";
+ print(vals...);
+}
+
+/* stuff you should look for:
+ ---------------------------
+ * special cases (n=1?)
+ * int overflow, array bounds
+ * do smth instead of nothing and stay organized
+ * WRITE STUFF DOWN
+ * DON'T GET STUCK ON ONE APPROACH
+ */
+
+bool isPalindrome(string &s) { return string(all(s)) == string(rall(s)); }
+
+void solve() {
+ int n;
+ cin >> n;
+ string s;
+ cin >> s;
+ if (isPalindrome(s)) {
+ cout << "Yes" << '\n';
+ } else {
+ vector<bool> pal(n);
+ if (n & 1)
+ pal[n / 2] = 1;
+ for (int i = 0; i < n / 2; i++) {
+ pal[i] = pal[n - i - 1] = s[i] == s[n - i - 1];
+ }
+ pal.erase(unique(all(pal)));
+ // string haystack = "";
+ // for (int i = 0; i < n / 2; i++) {
+ // haystack += (pal[i] ? "R" : "W");
+ // }
+ // if (regex_match(haystack, regex("WR+W"))) {
+ // cout << "No" << '\n';
+ // } else {
+ // cout << "Yes" << '\n';
+ // }
+ }
+}
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int tt;
+ cin >> tt;
+ while (tt--) {
+ solve();
+ }
+}
diff --git a/contests/Round853/B/main b/contests/Round853/B/main
new file mode 100755
index 0000000..71f1358
--- /dev/null
+++ b/contests/Round853/B/main
Binary files differ
diff --git a/contests/Round853/B/main.cpp b/contests/Round853/B/main.cpp
new file mode 100755
index 0000000..12517e2
--- /dev/null
+++ b/contests/Round853/B/main.cpp
@@ -0,0 +1,107 @@
+#include <bits/stdc++.h>
+using namespace std;
+
+using ll = long long;
+using pi = pair<int, int>;
+using vpi = vector<pi>;
+using vi = vector<int>;
+using vll = vector<long long>;
+using mpii = map<int, int>;
+using mpll = map<ll, ll>;
+using db = long double;
+
+#define pb push_back
+#define all(x) (x).begin(), (x).end()
+#define rall(x) (x).rbegin(), (x).rend()
+#define lb lower_bound
+#define ub upper_bound
+
+const int MOD = (int)1e9 + 7;
+const db PI = acos((db)-1);
+const int dx[4]{1, 0, -1, 0};
+const int dy[4]{0, 1, 0, -1};
+
+// pretty printing
+template <typename K, typename V> void printm(const map<K, V> &mp) {
+ cerr << "{" << endl;
+ for (auto p : mp) {
+ cerr << " { " << p.first << " : " << p.second << " }\n";
+ }
+ cerr << "}" << endl;
+}
+template <typename T> void printv(const vector<T> &v) {
+ cerr << "[";
+ for (int i = 0; i < v.size(); i++) {
+ if (i == v.size() - 1) {
+ cerr << v[i];
+ } else {
+ cerr << v[i] << ", ";
+ }
+ }
+ cerr << "]\n";
+}
+
+template <typename T> void printvv(const vector<vector<T>> &v) {
+ cerr << "[\n";
+ for (auto &vec : v) {
+ cout << " ";
+ printv(vec);
+ }
+ cerr << "]\n";
+}
+void print() { cerr << "\n"; }
+
+template <typename T, typename... TS> void print(T val, TS... vals) {
+ cerr << val << " ";
+ print(vals...);
+}
+
+/* stuff you should look for:
+ ---------------------------
+ * special cases (n=1?)
+ * int overflow, array bounds
+ * do smth instead of nothing and stay organized
+ * WRITE STUFF DOWN
+ * DON'T GET STUCK ON ONE APPROACH
+ */
+
+bool isPalindrome(string &s) { return string(all(s)) == string(rall(s)); }
+
+void solve() {
+ int n;
+ cin >> n;
+ string s;
+ cin >> s;
+ vector<bool> pal(n);
+ if (n & 1)
+ pal[n / 2] = 1;
+ for (int i = 0; i < n / 2; i++) {
+ pal[i] = pal[n - i - 1] = s[i] == s[n - i - 1];
+ }
+ pal.erase(unique(all(pal)), pal.end());
+ n = pal.size();
+ if (count(all(pal), 0) <= 2) {
+ cout << "Yes" << '\n';
+ } else {
+ cout << "No" << '\n';
+ }
+ // string haystack = "";
+ // for (int i = 0; i < n / 2; i++) {
+ // haystack += (pal[i] ? "R" : "W");
+ // }
+ // if (regex_match(haystack, regex("WR+W"))) {
+ // cout << "No" << '\n';
+ // } else {
+ // cout << "Yes" << '\n';
+ // }
+}
+
+int main() {
+ ios_base::sync_with_stdio(false);
+ cin.tie(NULL);
+ int tt;
+ cin >> tt;
+ while (tt--) {
+ solve();
+ }
+}
diff --git a/contests/Round853/B/main_input0.txt b/contests/Round853/B/main_input0.txt
new file mode 100644
index 0000000..27013f6
--- /dev/null
+++ b/contests/Round853/B/main_input0.txt
@@ -0,0 +1,7 @@
+3
+4
+1001
+5
+10010
+7
+0111011
diff --git a/contests/Round853/B/main_input1.txt b/contests/Round853/B/main_input1.txt
new file mode 100644
index 0000000..a3582ad
--- /dev/null
+++ b/contests/Round853/B/main_input1.txt
@@ -0,0 +1,3 @@
+1
+6
+100100 \ No newline at end of file
diff --git a/contests/Round853/B/main_input2.txt b/contests/Round853/B/main_input2.txt
new file mode 100644
index 0000000..33a4575
--- /dev/null
+++ b/contests/Round853/B/main_input2.txt
@@ -0,0 +1,3 @@
+1
+6
+011100 \ No newline at end of file
diff --git a/contests/Round853/B/main_input3.txt b/contests/Round853/B/main_input3.txt
new file mode 100644
index 0000000..8435e27
--- /dev/null
+++ b/contests/Round853/B/main_input3.txt
@@ -0,0 +1,3 @@
+1
+7
+0011011 \ No newline at end of file
diff --git a/contests/Round853/B/main_input4.txt b/contests/Round853/B/main_input4.txt
new file mode 100644
index 0000000..c64122e
--- /dev/null
+++ b/contests/Round853/B/main_input4.txt
@@ -0,0 +1,3 @@
+1
+2
+10 \ No newline at end of file
diff --git a/contests/Round853/B/main_input5.txt b/contests/Round853/B/main_input5.txt
new file mode 100644
index 0000000..82c90df
--- /dev/null
+++ b/contests/Round853/B/main_input5.txt
@@ -0,0 +1,3 @@
+1
+2
+01 \ No newline at end of file
diff --git a/contests/Round853/B/main_input6.txt b/contests/Round853/B/main_input6.txt
new file mode 100644
index 0000000..4efbaa0
--- /dev/null
+++ b/contests/Round853/B/main_input6.txt
@@ -0,0 +1,3 @@
+1
+9
+110000101 \ No newline at end of file
diff --git a/contests/Round853/B/main_input7.txt b/contests/Round853/B/main_input7.txt
new file mode 100644
index 0000000..90e47d5
--- /dev/null
+++ b/contests/Round853/B/main_input7.txt
@@ -0,0 +1,3 @@
+1
+8
+00001000 \ No newline at end of file
diff --git a/contests/Round853/B/main_output0.txt b/contests/Round853/B/main_output0.txt
new file mode 100644
index 0000000..3e42eac
--- /dev/null
+++ b/contests/Round853/B/main_output0.txt
@@ -0,0 +1,3 @@
+Yes
+Yes
+No
diff --git a/contests/Round853/B/main_output1.txt b/contests/Round853/B/main_output1.txt
new file mode 100644
index 0000000..289cc91
--- /dev/null
+++ b/contests/Round853/B/main_output1.txt
@@ -0,0 +1 @@
+No \ No newline at end of file
diff --git a/contests/Round853/B/main_output2.txt b/contests/Round853/B/main_output2.txt
new file mode 100644
index 0000000..3fdfb3d
--- /dev/null
+++ b/contests/Round853/B/main_output2.txt
@@ -0,0 +1 @@
+Yes \ No newline at end of file
diff --git a/contests/Round853/B/main_output3.txt b/contests/Round853/B/main_output3.txt
new file mode 100644
index 0000000..3fdfb3d
--- /dev/null
+++ b/contests/Round853/B/main_output3.txt
@@ -0,0 +1 @@
+Yes \ No newline at end of file
diff --git a/contests/Round853/B/main_output4.txt b/contests/Round853/B/main_output4.txt
new file mode 100644
index 0000000..3fdfb3d
--- /dev/null
+++ b/contests/Round853/B/main_output4.txt
@@ -0,0 +1 @@
+Yes \ No newline at end of file
diff --git a/contests/Round853/B/main_output5.txt b/contests/Round853/B/main_output5.txt
new file mode 100644
index 0000000..3fdfb3d
--- /dev/null
+++ b/contests/Round853/B/main_output5.txt
@@ -0,0 +1 @@
+Yes \ No newline at end of file
diff --git a/contests/Round853/B/main_output6.txt b/contests/Round853/B/main_output6.txt
new file mode 100644
index 0000000..3fdfb3d
--- /dev/null
+++ b/contests/Round853/B/main_output6.txt
@@ -0,0 +1 @@
+Yes \ No newline at end of file
diff --git a/contests/Round853/B/main_output7.txt b/contests/Round853/B/main_output7.txt
new file mode 100644
index 0000000..3fdfb3d
--- /dev/null
+++ b/contests/Round853/B/main_output7.txt
@@ -0,0 +1 @@
+Yes \ No newline at end of file
generated by cgit v1.2.3 (git 2.25.1) at 2025-12-06 12:31:45 +0000