This documentation is automatically generated by online-judge-tools/verification-helper
View the Project on GitHub ngthanhtrung23/ACM_Notebook_new
#include "../template.h" #include "minmove.h" int main() { cout << minmove("mississippi") << endl; // 10 cout << minmove("cdefab") << endl; // 4 cout << minmove("zzzzzz") << endl; // 0 }
#line 1 "template.h" #include <bits/stdc++.h> using namespace std; #define FOR(i,a,b) for(int i=(a),_b=(b); i<=_b; i++) #define FORD(i,a,b) for(int i=(a),_b=(b); i>=_b; i--) #define REP(i,a) for(int i=0,_a=(a); i<_a; i++) #define EACH(it,a) for(__typeof(a.begin()) it = a.begin(); it != a.end(); ++it) #define DEBUG(x) { cout << #x << " = "; cout << (x) << endl; } #define PR(a,n) { cout << #a << " = "; FOR(_,1,n) cout << a[_] << ' '; cout << endl; } #define PR0(a,n) { cout << #a << " = "; REP(_,n) cout << a[_] << ' '; cout << endl; } #define sqr(x) ((x) * (x)) // For printing pair, container, etc. // Copied from https://quangloc99.github.io/2021/07/30/my-CP-debugging-template.html template<class U, class V> ostream& operator << (ostream& out, const pair<U, V>& p) { return out << '(' << p.first << ", " << p.second << ')'; } template<class Con, class = decltype(begin(declval<Con>()))> typename enable_if<!is_same<Con, string>::value, ostream&>::type operator << (ostream& out, const Con& con) { out << '{'; for (auto beg = con.begin(), it = beg; it != con.end(); it++) { out << (it == beg ? "" : ", ") << *it; } return out << '}'; } template<size_t i, class T> ostream& print_tuple_utils(ostream& out, const T& tup) { if constexpr(i == tuple_size<T>::value) return out << ")"; else return print_tuple_utils<i + 1, T>(out << (i ? ", " : "(") << get<i>(tup), tup); } template<class ...U> ostream& operator << (ostream& out, const tuple<U...>& t) { return print_tuple_utils<0, tuple<U...>>(out, t); } mt19937_64 rng(chrono::steady_clock::now().time_since_epoch().count()); long long get_rand(long long r) { return uniform_int_distribution<long long> (0, r-1)(rng); } template<typename T> vector<T> read_vector(int n) { vector<T> res(n); for (int& x : res) cin >> x; return res; } void solve(); int main() { ios::sync_with_stdio(0); cin.tie(0); solve(); return 0; } #line 1 "String/minmove.h" // Tính vị trí của xâu xoay vòng có thứ tự từ điển nhỏ nhất của xâu s[] // Tested: // - https://cses.fi/problemset/task/1110/ int minmove(string s) { int n = s.length(); int x, y, i, j, u, v; // x is the smallest string before string y for (x = 0, y = 1; y < n; ++ y) { i = u = x; j = v = y; while (s[i] == s[j]) { ++ u; ++ v; if (++ i == n) i = 0; if (++ j == n) j = 0; if (i == x) break; // All strings are equal } if (s[i] <= s[j]) y = v; else { x = y; if (u > y) y = u; } } return x; } #line 3 "String/minmove.cpp" int main() { cout << minmove("mississippi") << endl; // 10 cout << minmove("cdefab") << endl; // 4 cout << minmove("zzzzzz") << endl; // 0 }