fork(6) download
  1. #include <iostream>
  2. #include<set>
  3. using namespace std;
  4.  
  5. int main()
  6. {
  7. set<pair<int,int>> visited;
  8. visited.insert({0,0});
  9.  
  10. int x = 0, y = 0;
  11. int direction = 0;
  12.  
  13. char turn;
  14. int distance;
  15.  
  16. while (cin >> turn >> distance)
  17. {
  18. switch(turn)
  19. {
  20. case 'L':
  21. direction = (direction + 3) % 4;
  22. break;
  23. case 'R':
  24. direction = (direction + 1) % 4;
  25. break;
  26. }
  27.  
  28. for (int d=0; d < distance; ++d)
  29. {
  30. switch(direction)
  31. {
  32. case 0:
  33. y += 1;
  34. break;
  35. case 1:
  36. x += 1;
  37. break;
  38. case 2:
  39. y -= 1;
  40. break;
  41. case 3:
  42. x -= 1;
  43. break;
  44. }
  45.  
  46. if (visited.find({x,y}) != visited.end())
  47. {
  48. cout << x << "," << y << " - " << abs(x) + abs(y) << endl;
  49. return 0;
  50. }
  51. else
  52. {
  53. visited.insert({x,y});
  54. }
  55. }
  56.  
  57. cin.ignore(1,',');
  58. }
  59.  
  60. //cout << "end: " << x << "," << y << " - " << abs(x) + abs(y) << endl;
  61.  
  62. return 0;
  63. }
Success #stdin #stdout 0s 3476KB
stdin
R3, L2, L2, R4, L1, R2, R3, R4, L2, R4, L2, L5, L1, R5, R2, R2, L1, R4, R1, L5, L3, R4, R3, R1, L1, L5, L4, L2, R5, L3, L4, R3, R1, L3, R1, L3, R3, L4, R2, R5, L190, R2, L3, R47, R4, L3, R78, L1, R3, R190, R4, L3, R4, R2, R5, R3, R4, R3, L1, L4, R3, L4, R1, L4, L5, R3, L3, L4, R1, R2, L4, L3, R3, R3, L2, L5, R1, L4, L1, R5, L5, R1, R5, L4, R2, L2, R1, L5, L4, R4, R4, R3, R2, R3, L1, R4, R5, L2, L5, L4, L1, R4, L4, R4, L4, R1, R5, L1, R1, L5, R5, R1, R1, L3, L1, R4, L1, L4, L4, L3, R1, R4, R1, R1, R2, L5, L2, R4, L1, R3, L5, L2, R5, L4, R5, L5, R3, R4, L3, L3, L2, R2, L5, L5, R3, R4, R3, R4, R3, R1
stdout
127,4 - 131