Submission #1356833
Source Code Expand
x = raw_input() stack = [] ans = 0 for i in xrange(len(x)): if x[i] == "S": stack.append("S") else: if len(stack) == 0: ans += 1 else: stack.pop() print ans + len(stack)
Submission Info
Submission Time | |
---|---|
Task | A - STring |
User | roto_37 |
Language | Python (2.7.6) |
Score | 300 |
Code Size | 238 Byte |
Status | AC |
Exec Time | 51 ms |
Memory | 3688 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 | 49 ms | 3688 KB |
corner1 | AC | 47 ms | 3688 KB |
corner2 | AC | 50 ms | 2924 KB |
example0 | AC | 10 ms | 2568 KB |
example1 | AC | 10 ms | 2568 KB |
example2 | AC | 10 ms | 2568 KB |
handmade0 | AC | 10 ms | 2568 KB |
handmade1 | AC | 10 ms | 2568 KB |
maxrand0 | AC | 51 ms | 2924 KB |
sub_corner0 | AC | 10 ms | 2568 KB |
sub_corner1 | AC | 10 ms | 2568 KB |
sub_corner2 | AC | 10 ms | 2568 KB |
sub_rand0 | AC | 10 ms | 2568 KB |