fork(1) download
  1. #include <bits/stdc++.h>
  2. using namespace std;
  3.  
  4. #define fast_io ios::sync_with_stdio(false); cin.tie(NULL);
  5. #define int long long
  6.  
  7. void solve() {
  8. string s;
  9. cin >> s;
  10. int n = s.size();
  11.  
  12. if (n == 1) {
  13. cout << 1 << "\n";
  14. return;
  15. }
  16.  
  17. bool seenGreater = false;
  18. for (char c : s) {
  19. if (c == '>') seenGreater = true;
  20. if (c == '<' && seenGreater) {
  21. cout << -1 << "\n";
  22. return;
  23. }
  24. }
  25.  
  26. for (int i = 0; i + 1 < n; i++) {
  27. if (s[i] == '*' && s[i+1] == '*') {
  28. cout << -1 << "\n";
  29. return;
  30. }
  31. }
  32.  
  33. int first_gt = -1;
  34. for (int i = 0; i < n; i++) {
  35. if (s[i] == '>') {
  36. first_gt = i;
  37. break;
  38. }
  39. }
  40.  
  41. int last_lt = -1;
  42. for (int i = 0; i < n; i++) {
  43. if (s[i] == '<') last_lt = i;
  44. }
  45.  
  46. if (first_gt == -1) {
  47. cout << n << "\n";
  48. return;
  49. }
  50.  
  51. if (last_lt == -1) {
  52. cout << n << "\n";
  53. return;
  54. }
  55.  
  56. int L = first_gt;
  57. int R = n - 1 - last_lt;
  58.  
  59. cout << max(L, R) << "\n";
  60. }
  61.  
  62. int32_t main() {
  63. fast_io;
  64. int t;
  65. cin >> t;
  66. while (t--) solve();
  67. return 0;
  68. }
  69.  
Success #stdin #stdout 0.01s 5324KB
stdin
4
*****
<<<>
>*<
*
stdout
-1
3
-1
1