main.cpp

#include <algorithm>
#include <iostream>
#include <map>
#include <queue>
#include <set>
#include <string>
#include <unordered_map>
#include <vector>
using namespace std;

bool val_included(vector<int> vec,int value){
    for(int x:vec){
        if (x == value){
            return true;
        }
    }
    return false;
}

bool is_both_exist_in_array(vector<int> vec,int value1,int value2){
    if(val_included(vec,value1) && val_included(vec,value2)){
        return true;
    } else {
        return false;
    }
}

int main() {
    vector<array<int, 3>> edges = {
        {1, 2, 8},
        {4, 5, 2},
        {7, 8, 1},
        {3, 4, 6},
        {8, 3, 5},
        {7, 6, 3}
    };

    vector<array<int,3>> p_vec;
    vector<array<int,3>> c_vec;

    for(int i=0;i<(int)edges.size()-1;i++){
        for(int j=0;j<(int)edges.size()-1-i;j++){
            if(edges[j][2] > edges[j+1][2]){
                array<int,3> temp = edges[j];
                edges[j] = edges[j+1];
                edges[j+1] = temp;
            }
        }
    }

    //cycle이면 해당 array 버림 (p)

    vector<int> existed_nodes;

    for(int i=0;i<(int)edges.size();i++){
        if(is_both_exist_in_array(existed_nodes,edges[i][0],edges[i][1])){
            cout << "p {" << edges[i][0] << edges[i][1] << edges[i][2] << "}" << endl;
        } else {
            cout << "c {" << edges[i][0] << edges[i][1] << edges[i][2] << "}" << endl;
        }

        if(!val_included(existed_nodes,edges[i][0])){
            existed_nodes.push_back(edges[i][0]);
        }
        if(!val_included(existed_nodes,edges[i][1])){
            existed_nodes.push_back(edges[i][1]);
        }
    }


    //아니면 해당 array안버림
    // 범위 기반 for문을 활용한 출력

    return 0;
}