NOI.AC

ID	题目	提交者	结果	用时	内存	语言	文件大小	提交时间	测评时间
#212784	#3828. B	Alex9876	0	18ms	5284kb	Python3	1.2kb	2024-10-20 11:12:30	2024-10-20 14:38:36

answer

T=int(input())
def dfs(line,col,num):
    vis_num.append(lis[line][col])
    visit[line][col]=1
    mi=[]
    if line>0 and visit[line-1][col]==0 and lis[line-1][col]>lis[line][col]:mi.append(lis[line-1][col])
    if line<L-1 and visit[line+1][col]==0 and lis[line+1][col]>lis[line][col]:mi.append(lis[line+1][col])
    if col>0 and visit[line][col-1]==0 and lis[line][col-1]>lis[line][col]:mi.append(lis[line][col-1])
    if col<c-1 and visit[line][col+1]==0 and lis[line][col+1]>lis[line][col]:mi.append(lis[line][col+1])
    if len(mi)>0:
        n=min(mi)
        for g in range(L):
            for h in range(c):
                if lis[g][h]==n:dfs(g,h,num+1)
    else:return
for i in range(T):
    lis=[]
    vis_num=[]
    visit=[]
    al=input().split()
    L,c=int(al[0]),int(al[1])
    for i in range(L):
        bl=input().split()
        small=[]
        for j in bl:
            try:small.append(int(j))
            except:pass
        lis.append(small)
        zero=[]
        for b in range(len(small)):zero.append(0)
        visit.append(zero)
    dfs(0,0,0)
    print(len(vis_num))
    for i in vis_num:print(i,end=" ")
    print()

源文件, 语言: Python3

详细

小提示：点击横条可展开更详细的信息

Subtask #1:

score: 0

Wrong Answer

Test #1:

score: 20

Accepted

time: 9ms

memory: 5272kb

input:

output:

5
0 1 2 5 8 
6
0 1 2 5 7 8 
5
0 1 2 5 8 
6
0 1 2 5 6 8 
5
0 1 2 5 7 
7
0 1 2 5 6 7 8 
5
0 1 2 6 8 
6...

result:

ok 64 numbers

Test #2:

score: -20

Wrong Answer

time: 9ms

memory: 5284kb

input:

10
1 10
1 5 0 8 2 9 6 3 4 7
1 10
2 5 8 0 9 7 3 1 6 4
3 3
0 1 2
5 4 3
6 7 8
1 10
3 4 7 2 5 6 9 0 1 8
...

output:

2
1 5 
3
2 5 8 
9
0 1 2 3 4 5 6 7 8 
3
3 4 7 
1
5 
3
5 6 7 
2
2 8 
10
0 1 2 3 4 5 6 7 8 9 
1
3 
9
0 ...

result:

wrong answer 1st numbers differ - expected: '3', found: '2'

Subtask #2:

score: 0

Dangerous Syscalls

Test #3:

score: 0

Dangerous Syscalls

input:

10
22 45
0 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 33...

output:

990
0 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 33 34 3...

result:

Subtask #3:

score: 0

Dangerous Syscalls

Test #5:

score: 0

Dangerous Syscalls

input:

10
2 100000
143604 106821 145034 44402 118718 156663 77133 28800 81890 12336 191537 118894 103331 75...

output:

1
143604 
2
111937 192011 
1
119055 
4
5537 22115 69962 172067 
1
130881

result:

Subtask #4:

score: 0

Dangerous Syscalls

Test #6:

score: 0

Dangerous Syscalls

input:

10
1 200000
0 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...

output:

result:

Subtask #5:

score: 0

Dangerous Syscalls

Test #7:

score: 0

Dangerous Syscalls

input:

10
145 1379
140324 86968 96426 123781 39754 103720 60835 118904 114639 53717 27146 110309 39232 5608...

output:

3
140324 158400 177947 
3
89996 95093 179554 
1
33612 
3
11982 199059 199139 
3
116529 153409 175622