[Programmers] 방문 길이

*set을 이용해서 좌표와 방향을 저장 / 지나온 길도 저장 

 

 

#include <string> #include <set> #include <vector> #include <algorithm> #include <iostream> using namespace std; typedef pair<int, int> pp; typedef pair<int, pp> ipp; typedef pair<pp,pp> pppp; set<ipp> s; set<pppp> visited; int dx[4] = {1,-1,0,0}, dy[4] = {0,0,1,-1}; int solution(string dirs) { int answer = 0; int x = 0, y = 0; int dir = 0; for (int i = 0; i < dirs.size(); i++) { switch(dirs[i]) { case 'U': dir = 0; break; case 'D': dir = 1; break; case 'R': dir = 2; break; case 'L': dir = 3; break; } int nx = x + dx[dir]; int ny = y + dy[dir]; if (nx < -5 || nx > 5 || ny < -5 || ny > 5) continue; if (visited.find({{nx, ny},{x, y}}) != visited.end()) { x = nx; y = ny; continue; } if (visited.find({{x, y},{nx, ny}}) != visited.end()) { x = nx; y = ny; continue; } s.insert({dir,{x, y}}); visited.insert({{nx, ny},{x, y}}); visited.insert({{x, y},{nx, ny}}); x = nx; y = ny; } set<ipp>::iterator it; for (it = s.begin(); it != s.end(); it++) { ipp tmp = *it; cout << tmp.first << " " << tmp.second.first << " " << tmp.second.second << '\n'; } answer = s.size(); return answer; }