Submission #2380861
Source Code Expand
import java.util.ArrayDeque; import java.util.Deque; import java.util.Scanner; public class Main { public static void main(String[] args) { Scanner in = new Scanner(System.in); String str = in.nextLine(); Deque<Character> que = new ArrayDeque<>(); for(char ch: str.toCharArray()) { if(ch == 'T' && que.size() > 0 && que.peek().equals('S')) { que.pop(); }else { que.push(ch); } } System.out.println(que.size()); } }
Submission Info
Submission Time | |
---|---|
Task | A - STring |
User | mosmos21 |
Language | Java8 (OpenJDK 1.8.0) |
Score | 300 |
Code Size | 559 Byte |
Status | AC |
Exec Time | 204 ms |
Memory | 28520 KB |
Judge Result
Set Name | Sample | Subtask1 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 200 / 200 | 100 / 100 | ||||||
Status |
|
|
|
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 | 204 ms | 28520 KB |
corner1 | AC | 197 ms | 26472 KB |
corner2 | AC | 192 ms | 26984 KB |
example0 | AC | 88 ms | 21844 KB |
example1 | AC | 90 ms | 19028 KB |
example2 | AC | 90 ms | 19796 KB |
handmade0 | AC | 89 ms | 19028 KB |
handmade1 | AC | 90 ms | 19668 KB |
maxrand0 | AC | 193 ms | 22104 KB |
sub_corner0 | AC | 91 ms | 19668 KB |
sub_corner1 | AC | 91 ms | 19284 KB |
sub_corner2 | AC | 92 ms | 21332 KB |
sub_rand0 | AC | 91 ms | 19156 KB |