Add files via upload

BrandonTang89 · web-flow · commit 48a554f3c403 · 2024-10-26T22:16:37.000+01:00
diff --git a/Other_Tasks/CF2027_A_Rectangle_Arrangement.py b/Other_Tasks/CF2027_A_Rectangle_Arrangement.py
@@ -0,0 +1,14 @@
+t = int(input())
+for _ in range(t):
+    n = int(input())
+    
+    xs = []
+    ys = []
+    
+    for i in range(n):
+        x, y = map(int, input().split())
+        xs.append(x)
+        ys.append(y)
+    
+    print(max(xs) * 2+ max(ys) * 2)
+    
diff --git a/Other_Tasks/CF2027_B_Stalin_Sort.py b/Other_Tasks/CF2027_B_Stalin_Sort.py
@@ -0,0 +1,16 @@
+t = int(input())
+for _ in range(t):
+    n = int(input())
+    arr = list(map(int, input().split()))
+    
+    ans = n
+    for i in range(n):
+        
+        numBigger = 0
+        for j in range(i+1,n):
+            if arr[j] > arr[i]:
+                numBigger += 1
+        
+        ans = min(ans, i + numBigger)
+    
+    print(ans)
diff --git a/Other_Tasks/CF2027_C_Add_Zeros.cpp b/Other_Tasks/CF2027_C_Add_Zeros.cpp
@@ -0,0 +1,56 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>  
+using namespace std;
+
+typedef long long ll;
+typedef vector<int> vi;
+#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+
+
+ll n;
+unordered_map<ll, vector<ll>> adjlist;
+vector<ll> arr;
+
+unordered_set<ll> visited;
+
+ll dfs(ll u){
+    if (visited.find(u) != visited.end()) return 0;
+    visited.insert(u);
+    ll ans = u;
+    for (auto v : adjlist[u]){
+        assert(v > u);
+        ans = max(ans, dfs(v));
+    }
+    return ans;
+}
+int main(){
+    fast_cin();
+    int tc;
+    cin >> tc;
+    while (tc--){
+        cin >> n;
+        arr.assign(n, 0);
+        adjlist.clear();
+        adjlist.reserve(n);
+        visited.clear();
+
+        cin >> arr[0];
+        for (int i = 1; i < n; i++){
+            cin >> arr[i];
+            ll x = n - i;
+            ll y = arr[i] - x;
+
+            if (y >= 0){
+                adjlist[y].push_back(y+i);
+            }
+        }
+
+        ll ans = dfs(0) + n;
+        cout << ans << endl;
+        
+    }
+
+    return 0;
+}
diff --git a/Other_Tasks/CF2027_D1_The_Endspeaker_Easy_Version.cpp b/Other_Tasks/CF2027_D1_The_Endspeaker_Easy_Version.cpp
@@ -0,0 +1,80 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>  
+using namespace std;
+
+typedef long long ll;
+typedef vector<int> vi;
+#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+
+
+int n, m;
+vector<int> a, b;
+vector<vector<ll>> memo;
+int main(){
+    int tc;
+    cin >> tc;
+    while (tc--){
+        cin >> n >> m;
+        a.assign(n, 0);
+        b.assign(m, 0);
+        for (int i = 0; i < n; i++){
+            cin >> a[i];
+        }
+        for (int i = 0; i < m; i++){
+            cin >> b[i];
+        }
+
+        ll inf = 1e18;
+        memo.assign(m+1, vector<ll>(n+1, inf)); 
+
+        // dp(_, n) = 0
+        for (int k = 0; k <= m; k++){
+            memo[k][n] = 0;
+        }
+
+        for (int k=m; k >= 1; k--){
+            priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq; // contains {dp(k,j)} for relevant j > i, lazy deletion
+            pq.emplace(memo[k][n], n);
+            int curSum = 0;  // sum of a(i+1)..a(curBack)
+            int curBack = n-1; // we are considering dp(k, i+1)..dp(k, curBack)
+
+            for (int i=n-1; i >= 0; i--){
+                if (k < m) memo[k][i] = memo[k+1][i]; // we can try incrementing k
+                curSum += a[i];
+                while (curBack >= i && curSum > b[k-1]){
+                    curSum -= a[curBack];
+                    curBack--;
+                }
+
+                // curSum = a(i)..a(curBack) <= b[k-1]
+                if (curBack < i){ // not possible to grab anything
+                    pq.emplace(memo[k][i], i);
+                    continue;
+                }
+
+                while (!pq.empty() && pq.top().second > curBack + 1){
+                    pq.pop();
+                }
+                if (!pq.empty()){
+                    ll val = pq.top().first;
+                    memo[k][i] = min(memo[k][i], val + (m-k));
+                }
+
+                pq.emplace(memo[k][i], i);
+                // cout << "k: " << k << " i: " << i << " memo: " << memo[k][i] << endl;
+            }
+        }
+
+        if (memo[1][0] >= inf){
+            cout << -1 << endl;
+        } else {
+            cout << memo[1][0] << endl;
+        }
+        // cout << memo[1][0] << endl;
+        
+    }
+
+    return 0;
+}
diff --git a/Other_Tasks/CF2027_D2_The_Endspeaker_Hard_Version.cpp b/Other_Tasks/CF2027_D2_The_Endspeaker_Hard_Version.cpp
@@ -0,0 +1,126 @@
+// #pragma GCC optimize("Ofast")
+// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
+// #pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>  
+using namespace std;
+
+typedef long long ll;
+typedef vector<int> vi;
+#define fast_cin() ios_base::sync_with_stdio(false); cin.tie(NULL); cout.tie(NULL);
+
+
+int n, m;
+vector<int> a, b;
+vector<vector<ll>> memo;
+int main(){
+    int tc;
+    cin >> tc;
+    while (tc--){
+        cin >> n >> m;
+        a.assign(n, 0);
+        b.assign(m, 0);
+        for (int i = 0; i < n; i++){
+            cin >> a[i];
+        }
+        for (int i = 0; i < m; i++){
+            cin >> b[i];
+        }
+
+        ll inf = 1e18;
+        memo.assign(m+1, vector<ll>(n+1, inf)); 
+
+        // dp(_, n) = 0
+        for (int k = 0; k <= m; k++){
+            memo[k][n] = 0;
+        }
+
+        for (int k=m; k >= 1; k--){
+            priority_queue<pair<ll, int>, vector<pair<ll, int>>, greater<pair<ll, int>>> pq; // contains {dp(k,j)} for relevant j > i, lazy deletion
+            pq.emplace(memo[k][n], n);
+            int curSum = 0;  // sum of a(i+1)..a(curBack)
+            int curBack = n-1; // we are considering dp(k, i+1)..dp(k, curBack)
+
+            for (int i=n-1; i >= 0; i--){
+                if (k < m) memo[k][i] = memo[k+1][i]; // we can try incrementing k
+                curSum += a[i];
+                while (curBack >= i && curSum > b[k-1]){
+                    curSum -= a[curBack];
+                    curBack--;
+                }
+
+                // curSum = a(i)..a(curBack) <= b[k-1]
+                if (curBack < i){ // not possible to grab anything
+                    pq.emplace(memo[k][i], i);
+                    continue;
+                }
+
+                while (!pq.empty() && pq.top().second > curBack + 1){
+                    pq.pop();
+                }
+                if (!pq.empty()){
+                    ll val = pq.top().first;
+                    memo[k][i] = min(memo[k][i], val + (m-k));
+                }
+
+                pq.emplace(memo[k][i], i);
+                // cout << "k: " << k << " i: " << i << " memo: " << memo[k][i] << endl;
+            }
+        }
+
+        vector<vector<ll>> numOps(m+1, vector<ll>(n+1, 0));
+        const ll MOD = 1e9 + 7;
+        for (int k = 0; k <= m; k++){
+            numOps[k][n] = 1;
+        }
+
+        for (int k=m; k >= 1; k--){
+            
+            unordered_map<ll, ll> cellswithValue;
+            cellswithValue[memo[k][n]] = numOps[k][n];
+            int curSum = 0;  // sum of a(i+1)..a(curBack)
+            int curBack = n-1; // we are considering dp(k, i+1)..dp(k, curBack)
+
+            for (int i=n-1; i >= 0; i--){
+                if (k < m){
+                    if (memo[k][i] == memo[k+1][i]){
+                        numOps[k][i] = numOps[k+1][i];
+                    }
+                }
+
+                curSum += a[i];
+                while (curBack >= i && curSum > b[k-1]){
+                    curSum -= a[curBack];
+                    cellswithValue[memo[k][curBack+1]] -= numOps[k][curBack+1];
+                    cellswithValue[memo[k][curBack+1]] %= MOD;
+                    curBack--;
+                }
+
+                // curSum = a(i)..a(curBack) <= b[k-1]
+                if (curBack < i){ // not possible to grab anything
+                    cellswithValue[memo[k][i]] += numOps[k][i];
+                    cellswithValue[memo[k][i]] %= MOD;
+                    continue;
+                }
+
+
+                numOps[k][i] += cellswithValue[memo[k][i] - (m-k)];
+                numOps[k][i] %= MOD;
+
+                cellswithValue[memo[k][i]] += numOps[k][i];
+                cellswithValue[memo[k][i]] %= MOD;
+            }
+        }
+
+        if (memo[1][0] >= inf){
+            cout << -1 << endl;
+        } else {
+            cout << memo[1][0] << " " << (numOps[1][0]+MOD)%MOD << endl;
+        }
+
+
+        
+        
+    }
+
+    return 0;
+}
