oj.uz

답안 #161479

# 제출 시각 아이디 문제 언어 결과 실행 시간 메모리
161479 2019-11-02T16:45:41 Z boolodifjenula Cezar (COCI17_cezar) Python 3
40 / 50
 46 ms 3428 KB 
n=int(input())
S=0
L=[]
K=[4,4,4,4,4,4,4,4,16,4]
for i in range(n):
    L+=[int(input())]
    S+=L[i]
    K[L[i]-2]-=1
m=21-S
if sum(K[:m+1])<sum(K[m:]):
    print("DOSTA")
else:
    print("VUCI")

Subtask #1
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3300 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 25 ms 3292 KB Output is correct

Subtask #2
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3300 KB Output is correct
2 Correct 25 ms 3300 KB Output is correct
3 Correct 26 ms 3292 KB Output is correct

Subtask #3
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 27 ms 3300 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 25 ms 3300 KB Output is correct

Subtask #4
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 25 ms 3300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #5
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 3272 KB Output is correct
2 Correct 26 ms 3272 KB Output is correct
3 Correct 26 ms 3300 KB Output is correct

Subtask #6
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3300 KB Output is correct
2 Correct 25 ms 3256 KB Output is correct
3 Correct 25 ms 3300 KB Output is correct

Subtask #7
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 25 ms 3292 KB Output is correct
2 Correct 26 ms 3300 KB Output is correct
3 Correct 25 ms 3364 KB Output is correct

Subtask #8
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 28 ms 3292 KB Output is correct
2 Correct 32 ms 3360 KB Output is correct
3 Correct 25 ms 3300 KB Output is correct

Subtask #9
0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Incorrect 26 ms 3300 KB Output isn't correct
2 Halted 0 ms 0 KB -

Subtask #10
5.0 / 5.0

# 결과 실행 시간 메모리 Grader output
1 Correct 26 ms 3300 KB Output is correct
2 Correct 25 ms 3428 KB Output is correct
3 Correct 46 ms 3300 KB Output is correct