CodeForces/Drifitng_Away.cpp at main · codeAntariksh/CodeForces · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
#include<bits/stdc++.h>
using namespace std;
#define int long long
#define endl '\n'
const int MOD = 1e9 + 7;

void solve(string &s)
{
	int n = s.size();
	// Initial Checks
	// >< Sequence, ** & >* & *< Conditions
	bool greater = false;
	for(int i=0;i<n-1;i++)
	{
		if((s[i]=='>' && s[i+1]=='*') || (s[i]=='*' && s[i+1]=='<') || (s[i]=='*' && s[i+1]=='*'))
		{
			cout<<-1<<endl;
			return;
		}
		if(s[i]=='>')
			greater = true;
		if(s[i]=='<' && greater==true)
		{
			cout<<-1<<endl;
			return;
		}
	}
	int dist = 1;
	// *>>>> Sequence Check
	for(int i=0;i<n-1;i++)
	{
		if(s[i]=='*')
		{
			int temp = i;
			int run = 1;
			while(i<n)
			{
				if((s[i]=='*' && s[i+1]=='>') || (s[i]=='>' && s[i+1]=='>'))
					{
						run++;
						i++;
					}
				else break;
			}
			dist = max(dist,run);
			i = temp;
		}
	}
	// <<<<* Sequence Check
	for(int i=0;i<n-1;i++)
	{
		if(s[i]=='<')
		{
			int temp = i;
			int run = 1;
			while(i<n)
			{
				if((s[i]=='<' && s[i+1]=='<') || (s[i]=='<' && s[i+1]=='*'))
					{
						run++;
						i++;
					}
				else break;
			}
			dist = max(dist,run);
			i = temp;
		}
	}
	cout<<dist<<endl;
	return;
}

int32_t main()
{
	ios::sync_with_stdio(false);
    cin.tie(nullptr);
    cout.tie(nullptr);
	int t=1;
	cin>>t;
	while(t--)
	{
		string s;
		cin>>s;
		solve(s);
	}
	return 0;
}