QOJ.ac

QOJ

IDProblemSubmitterResultTimeMemoryLanguageFile sizeSubmit timeJudge time
#569961#9308. World Cupryno#WA 15ms10640kbPython3350b2024-09-17 12:51:432024-09-17 12:51:44

Judging History

你现在查看的是最新测评结果

  • [2024-09-17 12:51:44]
  • 评测
  • 测评结果:WA
  • 用时:15ms
  • 内存:10640kb
  • [2024-09-17 12:51:43]
  • 提交

answer

T = int(input())
for _ in range(T):
    A = list(map(int, input().split()))
    c = sum(x <= A[0] for x in A)
    # c = 32 - c + 1
    if c <= 2:
        print(32)
    elif c <= 6:
        print(16)
    elif c <= 14:
        print(8)
    elif c <= 27:
        print(4)
    elif c <= 31:
        print(2)
    else:
        print(1)


Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 100
Accepted
time: 9ms
memory: 10640kb

input:

1
32 31 30 29 28 27 26 25 24 23 22 21 20 19 18 17 16 15 14 13 12 11 10 9 8 7 6 5 4 3 2 1

output:

1

result:

ok 1 number(s): "1"

Test #2:

score: -100
Wrong Answer
time: 15ms
memory: 10528kb

input:

32
1 2 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
2 1 3 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
3 1 2 4 5 6 7 8 9 10 11 12 13 14 15 16 17 18 19 20 21 22 23 24 25 26 27 28 29 30 31 32
4 1 2 3 5 6 7 8 9 10 11 12 13 14 15 ...

output:

32
32
16
16
16
16
8
8
8
8
8
8
8
8
4
4
4
4
4
4
4
4
4
4
4
4
4
2
2
2
2
1

result:

wrong answer 14th numbers differ - expected: '4', found: '8'