246592026-02-13 11:26:28Frici25Legtöbbször szomszédok (75 pont)python3Time limit exceeded 57/75300ms15120 KiB
alap = [int(x) for x in input().split()]
pontszĂĄmok = [0]+[int(x) for x in input().split()]
N, M = alap[0], alap[1]
ƐP = pontszåmok[M]
# elƑtte
alatta = 0
felette = 10001
A = []
F = []
Va = [0]*(N+1)
Vf = [0]*(N+1)
for i in range(1, M+1):
    if alatta < pontszåmok[i] < ƐP:
        alatta = pontszĂĄmok[i]
        A = [i]
    elif alatta == pontszĂĄmok[i]:
        A += [i]
    elif felette > pontszåmok[i] > ƐP:
        felette = pontszĂĄmok[i]
        F = [i]
    elif felette == pontszĂĄmok[i]:
        F += [i]

for i in range(M, N+1):
    if alatta < pontszåmok[i] < ƐP:
        alatta = pontszĂĄmok[i]
        A = [i]
    elif alatta == pontszåmok[i] <ƐP:
        A += [i]
    elif felette > pontszåmok[i] > ƐP:
        felette = pontszĂĄmok[i]
        F = [i]
    elif felette == pontszåmok[i] > ƐP:
        F += [i]
    for a in A:
        Va[a] += 1
    for f in F:
        Vf[f] += 1

print(Vf.index(max(Vf)), max(Vf))
print(Va.index(max(Va)), max(Va))
SubtaskSumTestVerdictTimeMemory
base57/75
1Accepted0/017ms3248 KiB
2Time limit exceeded0/0275ms13828 KiB
3Partially correct1/217ms3112 KiB
4Partially correct1/217ms3244 KiB
5Accepted4/417ms3244 KiB
6Accepted4/416ms3196 KiB
7Accepted3/317ms3124 KiB
8Accepted4/416ms3124 KiB
9Accepted4/421ms3848 KiB
10Accepted4/428ms4320 KiB
11Accepted4/426ms4152 KiB
12Accepted4/441ms5348 KiB
13Accepted4/437ms5508 KiB
14Accepted4/441ms5328 KiB
15Accepted4/443ms5288 KiB
16Accepted4/452ms6660 KiB
17Accepted4/472ms8252 KiB
18Accepted4/4101ms9044 KiB
19Time limit exceeded0/4300ms10204 KiB
20Time limit exceeded0/4282ms10924 KiB
21Time limit exceeded0/4300ms10156 KiB
22Time limit exceeded0/4215ms15120 KiB