Submission #65892504


Source Code Expand

from bisect import bisect_left

N = int(input())
P = list(map(int, input().split()))
A = []
B = []
C = []
temp = 1
for i in range(1, N - 1):
    if P[i - 1] < P[i]:
        temp += 1
        if P[i] > P[i + 1]:
            A.append((i + 1, temp))
            C.append(i + 1)
            temp = 1
    if P[i - 1] > P[i] and P[i] < P[i + 1]:
        B.append(i + 1)
B.append(N + 1)
C.append(N + 1)
M = len(B)
ans = 0
for a in range(len(A)):
    i, cnt = A[a]
    k = bisect_left(B, i)
    if M - k < 2:
        continue
    j1 = B[k]
    j2 = B[k + 1]
    m = bisect_left(C, j1)
    i3 = C[m]
    temp = (cnt - 1) * (min(i3, j2 - 1) - j1)
    ans += temp
print(ans)

Submission Info

Submission Time
Task C - ~
User Nikkuniku029
Language Python (PyPy 3.10-v7.3.12)
Score 350
Code Size 697 Byte
Status AC
Exec Time 179 ms
Memory 134124 KiB

Judge Result

Set Name Sample All
Score / Max Score 0 / 0 350 / 350
Status
AC × 3
AC × 38
Set Name Test Cases
Sample sample00.txt, sample01.txt, sample02.txt
All sample00.txt, sample01.txt, sample02.txt, testcase00.txt, testcase01.txt, testcase02.txt, testcase03.txt, testcase04.txt, testcase05.txt, testcase06.txt, testcase07.txt, testcase08.txt, testcase09.txt, testcase10.txt, testcase11.txt, testcase12.txt, testcase13.txt, testcase14.txt, testcase15.txt, testcase16.txt, testcase17.txt, testcase18.txt, testcase19.txt, testcase20.txt, testcase21.txt, testcase22.txt, testcase23.txt, testcase24.txt, testcase25.txt, testcase26.txt, testcase27.txt, testcase28.txt, testcase29.txt, testcase30.txt, testcase31.txt, testcase32.txt, testcase33.txt, testcase34.txt
Case Name Status Exec Time Memory
sample00.txt AC 58 ms 76436 KiB
sample01.txt AC 59 ms 76308 KiB
sample02.txt AC 59 ms 76220 KiB
testcase00.txt AC 93 ms 91092 KiB
testcase01.txt AC 148 ms 132568 KiB
testcase02.txt AC 86 ms 86968 KiB
testcase03.txt AC 150 ms 132340 KiB
testcase04.txt AC 138 ms 121948 KiB
testcase05.txt AC 150 ms 132828 KiB
testcase06.txt AC 130 ms 117496 KiB
testcase07.txt AC 146 ms 132748 KiB
testcase08.txt AC 57 ms 76464 KiB
testcase09.txt AC 58 ms 76592 KiB
testcase10.txt AC 106 ms 104740 KiB
testcase11.txt AC 178 ms 132688 KiB
testcase12.txt AC 145 ms 134124 KiB
testcase13.txt AC 179 ms 132796 KiB
testcase14.txt AC 96 ms 131684 KiB
testcase15.txt AC 79 ms 105236 KiB
testcase16.txt AC 98 ms 131496 KiB
testcase17.txt AC 76 ms 99772 KiB
testcase18.txt AC 98 ms 131580 KiB
testcase19.txt AC 73 ms 91572 KiB
testcase20.txt AC 98 ms 131796 KiB
testcase21.txt AC 77 ms 99512 KiB
testcase22.txt AC 96 ms 131996 KiB
testcase23.txt AC 81 ms 108576 KiB
testcase24.txt AC 98 ms 132196 KiB
testcase25.txt AC 77 ms 104996 KiB
testcase26.txt AC 96 ms 132196 KiB
testcase27.txt AC 70 ms 91860 KiB
testcase28.txt AC 100 ms 132652 KiB
testcase29.txt AC 75 ms 99464 KiB
testcase30.txt AC 99 ms 132656 KiB
testcase31.txt AC 69 ms 87992 KiB
testcase32.txt AC 102 ms 132468 KiB
testcase33.txt AC 79 ms 102012 KiB
testcase34.txt AC 97 ms 132040 KiB