Add files via upload

Author: BrandonTang89

Other_Tasks/CF2022_B_Kar_Salesman.cpp

@@ -0,0 +1,69 @@
+#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 main() {
+    fast_cin();
+    int t;
+    cin >> t;
+    while (t--) {
+        ll n, x;
+        cin >> n >> x;
+        vector<ll> arr(n);
+        for (int i = 0; i < n; ++i) {
+            cin >> arr[i];
+        }
+        sort(arr.begin(), arr.end(), greater<ll>());
+
+        ll hi = accumulate(arr.begin(), arr.end(), 0LL);
+        ll lo = hi / x;
+        while (lo < hi) {
+            vector<ll> h(x+2, 0);
+            ll mid = lo + (hi - lo) / 2;
+            h[0] = mid;
+            bool valid = true;
+            int pos = 0;
+            for (int i = 0; i < n && valid; ++i) {
+                assert(arr[i] > 0);
+                ll cur = h[pos];
+                ll nxt = h[pos+1];
+                if (pos+1 >= x) nxt = 0;
+                if (pos >= x) cur = 0;
+
+                if (cur + nxt < arr[i]){
+                    valid = false;
+                    break;
+                }
+
+                ll takeFromCur = min(arr[i], cur);
+                ll takeFromNxt = arr[i] - takeFromCur;
+                assert(takeFromNxt <= nxt);
+
+                h[pos+2] = h[pos+2] + takeFromNxt;
+                h[pos+1] = nxt - takeFromNxt + takeFromCur;
+                h[pos] = cur - takeFromCur;
+
+                if (h[pos] == 0) pos++;
+            }
+
+            if (valid) {
+                hi = mid;
+            } else {
+                lo = mid + 1;
+            }
+
+            
+        }
+        cout << lo << endl;
+    }
+    return 0;
+}

Other_Tasks/CF2026_A_Perpendicular_Segments.py

@@ -0,0 +1,9 @@
+
+t = int(input())
+for _ in range(t):
+    x, y, k = map(int, input().split())
+    
+    x = min(x, y)
+    
+    print(0, 0, x, x)
+    print(x, 0, 0, x)

Other_Tasks/CF2026_B_Black_Cells.py

@@ -0,0 +1,25 @@
+inf = int(1e19)
+def checkMaxi(arr):
+    n = len(arr)
+    assert n % 2 == 0
+    maxi = 0
+    for i in range(0, n, 2):
+        maxi = max(maxi, arr[i+1] - arr[i])
+        
+    return maxi
+        
+t = int(input())
+for _ in range(t):
+    n = int(input())
+    arr = list(map(int, input().split()))
+    if n == 1:
+        print(1)
+        continue
+    if n % 2 == 0:
+        print(checkMaxi(arr))
+    else:
+        best=  inf
+        for i in range(n):
+            best = min(best, checkMaxi(arr[:i] + arr[i+1:]))
+            
+        print(best)

Other_Tasks/CF2026_C_Action_Figures.cpp

@@ -0,0 +1,48 @@
+#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 main(){
+    int tc;
+    cin >> tc;
+    while (tc--){
+        int n;
+        cin >> n;
+        string s;
+        cin >> s;
+
+        priority_queue<int> pq;
+        ll cost = 0;
+        for (int i=n; i>0; i--){
+            if (s[i-1] == '1'){
+                pq.push(i);
+            }
+            else{
+                if (!pq.empty()){
+                    pq.pop();
+                }
+                cost += i;
+            }
+        }
+
+        vector<int> v;
+        while (!pq.empty()){
+            v.push_back(pq.top());
+            pq.pop();
+        }
+        for (int i=v.size()/2; i<v.size(); i++){
+            cost += v[i];
+        }
+        cout << cost << endl;
+    }
+
+    return 0;
+}

Other_Tasks/CF2026_D_Sums_of_Segments.cpp

