246602026-02-13 11:33:20Frici25Legtöbbször szomszédok (75 pont)python3Time limit exceeded 61/75300ms14612 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 pontszámok[i] < ŐP:
        if alatta < pontszámok[i]:
            alatta = pontszámok[i]
            A = [i]
        elif alatta == pontszámok[i]:
            A += [i]
    elif pontszámok[i] > ŐP:
        if felette > pontszámok[i]:
            felette = pontszámok[i]
            F = [i]
        elif felette == pontszámok[i]:
            F += [i]

for i in range(M, N+1):
    if pontszámok[i] < ŐP:
        if alatta < pontszámok[i]:
            alatta = pontszámok[i]
            A = [i]
        elif alatta == pontszámok[i]:
            A += [i]
    elif pontszámok[i] > ŐP:
        if felette > pontszámok[i]:
            felette = pontszámok[i]
            F = [i]
        elif felette == pontszámok[i]:
            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
base61/75
1Accepted0/016ms3124 KiB
2Time limit exceeded0/0284ms13620 KiB
3Partially correct1/217ms3128 KiB
4Partially correct1/216ms3124 KiB
5Accepted4/416ms3220 KiB
6Accepted4/416ms3124 KiB
7Accepted3/317ms3180 KiB
8Accepted4/417ms3312 KiB
9Accepted4/421ms3896 KiB
10Accepted4/427ms4148 KiB
11Accepted4/425ms4148 KiB
12Accepted4/437ms5408 KiB
13Accepted4/437ms5432 KiB
14Accepted4/437ms5100 KiB
15Accepted4/441ms5468 KiB
16Accepted4/450ms6792 KiB
17Accepted4/468ms8016 KiB
18Accepted4/497ms8784 KiB
19Time limit exceeded0/4300ms10536 KiB
20Time limit exceeded0/4287ms10356 KiB
21Time limit exceeded0/4300ms10412 KiB
22Accepted4/4200ms14612 KiB