leetcode 2536

Pankajcoder1 · Pankajcoder1 · commit a05e73ad49bf · 2023-01-20T11:34:43.000+05:30
diff --git a/CSES/Sorting_and_Searching/Collecting Numbers.cpp b/CSES/Sorting_and_Searching/Collecting Numbers.cpp
@@ -0,0 +1,43 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int solve()
+{
+    int n;
+    cin >> n;
+    int count = 1;
+
+    vector<pair<int, int>> v(n);
+    for (int i = 0; i < n; i++)
+    {
+        cin >> v[i].first;
+        v[i].second = i + 1;
+    }
+
+    sort(v.begin(), v.end());
+    int temp = -1;
+    for (int i = 0; i < n; i++)
+    {
+        if (v[i].second < temp)
+        {
+            count++;
+        }
+        temp = v[i].second;
+    }
+    cout << count << endl;
+    return 0;
+}
+int main()
+{
+    int testCase = 1;
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}
diff --git a/Codeforces/1117B-Emotes.cpp b/Codeforces/1117B-Emotes.cpp
@@ -78,6 +78,7 @@ int main()
     cin>>n>>m>>k;
     vl v(n,0);
     forin(v,n);
+    // sorting the vector
     srt(v);
     ll x=v[n-1];
     ll y=v[n-2];
