Cod sursa(job #2327739)

Utilizator skoda888Alexandru Robert skoda888 Data 24 ianuarie 2019 21:04:59
Problema Arbore partial de cost minim Scor 0
Compilator cpp-64 Status done
Runda Arhiva educationala Marime 0.81 kb


#include <iostream>
#include <fstream>
#include <set>
#include <vector>
#include <cstring>

const int NMAX = 26;


struct cmp{

    bool operator()(std::pair<int, char> A, std::pair<int, char> B) const{
        return A.second < B.second;
    }
};


std::multiset< std::pair<int, char>, cmp > Graf[NMAX];
std::string Sir;


void DFS(int i){

    Graf[]
}


int main(){

    std::ifstream in("Automat.in");
    std::ofstream out("Automat.out");

    ///Citire
    int N, M;
    in >> N >> M;

    for(int i = 1; i <= M; ++i){
        int x, y;
        in >> x >> y;
        char cost;
        in >> cost;

        Graf[x].insert(std::make_pair(y, cost));
    }

    in.get();
    std::getline(in, Sir);

    for(int i = 1; i <= N; ++i){
        DFS(i);
    }

    return 0;
}