Submission #1228131


Source Code Expand

import java.util.Scanner;

public class Main {
	static Scanner s = new Scanner(System.in);

	public static void main(String[] args) {
		String in=s.next();
		int depth=0;
		int count=0;
		for(int i=0;i<in.length();i++) {
			switch (in.charAt(i)) {
			case'T':
				if(depth==0) count++;
				else depth--;
				break;
			case'S':
				depth++;
				break;
			}
		}
		System.out.println(count*2);
	}
}

Submission Info

Submission Time
Task A - STring
User fal_rnd
Language Java8 (OpenJDK 1.8.0)
Score 300
Code Size 419 Byte
Status AC
Exec Time 163 ms
Memory 26380 KB

Judge Result

Set Name Sample Subtask1 All
Score / Max Score 0 / 0 200 / 200 100 / 100
Status
AC × 3
AC × 9
AC × 13
Set Name Test Cases
Sample example0, example1, example2
Subtask1 example0, example1, example2, sub_corner0, sub_corner1, sub_corner2, sub_rand0, handmade0, handmade1
All corner0, corner1, corner2, example0, example1, example2, handmade0, handmade1, maxrand0, sub_corner0, sub_corner1, sub_corner2, sub_rand0
Case Name Status Exec Time Memory
corner0 AC 163 ms 23592 KB
corner1 AC 161 ms 23372 KB
corner2 AC 152 ms 23620 KB
example0 AC 88 ms 19156 KB
example1 AC 88 ms 21844 KB
example2 AC 89 ms 18900 KB
handmade0 AC 88 ms 21844 KB
handmade1 AC 88 ms 20180 KB
maxrand0 AC 156 ms 26380 KB
sub_corner0 AC 99 ms 23636 KB
sub_corner1 AC 90 ms 23124 KB
sub_corner2 AC 100 ms 19668 KB
sub_rand0 AC 89 ms 20564 KB