diff --git a/Codeforces/After Placement/1773F-Football.cpp b/Codeforces/After Placement/1773F-Football.cpp
@@ -0,0 +1,87 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int n,a,b;
+    cin>>n>>a>>b;
+    if(n==1){
+        if(a==b){
+            cout<<1<<endl<<a<<":"<<b<<endl;
+            return 0;
+        }
+        else{
+            cout<<0<<endl<<a<<":"<<b<<endl;
+            return 0;
+        }
+    }
+
+    vector<pair<int,int>> v(n+1);
+    for(int i=1;i<=n;i++){
+        v[i].first=0;
+        v[i].second=0;
+    }
+    int draw=0;
+
+    int pos=1;
+    for(;pos<=n;){
+        if(a>0){
+            a--;
+            v[pos].first++;
+            pos++;
+        }
+        else{
+            break;
+        }
+    }
+    if(a>0){
+        v[1].first += a;
+    }
+    if(b){
+        if(pos==n+1){
+            v[1].first++;
+            v[n].first--;
+            v[n].second=b;
+        }
+        else{
+            for(;pos<=n;){
+                if(b>0){
+                    b--;
+                    v[pos].second++;
+                    pos++;
+                }
+                else{
+                    break;
+                }
+            }
+            if(b>0){
+                v[n].second += b;
+            }
+        }
+
+    }
+    for(int i=1;i<=n;i++){
+        if(v[i].first==v[i].second){
+            draw++;
+        }
+    }
+    cout<<draw<<endl;
+    for(int i=1;i<=n;i++){
+        cout<<v[i].first<<":"<<v[i].second<<endl;
+    }
+    
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
diff --git a/Codeforces/After Placement/1777B-Matrix Rotation.cpp b/Codeforces/After Placement/1777B-Matrix Rotation.cpp
@@ -0,0 +1,36 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+int solve()
+{
+    int a, b, c, d;
+    cin >> a >> b >> c >> d;
+
+    if ((b > a && d > c && c > a && d > b) ||
+        (a > c && b > d && d > c && b > a) ||
+        (c > d && a > b && b > d && a > c) ||
+        (d > b && c > a && a > b && c > d))
+    {
+        cout << "YES" << endl;
+    }
+    else
+    {
+        cout << "NO" << endl;
+    }
+    return 0;
+}
+int main()
+{
+    int testCase = 1;
+    cin >> testCase;
+    while (testCase--)
+    {
+        solve();
+    }
+    return 0;
+}
diff --git a/Codeforces/After Placement/1782A-Parallel Projection.cpp b/Codeforces/After Placement/1782A-Parallel Projection.cpp
@@ -0,0 +1,24 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+#include <bits/stdc++.h>
+using namespace std;
+typedef long long ll;
+
+
+int solve(){
+    int w,d,h,a,b,f,g;
+    cin>>w>>d>>h>>a>>b>>f>>g;
+    cout<<min({b+h+g+abs(f-a),abs(d-b)+h+abs(d-g)+abs(a-f),a+h+f+abs(g-b),abs(w-a)+h+abs(w-f)+abs(b-g)})<<endl;
+    return 0;
+}
+int main()
+{
+    int testCase=1;
+    cin>>testCase;
+    while(testCase--){
+        solve();
+    }
+    return 0;
+}
diff --git a/GFG/Prefix Subsequences.cpp b/GFG/Prefix Subsequences.cpp
@@ -0,0 +1,58 @@
+// { Driver Code Starts
+// Initial Template for C++
+
+#include <bits/stdc++.h>
+using namespace std;
+
+// } Driver Code Ends
+// User function Template for C++
+
+class Solution
+{
+public:
+    int maximumPrefix(int n, int m, string s, string t)
+    {
+        // code here
+        int j = 0;
+        for (int i = 0; i < n; i++)
+        {
+            bool flag = false;
+            while (j < m)
+            {
+                if (t[j] == s[i])
+                {
+                    flag = true;
+                    j++;
+                    break;
+                }
+                j++;
+            }
+            if (flag == false)
+            {
+                return i + 1;
+            }
+        }
+        return -1;
+    }
+};
+
+// { Driver Code Starts.
+
+int main()
+{
+    int c;
+    cin >> c;
+    while (c--)
+    {
+        int n, m;
+        cin >> n >> m;
+        string s, t;
+        cin >> s >> t;
+        Solution obj;
+        int ans = obj.maximumPrefix(n, m, s, t);
+        cout << ans << "\n";
+    }
+
+    return 0;
+}
+// } Driver Code Ends
diff --git a/GFG/Tree Formation.cpp b/GFG/Tree Formation.cpp
@@ -0,0 +1,50 @@
+// { Driver Code Starts
+// Initial Template for C++
+
+#include <bits/stdc++.h>
+using namespace std;
+
+// } Driver Code Ends
+// User function Template for C++
+
+class Solution
+{
+public:
+    long long minimumCost(int n, vector<int> &p)
+    {
+        // code here
+        long long ans = 0;
+        unordered_map<int, int> m;
+
+        m[1] = 0;
+        for (int i = 1; i < p.size(); i++)
+        {
+            m[p[i]]++;
+            m[i + 1]++;
+            ans += m[p[i]];
+        }
+
+        return ans;
+    }
+};
+
+// { Driver Code Starts.
+
+int main()
+{
+    int t;
+    cin >> t;
+    while (t--)
+    {
+        int n;
+        cin >> n;
+        vector<int> p(n);
+        for (int i = 0; i < n; i++)
+            cin >> p[i];
+        Solution obj;
+        long long ans = obj.minimumCost(n, p);
+        cout << ans << endl;
+    }
+    return 0;
+}
+// } Driver Code Ends
diff --git a/LeetCode/2536.Increment Submatrices by One.cpp b/LeetCode/2536.Increment Submatrices by One.cpp
@@ -0,0 +1,40 @@
+/*
+    written by Pankaj Kumar.
+    country:-INDIA
+*/
+typedef long long ll ;
+const ll INF=1e18;
+const ll mod1=1e9+7;
+const ll mod2=998244353;
+//Add main code here
+
+class Solution
+{
+public:
+    vector<vector<int>> rangeAddQueries(int n, vector<vector<int>> &queries)
+    {
+        vector<vector<int>> s(n, vector<int>(n, 0));
+        for (auto &q : queries)
+        {
+            ++q[2], ++q[3];
+            s[q[0]][q[1]]++;
+            if (q[2] < n)
+                s[q[2]][q[1]]--;
+            if (q[3] < n)
+                s[q[0]][q[3]]--;
+            if (q[2] < n && q[3] < n)
+                s[q[2]][q[3]]++;
+        }
+        for (int i = 0; i < n; ++i)
+            for (int j = 0; j < n; ++j)
+            {
+                if (i > 0)
+                    s[i][j] += s[i - 1][j];
+                if (j > 0)
+                    s[i][j] += s[i][j - 1];
+                if (i > 0 && j > 0)
+                    s[i][j] -= s[i - 1][j - 1];
+            }
+        return s;
+    }
+};
