기본 콘텐츠로 건너뛰기

2606 : 바이러스 (DFS) [Python3]

CONN = []
Conn_Saved = []


def SetCONN(c, p):
    global CONN, Conn_Saved

    for i in range(c):
        Temp = []
        for j in range(c):
            Temp.append(int(0))
        CONN.append(Temp)
        Conn_Saved.append(int(0))
    for t in range(p):
        i, j = input().split()

        CONN[int(i) - 1][int(j) - 1] = 1
        CONN[int(j) - 1][int(i) - 1] = 1


def DFS(i, j, com):
    global CONN, Conn_Saved

    if CONN[i][j] == 1:
        CONN[i][j] = 0
        Conn_Saved[i - 1] = Conn_Saved[j - 1] = 1
        DFS(j, 0, com)

    if j == 0:
        for t in range(1, com):
            DFS(i, t, com)
    return

if __name__ == "__main__":

    Com = int(input())
    Pair = int(input())

    SetCONN(Com, Pair)
    DFS(0, 0, Com)

    All_Deconn = True
    Count = 0
    for i in range(len(Conn_Saved)):
        if Conn_Saved[i] == 1:
            Count += 1
            All_Deconn = False

    if All_Deconn == False:
        print(Count - 1)
    else:
        print(Count)

한쪽만 저장 -> 입력 순서의 무작위
양쪽 저장 -> 열이 0에서 검색

댓글

이 블로그의 인기 게시물

1978 : 소수 찾기 [C++]

# include < iostream > # include < vector > using namespace std ; int main ( ) { cin . tie ( NULL ) ; vector < int > Primes ; Primes . push_back ( 2 ) ; Primes . push_back ( 3 ) ; for ( int i = 4 ; i < 1000 ; i + + ) { bool IsPrime = true ; if ( i % 2 = = 0 | | i % 3 = = 0 ) continue ; for ( int j = 4 ; j < i ; j + + ) { if ( i % j = = 0 ) { IsPrime = false ; break ; } } if ( IsPrime ) Primes . push_back ( i ) ; } int N , Count = 0 ; cin > > N ; for ( int i = 0 ; i < N ; i + + ) { int Input ; cin > > Input ; for ( int j = 0 ; j < Primes . size ( ) ; j + + ) if ( Input = = Primes [ j ] ) Count + + ; } cout < < Count < < " \n " ; return 0 ; }

10828 : 스택 [Python]

Stack = [ ] def push ( num ) : Stack . append ( int ( num ) ) def pop ( ) : if len ( Stack ) > 0 : print ( Stack . pop ( ) ) else : print ( - 1 ) def size ( ) : print ( len ( Stack ) ) def empty ( ) : if len ( Stack ) == 0 : print ( 1 ) else : print ( 0 ) def top ( ) : if len ( Stack ) > 0 : print ( Stack [ len ( Stack ) - 1 ] ) else : print ( - 1 ) TestCase = int ( input ( ) ) while TestCase > 0 : Command = input ( ) if Command == 'top' : top ( ) elif Command == 'pop' : pop ( ) elif Command == 'empty' : empty ( ) elif Command == 'size' : size ( ) else : push ( Command [ 5 : ] ) TestCase - = 1