2, C++ (gcc) - rextester

Language: Layout:

#include <bits/stdc++.h>

using namespace std;
typedef long long int ll;
#define mp make_pair
#define pb push_back
#define pii pair<int, int>

string s;

vector<int> z, mask;

void KMP(){
    int n = s.length();
    z.resize(n, 0);
    mask.resize(n, 0);
    
    int i = 0;
    for(int j = 1; j < n;){
        if(s[i] == s[j]){
            z[j++] = ++i;
            continue;
        }
        if(i == 0){
            z[j++] = 0;
            continue;
        }
        i = z[i-1];
    }
    
    /*for(int j = 0; j < n; j++){
        int t = z[j];
        int &m = mask[t];
        while(t != 0){
            t |= (1 << )
        }
    }*/
}

string solve(){
    int n = s.length();
    for(int j = 1; j < n-1; j++){
        if(z[j] == 0) continue;
        int t = z[j];
        while(t != 0){
            if(s[t] != s[j+1]){
                string ans = "";
                for(int i = 0; i <= j; i++)
                    ans += s[i];
                for(int i = t; i < n; i++) ans += s[i];
                return ans;
            }
            t = z[t-1];
        }
    }
    return "Impossible";
}

int main(){
    ios_base :: sync_with_stdio(0);
    cin.tie(0);
    
    int t;
    cin >> t;
    for(int i = 1; i <= t; i++){
        cin >> s;
        KMP();
        
        cout << "Case #" << i << ": " << solve() << endl;
    }
    return 0;
}

Show compiler warnings [ + ] Compiler args [ - ] Show input
Compilation time: 1.52 sec, absolute running time: 0.13 sec, cpu time: 0.08 sec, memory peak: 3 Mb, absolute service time: 1,71 sec