백준 10162번 전자레인지

문제 링크입니다: https://www.acmicpc.net/problem/10162

간단한 BFS(Breadth First Search) 알고리즘 문제였습니다.

#include <iostream>

#include <queue>

using namespace std;

 

const int MAX = 10000 + 1;

 

bool visited[MAX];

 

int main(void)

{

        ios_base::sync_with_stdio(0);

        cin.tie(0);

        int T;

        cin >> T;

 

        queue<pair<int, pair<int, pair<int, int>>>> q;

        q.push({ T, {0, {0, 0}} });

        visited[T] = true;

 

        while (!q.empty())

        {

                 int time = q.front().first;

                 int A = q.front().second.first;

                 int B = q.front().second.second.first;

                 int C = q.front().second.second.second;

                 q.pop();

 

                 if (time == 0)

                 {

                         cout << A << " " << B << " " << C << "\n";

                         return 0;

                 }

 

                 if (time - 300 >= 0 && !visited[time - 300])

                 {

                         visited[time - 300] = true;

                         q.push({ time - 300, {A + 1, {B, C}} });

                 }

                 if (time - 60 >= 0 && !visited[time - 60])

                 {

                         visited[time - 60] = true;

                         q.push({ time - 60, {A, {B + 1, C}} });

                 }

                 if (time - 10 >= 0 && !visited[time - 10])

                 {

                         visited[time - 10] = true;

                         q.push({ time - 10, {A, {B, C + 1}} });

                 }

        }

        cout << -1 << "\n";

        return 0;

}

개발환경:Visual Studio 2017

지적, 조언, 질문 환영입니다! 댓글 남겨주세요~