add 1001

Author: luliyucoordinate

README.md

@@ -341,4 +341,5 @@ LeetCode
 |0996|[Number of Squareful Arrays](https://leetcode.com/problems/number-of-squareful-arrays/) | c | [c++](./src/0996-Number-of-Squareful-Arrays/0996.cpp) |[python](./src/0996-Number-of-Squareful-Arrays/0996.py)|||Hard|
 |0997|[Find the Town Judge](https://leetcode.com/problems/find-the-town-judge/) | c | [c++](./src/0997-Find-the-Town-Judge/0997.cpp) |[python](./src/0997-Find-the-Town-Judge/0997.py)|||Easy|
 |0998|[Maximum Binary Tree II](https://leetcode.com/problems/maximum-binary-tree-ii/) | c | [c++](./src/0998-Maximum-Binary-Tree-II/0998.cpp) |[python](./src/0998-Maximum-Binary-Tree-II/0998.py)|||Medium|
-|0999|[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/) | c | [c++](./src/0999-Available-Captures-for-Rook/0999.cpp) |[python](./src/0999-Available-Captures-for-Rook/0999.py)|||Easy|
+|0999|[Available Captures for Rook](https://leetcode.com/problems/available-captures-for-rook/) | c | [c++](./src/0999-Available-Captures-for-Rook/0999.cpp) |[python](./src/0999-Available-Captures-for-Rook/0999.py)|||Easy|
+|1001|[Grid Illumination](https://leetcode.com/problems/grid-illumination/) | c | [c++](./src/1001-Grid-Illumination/1001.cpp) |[python](./src/1001-Grid-Illumination/1001.py)|||Hard|

src/1001-Grid-Illumination/1001.cpp

@@ -0,0 +1,41 @@
+static int x = []() {std::ios::sync_with_stdio(false); cin.tie(0); return 0; }();
+class Solution 
+{
+public:
+    vector<int> gridIllumination(int N, vector<vector<int>>& lamps, vector<vector<int>>& queries) 
+    {
+        unordered_map<int, int> r, c, dia1, dia2;
+        unordered_set<pair<int, int>, pairHash> lp;
+        for (auto& lamp : lamps)
+        {
+            r[lamp[0]]++, c[lamp[1]]++, dia1[lamp[0]+lamp[1]]++, dia2[lamp[0]-lamp[1]]++;
+            lp.insert({lamp[0], lamp[1]});
+        }
+        
+        vector<int> res;
+        for (auto& q : queries)
+        {
+            if (r[q[0]] or c[q[1]] or dia1[q[0] + q[1]] or dia2[q[0] - q[1]]) res.push_back(1);
+            else res.push_back(0);
+            for (int x = -1; x < 2; ++x)
+            {
+                for (int y = -1; y < 2; ++y)
+                {
+                    
+                    int nx = x + q[0];
+                    int ny = y + q[1];
+                    if (lp.erase({nx, ny}))
+                    {
+                        r[nx]--, c[ny]--, dia1[nx+ny]--,dia2[nx-ny]--;
+                    }
+                }
+            }
+        }
+        return res;
+    }
+private:
+    struct pairHash
+    {
+        size_t operator()(const pair<int, int> &x) const { return x.first ^ x.second; }
+    };
+};