Task: | Linear Gimmick |
Sender: | Kuha |
Submission time: | 2016-08-04 14:15:43 +0300 |
Language: | C++ |
Status: | READY |
Result: | 100 |
group | verdict | score |
---|---|---|
#1 | ACCEPTED | 100 |
test | verdict | time | |
---|---|---|---|
#1 | ACCEPTED | 0.06 s | details |
#2 | ACCEPTED | 0.06 s | details |
#3 | ACCEPTED | 0.06 s | details |
#4 | ACCEPTED | 0.06 s | details |
#5 | ACCEPTED | 0.06 s | details |
#6 | ACCEPTED | 0.05 s | details |
#7 | ACCEPTED | 0.05 s | details |
#8 | ACCEPTED | 0.06 s | details |
#9 | ACCEPTED | 0.06 s | details |
#10 | ACCEPTED | 0.05 s | details |
#11 | ACCEPTED | 0.06 s | details |
#12 | ACCEPTED | 0.06 s | details |
#13 | ACCEPTED | 0.06 s | details |
#14 | ACCEPTED | 0.06 s | details |
#15 | ACCEPTED | 0.06 s | details |
#16 | ACCEPTED | 0.06 s | details |
#17 | ACCEPTED | 0.06 s | details |
#18 | ACCEPTED | 0.06 s | details |
#19 | ACCEPTED | 0.06 s | details |
#20 | ACCEPTED | 0.05 s | details |
#21 | ACCEPTED | 0.06 s | details |
#22 | ACCEPTED | 0.06 s | details |
#23 | ACCEPTED | 0.06 s | details |
#24 | ACCEPTED | 0.06 s | details |
#25 | ACCEPTED | 0.07 s | details |
#26 | ACCEPTED | 0.05 s | details |
#27 | ACCEPTED | 0.06 s | details |
#28 | ACCEPTED | 0.06 s | details |
#29 | ACCEPTED | 0.06 s | details |
Code
#include <bits/stdc++.h> #define uint unsigned int #define ull unsigned long long #define INF 999999999 #define LINF 999999999999999999 #define ll long long #define ld long double #define M 1000000007 #define E 0.0000001 #define N (1<<18) #define pii pair<int, int> #define pll pair<long long, long long> #define pdd pair<double, double> #define pld pair<long double, long double> #define cll complex<long long> #define cld complex<long double> #define X real() #define Y imag() #define C 'a' #define F first #define S second #define PI 3.1415926535897932384626433 using namespace std; int main () { int n; cin>>n; string c; cin>>c; int r = 0; for (char x : c) r += x == '<'; int l = 0; int ans = 0; for (int i = 0; i < n; i++) { if (c[i] == '>') l++; else r--; if (r + 1 == l) { for (int i = 0; i < n; i++) if (c[i] == '>' || c[n - i - 1] == '<') { ans = max(ans, n - i); break; } } else if (r == l) { for (int i = 0; i < n; i++) if (c[i] == '>' || c[n - i - 1] == '<') { ans = max(ans, n - i); break; } } else if (r - 1 == l) { } } cout<<ans<<endl; }
Test details
Test 1
Verdict: ACCEPTED
input |
---|
5 >>><> |
correct output |
---|
5 |
user output |
---|
5 |
Test 2
Verdict: ACCEPTED
input |
---|
6 ><><>< |
correct output |
---|
6 |
user output |
---|
6 |
Test 3
Verdict: ACCEPTED
input |
---|
8 >>>><><< |
correct output |
---|
8 |
user output |
---|
8 |
Test 4
Verdict: ACCEPTED
input |
---|
8 >>>>><>> |
correct output |
---|
8 |
user output |
---|
8 |
Test 5
Verdict: ACCEPTED
input |
---|
10 ><<><<<<<< |
correct output |
---|
10 |
user output |
---|
10 |
Test 6
Verdict: ACCEPTED
input |
---|
7 >><><<< |
correct output |
---|
7 |
user output |
---|
7 |
Test 7
Verdict: ACCEPTED
input |
---|
526 ><><<<>><><><<<<<>>>>>><><<>><... |
correct output |
---|
526 |
user output |
---|
526 |
Test 8
Verdict: ACCEPTED
input |
---|
920 <<<<><>>><><><<<<><<<<>>><<>>>... |
correct output |
---|
917 |
user output |
---|
917 |
Test 9
Verdict: ACCEPTED
input |
---|
528 <>>>>>><><<>>>>>>>>>>><>><<<<>... |
correct output |
---|
528 |
user output |
---|
528 |
Test 10
Verdict: ACCEPTED
input |
---|
837 <<<>><<<<><>><<<<<<>><<<<<<><<... |
correct output |
---|
837 |
user output |
---|
837 |
Test 11
Verdict: ACCEPTED
input |
---|
761 >>>><><>>><<><>>>><<<>>>>>>>><... |
correct output |
---|
761 |
user output |
---|
761 |
Test 12
Verdict: ACCEPTED
input |
---|
53592 <><<<<>>><>><<><><><<>><<<<<><... |
correct output |
---|
53591 |
user output |
---|
53591 |
Test 13
Verdict: ACCEPTED
input |
---|
52256 >>><<><>><><<<>><<><>><>>><<>>... |
correct output |
---|
52256 |
user output |
---|
52256 |
Test 14
Verdict: ACCEPTED
input |
---|
99234 >><>><<<<><<><<<<><><><><><<<>... |
correct output |
---|
99234 |
user output |
---|
99234 |
Test 15
Verdict: ACCEPTED
input |
---|
90893 <<><><><<<<><>><<<<>>>><><><><... |
correct output |
---|
90893 |
user output |
---|
90893 |
Test 16
Verdict: ACCEPTED
input |
---|
94064 >><><<>>><<>>>>>><>><<<><>><>>... |
correct output |
---|
94064 |
user output |
---|
94064 |
Test 17
Verdict: ACCEPTED
input |
---|
5 >><<< |
correct output |
---|
5 |
user output |
---|
5 |
Test 18
Verdict: ACCEPTED
input |
---|
85155 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
84901 |
user output |
---|
84901 |
Test 19
Verdict: ACCEPTED
input |
---|
97153 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
96645 |
user output |
---|
96645 |
Test 20
Verdict: ACCEPTED
input |
---|
99451 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
99140 |
user output |
---|
99140 |
Test 21
Verdict: ACCEPTED
input |
---|
56288 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
56150 |
user output |
---|
56150 |
Test 22
Verdict: ACCEPTED
input |
---|
93160 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
92348 |
user output |
---|
92348 |
Test 23
Verdict: ACCEPTED
input |
---|
69172 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
53872 |
user output |
---|
53872 |
Test 24
Verdict: ACCEPTED
input |
---|
94056 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
89998 |
user output |
---|
89998 |
Test 25
Verdict: ACCEPTED
input |
---|
71927 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
58103 |
user output |
---|
58103 |
Test 26
Verdict: ACCEPTED
input |
---|
72348 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
70369 |
user output |
---|
70369 |
Test 27
Verdict: ACCEPTED
input |
---|
97095 <<<<<<<<<<<<<<<<<<<<<<<<<<<<<<... |
correct output |
---|
93334 |
user output |
---|
93334 |
Test 28
Verdict: ACCEPTED
input |
---|
6 ><<><< |
correct output |
---|
6 |
user output |
---|
6 |
Test 29
Verdict: ACCEPTED
input |
---|
7 <<><<>> |
correct output |
---|
5 |
user output |
---|
5 |