updated

Author: mr-sohel

CPP.sublime-build

@@ -3,7 +3,7 @@
     [
         "bash",
         "-c",
-        "g++ -std=gnu++17 -DLOCAL -Wall -fsanitize=undefined -D_GLIBCXX_DEBUG '${file}' -o '${file_path}/${file_base_name}' && timeout 10s '${file_path}/${file_base_name}'<in.txt>out.txt"
+        "g++ -std=gnu++17 -O2 -DLOCAL -Wall '${file}' -o '${file_path}/${file_base_name}' && timeout 3s '${file_path}/${file_base_name}'<in.txt>out.txt"
     ],
     "selector": "source.c, source.c++"
 }

code.cpp

@@ -29,14 +29,31 @@ int tc = 1;
 #endif
 
 void solve() {
-
+    string s;
+    cin >> s;
+    set<char> st;
+    for (auto &it : s) {
+        st.insert(it);
+    }
+    if (sz(st) == 1) {
+        cout << "NO\n";
+    } else {
+        for (int i = 0; i < sz(s) - 1; i++) {
+            if (s[i] != s[i + 1]) {
+                swap(s[i], s[i + 1]);
+                break;
+            }
+        }
+        cout << "YES\n";
+        cout << s << '\n';
+    }
 }
 
 int main() {
     unsyncIO;
 
     int t = 1;
-    //cin >> t;
+    cin >> t;
     while (t--) {
         solve();
     }

code.cpp:tests

@@ -0,0 +1,9 @@
+[
+	{
+		"correct_answers":
+		[
+			"YES\nforcodesec\nNO\nYES\nxxyxx\nYES\noc\nNO\nYES\nundertale\nYES\nthtsiwm\nNO"
+		],
+		"test": "8\ncodeforces\naaaaa\nxxxxy\nco\nd\nnutdealer\nmwistht\nhhhhhhhhhh\n"
+	}
+]

debug.h

@@ -18,8 +18,8 @@
  * https://g...content-available-to-author-only...b.com/SansPapyrus683/61b65d4d7ec223b48ebf5c3bb382ba8d
  */
 
-#include <bits/stdc++.h>
-using namespace std;
+// #include <bits/stdc++.h>
+// using namespace std;
 
 template <typename T1, typename T2>
 ostream& operator<<(ostream& out, const pair<T1, T2>& p) {

precompiled header.cpp

@@ -0,0 +1 @@
+//sudo g++ -std=gnu++17 -O2 -Wall -DLOCAL /usr/include/x86_64-linux-gnu/c++/12/bits/stdc++.h

sol.cpp

@@ -1,68 +1,44 @@
-#include <iostream>
-#include <vector>
+#include <bits/stdc++.h>
 
-using namespace std;
-
-void topologicalSortUtil(vector<vector<int>>& graph, vector<int>& indegree, vector<int>& path, vector<bool>& visited) {
-   bool flag = false;
-
-   for (int i = 0; i < graph.size(); ++i) {
-      if (indegree[i] == 0 && !visited[i]) {
-         for (int j = 0; j < graph[i].size(); ++j) {
-            indegree[graph[i][j]]--;
-         }
-         path.push_back(i);
-         visited[i] = true;
-         topologicalSortUtil(graph, indegree, path, visited);
+#define sqr(x)        (x) * (x)
+#define sz(x)         (int)x.size()
+#define all(x)        (x).begin(),(x).end()
+#define rall(x)       (x).rbegin(),(x).rend()
+#define prec(x)       fixed<<setprecision(x)
+#define testcase      cout << "Case " << tc++ << ": "
+#define unsyncIO      ios_base::sync_with_stdio(false); cin.tie(nullptr)
 
-         visited[i] = false;
-         path.pop_back();
-         for (int j = 0; j < graph[i].size(); ++j) {
-            indegree[graph[i][j]]++;
-         }
+using namespace std;
 
-         flag = true;
-      }
-   }
+using ll = long long;
+using ld = long double;
+using ull = unsigned long long;
+template <typename T>
+using minHeap = priority_queue<T, vector<T>, greater<T>>;
 
-   if (!flag) {
-      for (int i = 0; i < path.size(); ++i) {
-         cout << path[i] << " ";
-      }
-      cout << endl;
-   }
-}
+const ld PI = acos(-1.0);
+const ll MOD = 1e9 + 7;
+const ld EPS = 1e-9;
+const ll N = 2e5 + 5;
+int tc = 1;
 
-void allTopologicalSorts(vector<vector<int>>& graph, int V) {
-   vector<int> indegree(V, 0);
-   vector<bool> visited(V, false);
-   vector<int> path;
+#ifdef LOCAL
+#include "debug.h"
+#else
+#define debug(...)
+#endif
 
-   for (int i = 0; i < V; ++i) {
-      for (int j = 0; j < graph[i].size(); ++j) {
-         indegree[graph[i][j]]++;
-      }
-   }
+void solve() {
 
-   topologicalSortUtil(graph, indegree, path, visited);
 }
 
 int main() {
-   int V, E;
-   // cout << "Enter the number of vertices and edges: ";
-   cin >> V >> E;
-
-   vector<vector<int>> graph(V);
+   unsyncIO;
 
-   // cout << "Enter the edges (format: from to):" << endl;
-   for (int i = 0; i < E; ++i) {
-      int from, to;
-      cin >> from >> to;
-      graph[from].push_back(to);
+   int t = 1;
+   //cin >> t;
+   while (t--) {
+      solve();
    }
-
-   // cout << "All possible topological sorts are:" << endl;
-   allTopologicalSorts(graph, V);
-
    return 0;
-}
+}