leetcode contest

Author: Pankajcoder1

LeetCode/2249.Count_Lattice_Points_Inside_a_Circle.cpp

@@ -0,0 +1,83 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+typedef vector<int> vl;
+typedef vector<vector<int>> vvl;
+#define speed cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);
+/*  Abbrevations  */
+#define ff first
+#define ss second
+#define mp make_pair
+#define pb push_back
+// Some print
+#define no cout<<"NO"<<endl;
+#define yes cout<<"YES"<<endl;
+// sort
+#define all(V) (V).begin(),(V).end()
+#define srt(V) sort(all(V))
+#define srtGreat(V) sort(all(V),greater<ll>())
+// some extra
+#define printv(v) for(ll i=0;i<ll(v.size());i++){cout<<v[i]<<" ";} cout<<endl;
+#define precision(x) cout<<fixed<<setprecision(x);
+#define sz(V) ll(V.size())
+
+
+/* ascii value
+A=65,Z=90,a=97,z=122
+*/
+
+/* Some syntax 
+//Syntax to create a min heap for priority queue
+//priority_queue <int, vector<int>, greater<int>>pq;
+*/
+/*  --------------------MAIN PROGRAM----------------------------*/
+// to run ctrl+b
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+// Techniques :
+// divide into cases, brute force, pattern finding
+// sort, greedy, binary search, two pointer
+// transform into graph
+
+// Experience :
+// Cp is nothing but only observation and mathematics.
+
+
+//Add main code here
+
+class Solution {
+public:
+    int countLatticePoints(vector<vector<int>>& circles) {
+        set<pair<int,int>> s;
+        for(auto v:circles){
+            int x_cordinates_start=v[0]-v[2];
+            int x_cordinates_end=v[0]+v[2];
+            int y_cordinates_start=v[1]-v[2];
+            int y_cordinates_end=v[1]+v[2];
+            // equation of cirlce with (h,k) as center and r as radius
+            // (x-h)^2+(y-k)^2=r^2
+            for(int x=x_cordinates_start;x<=x_cordinates_end;x++){
+                for(int y=y_cordinates_start;y<=y_cordinates_end;y++){
+                    int value=((x-v[0])*(x-v[0]))+((y-v[1])*(y-v[1]))-v[2]*v[2];
+                    if(value<=0){
+                        s.insert({x,y});
+                    }
+                }
+            }
+        }
+        return s.size();
+    }
+};
+
+
+/* -----------------END OF PROGRAM --------------------*/
+/*
+* stuff you should look before submission
+* constraint and time limit
+* int overflow
+* special test case (n=0||n=1||n=2)
+* don't get stuck on one approach if you get wrong answer
+*/