Submission #3053974
Source Code Expand
N = int(input()) A = list(map(int,input().split())) res = 0 r = 1 for l in range(N): while r < N and (r <= l or A[r-1] < A[r]): r += 1 res += r - l if l == r: r += 1 print(res)
Submission Info
Submission Time | |
---|---|
Task | C - 単調増加 |
User | xagawa |
Language | Python (3.4.3) |
Score | 100 |
Code Size | 195 Byte |
Status | AC |
Exec Time | 115 ms |
Memory | 14008 KB |
Judge Result
Set Name | Sample | Subtask0 | All | ||||||
---|---|---|---|---|---|---|---|---|---|
Score / Max Score | 0 / 0 | 40 / 40 | 60 / 60 | ||||||
Status |
|
|
|
Set Name | Test Cases |
---|---|
Sample | sample0.txt, sample1.txt, sample2.txt, sample3.txt |
Subtask0 | sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt |
All | sample0.txt, sample1.txt, sample2.txt, sample3.txt, subtask0_0.txt, subtask0_1.txt, subtask0_10.txt, subtask0_11.txt, subtask0_12.txt, subtask0_13.txt, subtask0_14.txt, subtask0_2.txt, subtask0_3.txt, subtask0_4.txt, subtask0_5.txt, subtask0_6.txt, subtask0_7.txt, subtask0_8.txt, subtask0_9.txt, subtask1_0.txt, subtask1_1.txt, subtask1_10.txt, subtask1_11.txt, subtask1_12.txt, subtask1_13.txt, subtask1_14.txt, subtask1_15.txt, subtask1_2.txt, subtask1_3.txt, subtask1_4.txt, subtask1_5.txt, subtask1_6.txt, subtask1_7.txt, subtask1_8.txt, subtask1_9.txt |
Case Name | Status | Exec Time | Memory |
---|---|---|---|
sample0.txt | AC | 17 ms | 2940 KB |
sample1.txt | AC | 17 ms | 2940 KB |
sample2.txt | AC | 17 ms | 2940 KB |
sample3.txt | AC | 17 ms | 2940 KB |
subtask0_0.txt | AC | 19 ms | 3188 KB |
subtask0_1.txt | AC | 20 ms | 3316 KB |
subtask0_10.txt | AC | 19 ms | 3188 KB |
subtask0_11.txt | AC | 19 ms | 3316 KB |
subtask0_12.txt | AC | 20 ms | 3316 KB |
subtask0_13.txt | AC | 20 ms | 3316 KB |
subtask0_14.txt | AC | 19 ms | 3316 KB |
subtask0_2.txt | AC | 18 ms | 3060 KB |
subtask0_3.txt | AC | 18 ms | 3060 KB |
subtask0_4.txt | AC | 19 ms | 3188 KB |
subtask0_5.txt | AC | 17 ms | 2940 KB |
subtask0_6.txt | AC | 17 ms | 2940 KB |
subtask0_7.txt | AC | 19 ms | 3060 KB |
subtask0_8.txt | AC | 17 ms | 2940 KB |
subtask0_9.txt | AC | 19 ms | 3188 KB |
subtask1_0.txt | AC | 92 ms | 11572 KB |
subtask1_1.txt | AC | 52 ms | 6828 KB |
subtask1_10.txt | AC | 112 ms | 14004 KB |
subtask1_11.txt | AC | 93 ms | 13812 KB |
subtask1_12.txt | AC | 99 ms | 14008 KB |
subtask1_13.txt | AC | 115 ms | 13812 KB |
subtask1_14.txt | AC | 99 ms | 14008 KB |
subtask1_15.txt | AC | 98 ms | 14008 KB |
subtask1_2.txt | AC | 40 ms | 5920 KB |
subtask1_3.txt | AC | 75 ms | 9988 KB |
subtask1_4.txt | AC | 93 ms | 10728 KB |
subtask1_5.txt | AC | 85 ms | 10780 KB |
subtask1_6.txt | AC | 57 ms | 7084 KB |
subtask1_7.txt | AC | 105 ms | 13004 KB |
subtask1_8.txt | AC | 38 ms | 5708 KB |
subtask1_9.txt | AC | 27 ms | 4212 KB |