Rotations

#include <bits/stdc++.h>
#include <fstream>
using namespace std;
#define PB push_back
#define N (1<<20)
#define QAQ {cout << "0";return 0; }
typedef long long ll;
const ll inf = 1000000007;
int t[N][20], z;

int f(int a, int b){
  int V = 0;
  //cout << "\n" << a << " " << b<< ": \n";
  for(int k=z; k>=0; --k){
  //  cout << t[a][k] << " " << t[b][k] << ", ";
    if(t[a][k] != t[b][k]) continue;
    V += (1<<k);
    a += (1<<k), b+= (1<<k);
  }
  return V;
}

int main(){
  ios::sync_with_stdio(0); cin.tie(0);
  string s; cin >> s;
	int n = s.size();
	s = s + s + s;
	z = 1;
	while(z < n) z*=2; 
	for(int i=0; i<3*n; ++i) t[i][0] = s[i];
	
	for(int b=0; b<=z; ++b){
	  vector<pair<ll,ll>> v;
	  for(int i=0; i<n; ++i){
	    v.PB({t[i][b] * inf + t[i+(1<<b)][b], i});
	  }
	  sort(v.begin(), v.end());
	  ll c=0, prev=0;
	  for(pair<ll, ll> p : v){
	    if(prev != p.first) prev = p.first, ++c;
	//    cout << s.substr(p.second, (1<<(b+1))) << " " << c<<  "\n";
	    t[p.second][b+1] = c;
	  }
	}
	vector<pair<ll, ll>> v;
	for(int i=0; i<n; ++i){
	  v.PB({t[i][z], i});
	}
	sort(v.begin(), v.end());
	int V = v[0].second;
	for(int i=0; i<n; ++i) cout << s[V+i];
}

Test 1

Verdict: RUNTIME ERROR

Test 2

Verdict: RUNTIME ERROR

Test 3

Verdict: RUNTIME ERROR

Test 4

Verdict: RUNTIME ERROR

Test 5

Verdict: RUNTIME ERROR

Test 6

Verdict: RUNTIME ERROR

Test 7

Verdict: RUNTIME ERROR

Test 8

Verdict: UNKNOWN

Test 9

Verdict: UNKNOWN

Test 10

Verdict: UNKNOWN

Test 11

Verdict: UNKNOWN

Test 12

Verdict: UNKNOWN