백준 2623번 - 음악프로그램 Junnnho

BOJ : https://www.acmicpc.net/problem/2623

 

 

#include <cstdio>
#include <vector>
using namespace std;
 
vector<int> v[1001];
vector<int> seq;
int N, M, many, arr[101][1001];
int check[1001];
bool check_false;
 
void finder(int start) {
    if (check[start] == 1)
        return;
 
    for (int i = 0; i < v[start].size(); i++) {
        if (check[v[start][i]] == 1)
            continue;
        else if (check[v[start][i]] == 2) {
            check_false = true;
            return;
        }
        else {
            check[v[start][i]] = 2;
            finder(v[start][i]);
            if (check_false == true)
                return;
        }
    }
 
    seq.push_back(start);
    check[start] = 1;
 
}
 
 
int main() {
    scanf("%d%d", &N, &M);
    for (int i = 0; i < M; i++) {
        scanf("%d", &many);
        for (int j = 0; j < many; j++) {
            scanf("%d", &arr[i][j]);
        }
    }
    for (int i = 0; i < M; i++) {
        for (int j = 0; j < 1000; j++) {
            if (arr[i][j] == 0) break;
            int num = arr[i][j];
            for (int k = 0; k < j; k++) {
                bool check_insert = false;
                for (int a = 0; a < v[num].size(); a++) {
                    if (v[num][a] == arr[i][k]) {
                        check_insert = true;
                        break;
                    }
                }
                if (check_insert == true)
                    continue;
                v[num].push_back(arr[i][k]);
            }
        }
    }
    for (int i = 1; i <= N; i++) {
        finder(i);
        if (check_false == true)
            break;
    }
 
    if (check_false == false) {
        for (int i = 0; i < N; i++) {
            printf("%d\n", seq[i]);
        }
    }
    else
        printf("0");
}