oj.uz

답안 #197972

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
197972 2020-01-24T12:26:25 Z model_code Preokret (COCI19_preokret) Python 3
40 / 50
 27 ms 3428 KB 
def prebroji_1(i,dx):
    duljina = 0
    while i > 0 and i + dx < N and (razlika[i] - razlika[i+dx] == dx):
        duljina += 1
        i += dx
    return duljina
 
def prebroji_2(i,dx):
    duljina = 0
    while i > 0 and i + dx < N and (razlika[i] - razlika[i+dx] == -dx):
        duljina += 1
        i += dx
    return duljina
 
N = int(input())
 
city = protivnik = 0
razlika = [0] * N
nule = []
 
for i in range(N):
    gol = int(input())
 
    if gol == 1:
        city += 1
    else:
        protivnik += 1
 
    razlika[i] = city - protivnik
 
    if razlika[i] == 0:
        nule += [i]
 
print(city, protivnik)
print(razlika.count(0) + 2)
 
preokret = 0
for i in nule:
    lijevo = prebroji_1(i,-1)
    desno = prebroji_1(i,1)
    if lijevo != 0 and desno != 0 and lijevo + desno > preokret:
        preokret = lijevo + desno
    lijevo = prebroji_2(i,-1)
    desno = prebroji_2(i,1)
    if lijevo != 0 and desno != 0 and lijevo + desno > preokret:
        preokret = lijevo + desno
 
print(preokret)

Subtask #1
40.0 / 50.0

# 결과 실행 시간 메모리 Grader output
1 Partially correct 25 ms 3420 KB Output is partially correct
2 Partially correct 26 ms 3332 KB Output is partially correct
3 Partially correct 26 ms 3428 KB Output is partially correct
4 Partially correct 26 ms 3408 KB Output is partially correct
5 Partially correct 26 ms 3336 KB Output is partially correct
6 Partially correct 26 ms 3428 KB Output is partially correct
7 Partially correct 26 ms 3428 KB Output is partially correct
8 Partially correct 26 ms 3428 KB Output is partially correct
9 Partially correct 27 ms 3412 KB Output is partially correct
10 Partially correct 26 ms 3332 KB Output is partially correct