conclave.cpp

#include <iostream>
#include <fstream>
#include <vector>
#include "conclave.h"
#include <utility>
#include <algorithm>
using namespace std;
int main(){
    ifstream in("input.txt");
    ofstream out("output.txt");

    int N, num_riun;
    in >> N >> num_riun;
    vector<pair<int,bool>> votanti(N,make_pair(-1,false));
    vector<vector<int>> meetings(num_riun); // this matrix stores the ppl in the different meetings

    int R_i=0;
    int R_j=0;
    for (int i = 0; i < num_riun; i++) {
        in >> R_i;
        //cout << "riunione mum: "<<i << " ,num part: " << R_i  <<endl << "\t";
        for (int j = 0; j < R_i; j++) {
            in >> R_j;
            //cout << R_j << " ";
            meetings[i].push_back(R_j);
            if(votanti[R_j].first==-1){
                votanti[R_j].first = 1;
            } else
                votanti[R_j].first++;
        }
        //cout << endl;
    }

    /*for (size_t i = 0; i < votanti.size(); i++) {
        cout << i << " | " << votanti[i].first << endl;
    }*/
    vector<int> solution;
    for (size_t i = 0; i < meetings.size(); i++) {
        int max_sofar = 0;
        int stored_index=0;
        bool skipped = false;
        for (size_t j = 0; j < meetings[i].size(); j++) {
            //cout << "try: "<<meetings[i][j] << "\n";
            if(votanti[meetings[i][j]].second){// if a votante was already chosen then there's nothing to do for this meeting
                skipped=true;
                break;
            }
            if(votanti[meetings[i][j]].first > max_sofar){
                max_sofar = votanti[meetings[i][j]].first;
                stored_index = meetings[i][j];
            }
        }
        if(!skipped){
            votanti[stored_index].second = true;
            solution.push_back(stored_index);
        }
        //cout <<endl;
    }
    out << solution.size() << " ";
    for (size_t i = 0; i < solution.size(); i++) {
        out << solution[i] << " ";
    }
    out << "#";
    return 0;
}