Submission #9134534

Source Code Expand

#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
const int N = 1e6;

ll n, ans, a[N], cnt[N];
string s;

int main() {
	ios::sync_with_stdio(false), cin.tie(0);
	cin >> s;
	n = s.length();
	for (int i = n - 1; ~i; i--)
		if (s[i] == '>')
			cnt[i] = cnt[i + 1] + 1;
	ans += (a[0] = cnt[0]);
	for (int i = 0; i < n; i++) {
		if (s[i] == '<')
			a[i + 1] = max(a[i] + 1, cnt[i + 1]);
		else
			a[i + 1] = cnt[i + 1];
		ans += a[i + 1];
	}
	cout << ans;
}

Submission Info

Submission Time
Task A - ><
User LODB
Language C++14 (GCC 5.4.1)
Score 300
Code Size 497 Byte
Status AC
Exec Time 10 ms
Memory 11164 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 300 / 300
Status
AC × 2
AC × 15
Set Name Test Cases
Sample 00-sample-01.txt, 00-sample-02.txt
All 00-sample-01.txt, 00-sample-02.txt, 01-01.txt, 01-02.txt, 01-03.txt, 01-04.txt, 01-05.txt, 01-06.txt, 01-07.txt, 01-08.txt, 01-09.txt, 01-10.txt, 01-11.txt, 01-12.txt, 01-13.txt
Case Name Status Exec Time Memory
00-sample-01.txt AC 2 ms 2304 KiB
00-sample-02.txt AC 2 ms 2304 KiB
01-01.txt AC 2 ms 2304 KiB
01-02.txt AC 9 ms 11028 KiB
01-03.txt AC 10 ms 11036 KiB
01-04.txt AC 5 ms 6292 KiB
01-05.txt AC 10 ms 11164 KiB
01-06.txt AC 5 ms 7068 KiB
01-07.txt AC 7 ms 11164 KiB
01-08.txt AC 5 ms 7068 KiB
01-09.txt AC 7 ms 11164 KiB
01-10.txt AC 6 ms 9116 KiB
01-11.txt AC 7 ms 11164 KiB
01-12.txt AC 6 ms 9244 KiB
01-13.txt AC 7 ms 11164 KiB