Submission #11639785
Source Code Expand
from itertools import permutations as pr s = "0" + input() l = len(s) - 1 c = l * ~-l * 2 for i, j in pr(range(1, l+1), 2): if (i > j and s[i] == "D") or (i < j and s[i] == "U"): c -= 1 print(c)
Submission Info
Submission Time | |
---|---|
Task | B - Evilator |
User | orangecolor |
Language | PyPy3 (2.4.0) |
Score | 0 |
Code Size | 213 Byte |
Status | TLE |
Exec Time | 2106 ms |
Memory | 46748 KB |
Judge Result
Set Name | Sample | All | ||||||
---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 0 / 400 | ||||||
Status |
|
|
Set Name | Test Cases |
---|---|
Sample | s1.txt, s2.txt |
All | 01.txt, 02.txt, 03.txt, 04.txt, 05.txt, 06.txt, 07.txt, 08.txt, 09.txt, 10.txt, s1.txt, s2.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
01.txt | TLE | 2106 ms | 44908 KB |
02.txt | TLE | 2106 ms | 44892 KB |
03.txt | TLE | 2106 ms | 44908 KB |
04.txt | TLE | 2106 ms | 44892 KB |
05.txt | TLE | 2106 ms | 44652 KB |
06.txt | TLE | 2106 ms | 44652 KB |
07.txt | TLE | 2106 ms | 44652 KB |
08.txt | TLE | 2105 ms | 46748 KB |
09.txt | AC | 161 ms | 38256 KB |
10.txt | AC | 163 ms | 38256 KB |
s1.txt | AC | 162 ms | 38256 KB |
s2.txt | AC | 164 ms | 38256 KB |