Add files via upload

Author: BrandonTang89

Other_Tasks/CF2056_A_Shape_Perimeter.py

@@ -0,0 +1,13 @@
+for  _ in range(int(input())):
+    n, m = map(int, input().split())
+    
+    totalX = 0
+    totalY = 0
+    
+    input()
+    for i in range(n-1):
+        x, y = map(int, input().split())
+        totalX += x
+        totalY += y
+        
+    print((totalX + m + totalY + m) * 2)

Other_Tasks/CF2056_B_Find_the_Permutation.py

@@ -0,0 +1,17 @@
+for _ in range(int(input())):
+    
+    n = int(input())
+    p = [-1] * n
+    
+    for pi in range(n):
+        row = list(input())
+        idx = 0
+        for pj in range(n):
+            if pi > pj and row[pj] == '1':
+                idx += 1
+            if pi < pj and row[pj] == '0':
+                idx += 1
+        p[idx] = pi + 1
+    
+    print(' '.join(map(str, p)))
+    

Other_Tasks/CF2056_C_Palindromic_Subsequences.py

@@ -0,0 +1,70 @@
+from itertools import combinations
+
+def is_palindrome(seq):
+    return seq == seq[::-1]
+
+def g(arr):
+    subsequences = []
+    for i in range(1, len(arr) + 1):
+        subsequences.extend(combinations(arr, i))
+
+    palindromic_subsequences = [seq for seq in subsequences if is_palindrome(seq)]
+
+    max_length = max(len(seq) for seq in palindromic_subsequences)
+    longest_palindromic_subsequences = [seq for seq in palindromic_subsequences if len(seq) == max_length]
+    count_longest_palindromic_subsequences = len(longest_palindromic_subsequences)
+
+    return count_longest_palindromic_subsequences
+
+for _ in range(int(input())):
+    n = int(input())
+    
+    if n == 6:
+        print("1 1 2 3 1 2")
+    elif n == 7:
+        print("1 1 2 1 3 2 2")
+    elif n == 8:
+        print("2 1 1 2 1 2 2 1")
+        
+    else:
+        if n % 2 == 0: # even case
+            # 3 4 5 6 ... (2 1 1 2 1 2 2 1) ... 5 6 3 4
+            arr = [0] * n
+            for i in range(0,(n-8) // 2, 2):
+                arr[i] = i + 3
+                arr[i + 1] = i + 4
+                
+                arr[n - i - 2] = i + 3
+                arr[n - i - 1] = i + 4
+                
+            arr[(n-8) // 2] = 2
+            arr[(n-8) // 2 + 1] = 1
+            arr[(n-8) // 2 + 2] = 1
+            arr[(n-8) // 2 + 3] = 2
+            arr[(n-8) // 2 + 4] = 1
+            arr[(n-8) // 2 + 5] = 2
+            arr[(n-8) // 2 + 6] = 2
+            arr[(n-8) // 2 + 7] = 1
+            
+        else:
+            # 3 4 5 6 ... (2 1 1 2 (n) 1 2 2 1) ... 5 6 3 4
+            arr = [0] * n
+            for i in range(0,(n-9) // 2, 2):
+                arr[i] = i + 3
+                arr[i + 1] = i + 4
+                
+                arr[n - i - 2] = i + 3
+                arr[n - i - 1] = i + 4
+            
+            arr[(n-9) // 2] = 2
+            arr[(n-9) // 2 + 1] = 1
+            arr[(n-9) // 2 + 2] = 1
+            arr[(n-9) // 2 + 3] = 2
+            arr[(n-9) // 2 + 4] = n
+            arr[(n-9) // 2 + 5] = 1
+            arr[(n-9) // 2 + 6] = 2
+            arr[(n-9) // 2 + 7] = 2
+            arr[(n-9) // 2 + 8] = 1
+            
+        print(' '.join(map(str, arr)))
+            

Other_Tasks/CF2056_D_Unique_Median.cpp

@@ -0,0 +1,56 @@
+#pragma GCC optimize("Ofast")
+#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;
+vector<ll> arr;
+ll bad_arr_at_x(int x) {
+    vector<ll> geX(n);
+    for (int i = 0; i < n; i++) geX[i] = (arr[i] >= x ? 1 : -1);
+    vector<ll> pfs(n);
+    pfs[0] = geX[0];
+    for (int i = 1; i < n; i++) pfs[i] = pfs[i - 1] + geX[i];
+
+    ll ans = 0;
+    int prevIdx = n;
+
+    unordered_map<ll, ll> mp;
+    for (int i = n - 1; i >= 0; i--) {
+        if (arr[i] == x) {
+            while (prevIdx > i){
+                prevIdx--;
+                mp[pfs[prevIdx]]++;
+            }
+        }
+
+        ll p = (i > 0 ? pfs[i-1] : 0);
+        ans += mp[p];
+    }
+    return ans;
+}
+int main() {
+    int tc;
+    cin >> tc;
+    while (tc--) {
+        cin >> n;
+        arr.resize(n);
+        for (int i = 0; i < n; i++) cin >> arr[i];
+
+        ll ans = 0;
+        for (int x = 1; x <= 10; x++) {
+            ans += bad_arr_at_x(x);
+        }
+
+        ll total = n + ((n-1)*n)/2LL;
+        cout << total - ans << endl;
+    }
+    return 0;
+}