HIIT Generation

#include <bits/stdc++.h>
 
using namespace std;
 
typedef long long ll;
 
 
ll n;
vector<char> cc;
 
void recurse(char c, int lvl=0) {
  if (lvl == n) {
    cout << c;
    return;
  }
  
  if (cc[lvl] == c) {
    recurse('H', lvl+1);
    recurse('I', lvl+1);
    recurse('I', lvl+1);
    recurse('T', lvl+1);
  }  else {
    recurse(c, lvl+1);
  }
  
}
 
int main() {
 
  cin.tie(NULL);
  std::ios::sync_with_stdio(false);
 
  cin >> n;
 
  cc.resize(n);
  for (int i=0; i<n; i++) {
    cin >> cc[i];
  }
 
  recurse('H');
  recurse('I');
  recurse('I');
  recurse('T');
    
  cout << endl;
}

Test 1

Verdict: ACCEPTED

Test 2

Verdict: TIME LIMIT EXCEEDED

Test 3

Verdict: ACCEPTED

Test 4

Verdict: ACCEPTED