기본 콘텐츠로 건너뛰기

2667 : 단지번호붙이기 (DFS) [Python3] 

Maps = []
Houses = []
Count = 0

def DrawMap(n):
    global Maps
    for i in range(n):
        Temp = []
        Temp.append(str(input()))
        Temp2 = []
        for j in range(n):
            Temp2.append(int(Temp[0][j]))
        Maps.append(Temp2)

def DFS(i,j,n):
    global Maps, Houses,Count

    if Maps[i][j] == 0:
        return
    if Maps[i][j] == 1:
        Count += 1
        Maps[i][j] = 0

    if j < (n - 1) and Maps[i][j + 1] == 1:
        DFS(i, j + 1, n)
    if i < (n - 1) and Maps[i + 1][j] == 1:
        DFS(i + 1, j, n)
    if i > 0 and Maps[i - 1][j] == 1:
        DFS(i - 1, j, n)
    if j > 0 and Maps[i][j - 1] == 1:
        DFS(i, j - 1, n)


if __name__ == "__main__":

    N = int(input())
    DrawMap(N)

    for i in range(N):
        for j in range(N):
            DFS(i,j,N)
            if Count != 0 :
                Houses.append(Count)
            Count = 0

    Houses.sort()
    print(len(Houses))
    for i in range(len(Houses)):
        if Houses[i] != 0:
            print(Houses[i])
라벨:

댓글

댓글 쓰기

이 블로그의 인기 게시물

11004 : K번째 수 [C++]

# include < iostream > # include < cstdio > # include < algorithm > int main ( ) { int * Number = new int [ 5000000 ] ; int N , K ; scanf ( " %d %d " , & N , & K ) ; for ( int i = 0 ; i < N ; i + + ) scanf ( " %d " , Number [ i ] ) ; std :: sort ( Number , Number + N ) ; printf ( " %d " , Number [ K - 1 ] ) ; return 0 ; }
댓글 쓰기
자세한 내용 보기

1149 : RGB Street Coloring (Dynamic Programming) [C,C++]

The key to this problem lies in understanding the principles. Let me explain the algorithm to solve the problem by using DP. First, you need the same storage space like input data's size. When you draw any color of the nth house, the space will contain the minimum value. If you paint the red in the second house, this value is sum of blue or green of the first house.  You must use DP because you must use the previous value.  Of course, you can also use the recursive algorithm to solve it. But if it gets bigger, it will take a lot of time.  If you paint the red in the nth house in the same way, you should add the lower value of the blue and green of the n-1th house.  Therefore, the minimum value can be found in the value of the storage space (n-1) index. <pesudo code> *Source of the problem =  https://www.acmicpc.net/problem/1149 *문제 출처 : BAEKJOON ONLINE JUDGE
댓글 쓰기
자세한 내용 보기

11478 : 서로 다른 부분 문자열의 개수 (미제) [C++]

# include < iostream > # include < vector > # include < string > using namespace std ; int main ( ) { string sInput ; getline ( cin , sInput , '\n' ) ; int Time = 1 ; int Count = 0 ; vector < string > Storage ; for ( int i = 0 ; i < sInput . size ( ) ; i + + ) { for ( int j = 0 ; ( j + Time - 1 ) < sInput . size ( ) ; j + + ) Storage . push_back ( sInput . substr ( j , Time ) ) ; Time + + ; } bool * Visited = new bool [ Storage . size ( ) * sizeof ( bool ) ] ; for ( int i = 0 ; i < Storage . size ( ) ; i + + ) { Visited [ i ] = true ; for ( int j = 0 ; j < Storage . size ( ) ; j + + ) { if ( i ! = j & & Storage [ i ] = = Storage [ j ] ) { Visited [ i ] = false ; Visited [ j ] = true ; break ; } } } for ( int i = 0 ; i < Storage . size ( ) ; i + + ) if ( Visited [ i ] ) Count ...
댓글 쓰기
자세한 내용 보기