1219 길찾기

SWEA::1219 길찾기

https://www.swexpertacademy.com/main/code/problem/problemDetail.do?contestProbId=AV14geLqABQCFAYD&categoryId=AV14geLqABQCFAYD&categoryType=CODE

기본 dfs 문제

#include <stdio.h>
using namespace std;
 
int n, m;
bool visited[100];
int map[100][100];
bool flag;
 
void dfs(int v) {
    visited[v] = true;
    if (v == 99) {
        flag = true;
        return;
    }
    else {
        for (int i = 0; i < 100; i++) {
            if (map[v][i] == 1 && !visited[i]) {
                dfs(i);
            }
        }
    }
}
 
void init() {
 
    for (int i = 0; i < 100; i++) {
        for (int j = 0; j < 100; j++) {
            map[i][j] = 0;
        }
    }
 
    for (int i = 0; i < 100; i++) {
        visited[i] = false;
    }
}
 
int main() {
    for (int t = 0; t < 10; t++) {
        init();
        scanf("%d %d", &n, &m);
        for (int i = 0; i < m; i++) {
            int x, y;
            scanf("%d %d", &x, &y);
            map[x][y] = 1;
        }
 
        flag = false;
        dfs(0);
 
        if (flag) {
            printf("#%d 1\n", n);
        }
        else {
            printf("#%d 0\n", n);
        }
    }
}