Submission #265862

ID	Problem	Submitter	Result	Time	Memory	Language	File size	Submit time	Judge time
#265862	#5108. Prehistoric Programs	juampi	RE	0ms	0kb	Python3	908b	2023-11-25 21:55:52	2023-11-25 21:55:53

Judging History

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

[2023-11-25 21:55:53]
评测

测评结果：RE
用时：0ms
内存：0kb

查看

[2023-11-25 21:55:52]
提交

answer

while True:
    N = int(input())
    fv, bv = [], []
    tot = 0
    for i in range(N):
        S = input()
        b = 0
        mn = 0
        for j in range(len(S)):
            b += (S[j] == '(') - (S[j] == ')')
            mn = min(mn, b)
        if b >= 0:
            fv.append([-mn, b, i])
        else:
            bv.append([b-mn, -b, i])
        tot += b
    if tot:
        print("impossible")
        continue

    for i in range(2):
        v = fv if i else bv
        v.sort()
        cur = 0
        for j in range(len(v)):
            if cur < v[j][0]:
                print("impossible")
                break
            cur += v[j][1]
        else:
            continue
        break
    else:
        bv.reverse()
        for v in fv:
            print(v[2]+1)
        for v in bv:
            print(v[2]+1)
        continue
    print("impossible")

Source code, Language: Python3

Details

Tip: Click on the bar to expand more detailed information

Test #1:

score: 0

Dangerous Syscalls

input:

50000
(
(
))))()))()(()))()()()))()(((((()(((()))()(((()))((()(())))))(()(
)
(
)
(((
(
(
(
(
(
()
(
)
(
)((())()((
)))))(
(
)
))
)()
(
)
)
)()(
(
(
()
(
)
(
)()((((())()))())(
(
(
)(
(
(
(()())())
)
)
(
(
(
)((())))((())))))))))((((()()))()))))))))((()())()))
)
)()
)
)
)
)
)
())(())))))()(()((()(())...

output:

QOJ.ac

QOJ

Judging History

answer

Details

Test #1:

input:

output:

result: