C-_leetcode/walking_robot.cpp at main · Myparadox-creator/C-_leetcode · GitHub

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
<<<<<<< HEAD
class Solution {
public:
    int robotSim(vector<int>& commands, vector<vector<int>>& obstacles) {

        int x = 0, y = 0;
        int d = 0;

        vector<pair<int,int>> dir = {
            {0,1}, {1,0}, {0,-1}, {-1,0}
        };

        unordered_set<long long> st;

        for(auto obs : obstacles){
            long long k = (long long)obs[0]*100000 + obs[1];
            st.insert(k);
        }

        int maxdist = 0;

        for(int cmd : commands){

            if(cmd == -1){
                d = (d + 1) % 4;
            }
            else if(cmd == -2){
                d = (d + 3) % 4;
            }
            else{
                for(int s = 0; s < cmd; s++){

                    int NewX = x + dir[d].first;
                    int NewY = y + dir[d].second;

                    long long k = (long long)NewX * 100000 + NewY;

                    if(st.count(k)) break;

                    x = NewX;
                    y = NewY;

                    maxdist = max(maxdist, x*x + y*y);
                }
            }
        }

        return maxdist;
    }
=======
class Solution {
public:
    int robotSim(vector<int>& commands, vector<vector<int>>& obstacles) {

        int x = 0, y = 0;
        int d = 0;

        vector<pair<int,int>> dir = {
            {0,1}, {1,0}, {0,-1}, {-1,0}
        };

        unordered_set<long long> st;

        for(auto obs : obstacles){
            long long k = (long long)obs[0]*100000 + obs[1];
            st.insert(k);
        }

        int maxdist = 0;

        for(int cmd : commands){

            if(cmd == -1){
                d = (d + 1) % 4;
            }
            else if(cmd == -2){
                d = (d + 3) % 4;
            }
            else{
                for(int s = 0; s < cmd; s++){

                    int NewX = x + dir[d].first;
                    int NewY = y + dir[d].second;

                    long long k = (long long)NewX * 100000 + NewY;

                    if(st.count(k)) break;

                    x = NewX;
                    y = NewY;

                    maxdist = max(maxdist, x*x + y*y);
                }
            }
        }

        return maxdist;
    }
>>>>>>> 5d89016cc92f7edf396eb0ffe33f00ed3a88c3fd
};