@@ -0,0 +1,114 @@
+#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);
+
+template <typename T=ll>
+struct StaticSum {
+    const int n;
+    vector<T> pfs;  // arr[i] contains the range sum from 0 to i inclusively
+
+    T rsq(int l, int r) const {            // range sum from l to r inclusively
+        if (l < 0 || r >= n) assert(false);  // boundary condition check
+        if (l == 0) return pfs[r];
+        return (pfs[r] - pfs[l - 1]);
+    }
+
+    StaticSum(const vector<T>& arr) : n(arr.size()), pfs(arr) {
+        for (int i = 1; i < n; i++) {
+            pfs[i] += pfs[i - 1];
+        }
+    }
+};
+
+StaticSum<>* ss_brr_ptr;
+vector<ll> brr;
+vector<ll> segmentSums;              // segmentSums[i] = sum of all a[j][k] within the segment i
+int n;
+
+
+pair<ll, ll> getComponents(ll idx){
+    ll firstComponent = lower_bound(ss_brr_ptr->pfs.begin(), ss_brr_ptr->pfs.end(), idx) - ss_brr_ptr->pfs.begin();
+    ll secondComponent = (firstComponent == 0 ? idx : idx - ss_brr_ptr->pfs[firstComponent-1]) - 1;
+    return {firstComponent, secondComponent};
+}
+
+ll topOfSegment(ll segmentIdx, ll includedRows, StaticSum<>& ss_ss_arr, StaticSum<>& ss_arr){ // gets the first sum of the first includedRows of the segment Idx
+    ll ans = ss_ss_arr.rsq(0, segmentIdx+includedRows-1);
+    if (segmentIdx > 0){
+        ans -= ss_ss_arr.rsq(0, segmentIdx-1);
+        ans -= (ss_arr.rsq(0, segmentIdx-1)) * (includedRows);
+    }
+    return ans;
+}
+
+
+ll getUntil(ll idx, StaticSum<>& ss_ss_arr, StaticSum<>& ss_arr, StaticSum<>& ss_segmentSums){ // inclusive of this current one...
+    pair<ll, ll> components = getComponents(idx);
+    // cerr << "components: " << components.first << " " << components.second << endl;
+    ll ans = 0;
+    if (components.first == 0){
+        ans = topOfSegment(components.first, components.second+1, ss_ss_arr, ss_arr);
+    }
+    else{
+        ans = ss_segmentSums.rsq(0, components.first-1) + topOfSegment(components.first, components.second+1, ss_ss_arr, ss_arr);
+        // cerr << "top part " << topOfSegment(components.first, components.second+1, ss_ss_arr, ss_arr) << endl;
+    }
+    return ans;
+    
+}
+int main(){
+    cin >> n;
+    vector<ll> arr(n);
+    for (int i=0; i<n; i++){
+        cin >> arr[i];
+    }
+
+    StaticSum<> ss_arr(arr);
+    StaticSum<> ss_ss_arr(ss_arr.pfs);
+
+    segmentSums.assign(n, 0);
+    segmentSums[0] = ss_ss_arr.rsq(0, n-1); // sum of prefixes
+    for (int i=1; i<n; i++){
+        segmentSums[i] = segmentSums[i-1] - (n-i+1) * arr[i-1];
+    }
+    // cerr << "segmentSums: ";
+    // for (int i=0; i<n; i++){
+    //     cerr << segmentSums[i] << " ";
+    // }
+    // cerr << endl;
+    StaticSum<> ss_segmentSums(segmentSums);
+
+    assert(segmentSums[n-1] == arr[n-1]);
+
+    brr.assign(n, 0);
+    for (int i=0; i<n; i++){
+        brr[i] = n-i;
+    }
+    ss_brr_ptr = new StaticSum<>(brr);
+
+
+    int q;
+    cin >> q;
+    while (q--){
+        ll top, bottom;
+        cin >> top >> bottom;
+
+        if (top == 1){
+            cout << getUntil(bottom, ss_ss_arr, ss_arr, ss_segmentSums) << endl;
+        }
+        else{
+            cout << getUntil(bottom, ss_ss_arr, ss_arr, ss_segmentSums) - getUntil(top-1, ss_ss_arr, ss_arr, ss_segmentSums) << endl;
+        }
+    }
+
+
+
+
+    return 0;
+}