C++ (코딩테스트) - 신고 결과 받기(프로그래머스)

문제

https://school.programmers.co.kr/learn/courses/30/lessons/92334

프로그래머스

 

 

내가 푼 답

 

#include <string>
#include <vector>
#include <algorithm>
#include <map>

using namespace std;

vector<int> solution(vector<string> id_list, vector<string> report, int k) {

    int id_size = id_list.size();

    vector<int> answer(id_size, 0);
    vector<bool> vote_check(id_size,false);
    vector<vector<bool>> vote(id_size, vote_check);
    vector<int> voted_cnt(id_size, 0);

    map<string, int> list;
    for (int i = 0; i < id_size; i++)
        list.insert(pair<string, int>{ id_list[i], i });        

    sort(report.begin(), report.end());
    report.erase(unique(report.begin(), report.end()), report.end());

    for (int i = 0; i < report.size(); i++)
    {
        string a, b;
        bool chk = true;
        for (int j = 0; j < report[i].size(); j++)
        {
            if (report[i][j] == ' ') { chk = false; continue; }
            if (chk)
                a.push_back(report[i][j]);
            else
                b.push_back(report[i][j]);
        }
        vote[list[a]][list[b]] = true;
        voted_cnt[list[b]]++;
    }

    for (int i = 0; i < id_size; i++)
    {
        if (voted_cnt[i] < k) continue;

        for (int j = 0; j < id_size; j++)
            if (vote[j][i]) answer[j]++;    
    }
    return answer;
}

 

다른사람 풀이

 

#include <bits/stdc++.h>
#define fastio cin.tie(0)->sync_with_stdio(0)
using namespace std;

vector<int> solution(vector<string> id_list, vector<string> report, int k) {
    // 1.
    const int n = id_list.size();
    map<string, int> Conv;
    for (int i = 0; i < n; i++) Conv[id_list[i]] = i;

    // 2.
    vector<pair<int, int>> v;
    sort(report.begin(), report.end());
    report.erase(unique(report.begin(), report.end()), report.end());
    for (const auto& s : report) {
        stringstream in(s);
        string a, b; in >> a >> b;
        v.push_back({ Conv[a], Conv[b] });
    }

    // 3.
    vector<int> cnt(n), ret(n);
    for (const auto& [a, b] : v) cnt[b]++;
    for (const auto& [a, b] : v) if (cnt[b] >= k) ret[a]++;
    return ret;
}