Cod sursa(job #3353760)

Utilizator PatrikKev75Szucs Patrik - Kevin PatrikKev75 Data 11 mai 2026 09:34:22
Problema Sortare topologica Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.74 kb
// !!! NEM HELYES< CSAK KIINDULO PONT VOLT !!!
#include <fstream>
#include <vector>

#define vecVec std::vector<std::vector<int>>
#define vecB std::vector<bool>

std::ofstream out("sortaret.out");

void dfs(vecVec &graf, vecB &visited, int s)
{
    out << s << ' ';
    visited[s] = true;
    for (auto elem : graf[s])
    {
        if (!visited[elem])
        {
            dfs(graf, visited, elem);
        }
    }
}

int main()
{
    int n, m;
    std::ifstream in("sortaret.in");
    in >> n >> m;

    vecVec graf(n + 1);
    while (m--)
    {
        int x, y;
        in >> x >> y;

        graf[x].push_back(y);
    }
    in.close();

    vecB visited(n + 1);
    dfs(graf, visited, 1);

    return 0;
}