Add files via upload

Author: BrandonTang89

Other_Tasks/CF2055_C_The_Trail.cpp

@@ -0,0 +1,68 @@
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>  
+using namespace std;
+
+typedef long long ll;
+
+int h, w;
+vector<vector<ll>> grid;
+int main(){
+    int tc;
+    cin >> tc;
+    while(tc--){
+        cin >> h >> w;
+        grid.assign(h, vector<ll>(w, 0));
+        vector<ll> rowSum(h, 0);
+        vector<ll> colSum(w, 0);
+
+        vector<char> path(w + h-1, '_'); // dummy char in the end
+        for (int i = 0; i< w + h - 2; i++){
+            cin >> path[i];
+        }
+
+        for (int i = 0; i < h; i++){
+            for (int j = 0; j < w; j++){
+                cin >> grid[i][j];
+                rowSum[i] += grid[i][j];
+                colSum[j] += grid[i][j];
+            }
+        }
+
+        int r = 0;
+        int c = 0;
+        int idx = 0;
+
+        while (idx < w + h - 1){
+            assert(r < h && c < w);
+            if (path[idx] == 'R'){ // we just care about the column
+                ll v = -colSum[c];
+                colSum[c] = 0;
+                rowSum[r] += v;
+
+                grid[r][c] = v;
+                c++;
+            }
+            else{
+                ll v = -rowSum[r];
+                rowSum[r] = 0;
+                colSum[c] += v;
+
+                grid[r][c] = v;
+                r++;
+            }
+            idx++;
+            
+        }
+
+        for (int i = 0; i < h; i++){
+            for (int j = 0; j < w; j++){
+                cout << grid[i][j] << " ";
+            }
+            cout << endl;
+        }
+
+    }
+
+    return 0;
+}

Other_Tasks/CF2055_D_Scarecrow.cpp

@@ -0,0 +1,60 @@
+// The main difficulty is in doing everything with the numbers multiplied by 2 to avoid having to deal with floating point numbers...
+#pragma GCC optimize("Ofast")
+#pragma GCC optimize("unroll-loops")
+#include <bits/stdc++.h>  
+using namespace std;
+
+typedef long long ll;
+int main(){
+    int tc;
+    cin >> tc;
+    while (tc--){
+        ll n, k, l;
+        cin >> n >> k >> l;
+
+        vector<ll> a(n);
+        for (int i = 0; i < n; i++){
+            cin >> a[i];
+            a[i] *= 2;
+        }
+        l *= 2;
+        k *= 2;
+
+        if (l == 0) {
+            cout << 0 << endl;
+            continue;
+        }
+
+        ll ans = a[0]; // two times the amount of time passed
+        ll pos = k; // two times the position of the crow
+
+        for (int i=1; i<n; i++){
+            if (pos >= l) break;
+            if (a[i] <= pos){
+                ll x =  min(pos, a[i] + ans);
+                pos = x + k;
+            }
+            else{
+                if (a[i] - pos <= ans){
+                    pos = pos + k;
+                }
+                else{
+                    ll y = a[i] - ans;
+                    assert( y % 2 == pos % 2);
+                    ll moveBy = (y - pos) / 2;
+                    ans += moveBy;
+                    pos = (y - moveBy) + k;
+
+                }
+            }
+        }
+
+        if (pos < l){
+            ans += l-pos;
+        }
+
+        cout << ans << endl;
+    }
+
+    return 0;
+}