First commit

Author: QuickSorting

Codeforces Global Round 10/A.cpp

@@ -0,0 +1,28 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int t;
+    cin >> t;
+
+    while(t--){
+        int n;
+        cin >> n;
+
+        vector<int> a(n);
+        for(int i = 0; i < n; ++i)
+            cin >> a[i];
+
+        bool ok = true;
+        for(int i = 0; i < n - 1; ++i)
+            if(a[i] != a[i + 1])
+                ok = false;
+
+        if(ok) cout << n << "\n";
+        else cout << "1\n";
+    }
+}

Codeforces Global Round 10/B.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int t;
+    cin >> t;
+
+    while(t--){
+        int n;
+        long long k;
+        cin >> n >> k;
+
+        vector<int> a(n);
+        for(int i = 0; i < n; ++i)
+            cin >> a[i];
+
+        int mx = a[0], mn = a[0];
+        for(int i = 0; i < n; ++i){
+            mx = max(mx, a[i]);
+            mn = min(mn, a[i]);
+        }
+
+        if(k & 1){
+            for(int i = 0; i < n; ++i)
+                cout << mx - a[i] << " ";
+            cout << "\n";
+        }
+        else{
+            for(int i = 0; i < n; ++i)
+                cout << a[i] - mn << " ";
+            cout << "\n";
+        }
+    }
+}

Codeforces Global Round 10/C.cpp

@@ -0,0 +1,38 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int t;
+    cin >> t;
+
+    while(t--){
+        int n;
+        cin >> n;
+
+        vector<int> a(n);
+        for(int i = 0; i < n; ++i)
+            cin >> a[i];
+
+        long long ans = 0;
+        vector<pair<int, int>> nums;
+        nums.push_back({a[n - 1], 1});
+
+        for(int i = n - 2; i >= 0; --i){
+            int cnt = 1;
+            if(!nums.empty() && nums.back().first < a[i]){
+                ans += a[i] -  nums.back().first;
+                while(!nums.empty() && nums.back().first < a[i]){
+                    cnt += nums.back().second;
+                    nums.pop_back();
+                }
+            }
+            nums.push_back({a[i], cnt});
+        }
+
+        cout << ans << "\n";
+    }
+}

Codeforces Global Round 10/D.cpp

@@ -0,0 +1,74 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int k_N = 2e5 + 3;
+
+int n, iter;
+string s;
+pair<int, int> dp[k_N][4][4];
+
+int get_dp(int pos, int two, int last){
+    auto &[ans, solved] = dp[pos][two][last];
+    if(pos == n + 2) return 0;
+    if(solved == iter)
+        return ans;
+
+    solved = iter;
+    ans = k_N;
+
+    if(pos < n){
+        if(last != 0){
+            int new_last = (bool)(last & 2);
+            ans = get_dp(pos + 1, two, new_last) + (s[pos] != 'L');
+        }
+        if(last != 3){
+            int new_last = (bool)(last & 2) + 2;
+            ans = min(ans, get_dp(pos + 1, two, new_last) + (s[pos] != 'R'));
+        }
+    }
+    else if(pos == n){
+        int x = two & 1;
+        if(last == 3 && x == 1) ans = k_N;
+        else if(last == 0 && x == 0) ans = k_N;
+        else{
+            int new_last = (bool)(last & 2) + x * 2;
+            ans = get_dp(pos + 1, two, new_last);
+        } 
+    }
+    else if(pos == n + 1){
+        int x = (bool)(two & 2);
+        if(last == 3 && x == 1) ans = k_N;
+        else if(last == 0 && x == 0) ans = k_N;
+        else{
+            int new_last = (bool)(last & 2) + x * 2;
+            ans = get_dp(pos + 1, two, new_last);
+        }
+    }
+
+    return ans;
+}
+
+void solve(){
+    cin >> n >> s;
+    int ans = k_N;
+    for(int i = 0; i < 4; ++i){
+        int sum = 0;
+        if(s[0] == 'R' != ((bool)(i & 1)))
+            sum++;
+        if(s[1] == 'R' != ((bool)(i & 2)))
+            sum++;
+        ans = min(ans, get_dp(2, i, i) + sum);
+    }
+    cout << ans << "\n";
+}
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int t;
+    cin >> t;
+
+    for(iter = 1; iter <= t; ++iter) solve();
+}

Codeforces Global Round 10/E.cpp

@@ -0,0 +1,62 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const int k_N = 25 + 3;
+
+long long a[k_N][k_N];
+
+int main(){
+    int n;
+    cin >> n;
+
+    for(int i = 1; i <= 2 * n - 1; ++i){
+        int x, y;
+        if(i <= n) x = i, y = 1;
+        else x = n, y = i - (n - 1);
+
+        int cnt = 0;
+        while(x >= 1 && y <= n){
+            //cout << x << " " << y << " x y" << endl;
+            //cout << cnt << " cnt" << endl;
+            if(cnt & 1) a[x][y] = (1ll << (i - 1));
+            else a[x][y] = 0;
+            x--, y++;
+            cnt++;
+        }
+    }
+
+    for(int i = 1; i <= n; ++i){
+        for(int j = 1; j <= n; ++j)
+            cout << a[i][j] << " ";
+        cout << "\n";
+        fflush(stdout);
+    }
+
+    int q;
+    cin >> q;
+
+    while(q--){
+        long long k;
+        cin >> k;
+
+        int cnt = 1;
+        int x = 1, y = 1;
+        while(x != n || y != n){
+            cout << x << " " << y << "\n";
+            fflush(stdout);
+
+            if(x == n) y++;
+            else if(y == n) x++;
+            else{
+                long long t = (1ll << cnt) & k;
+                //cout << t << " t" << "\n";
+                if(a[x + 1][y] == t) x++;
+                else y++;
+            }
+            cnt++;
+        }
+        cout << x << " " << y << "\n";
+        fflush(stdout);
+    }
+}

Codeforces Global Round 10/F.cpp

@@ -0,0 +1,53 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+const long long k_H = 1e12;
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    long long n;
+    cin >> n;
+
+    long long sum = 0;
+    vector<long long> h(n);
+    for(int i = 0; i < n; ++i){
+        cin >> h[i];
+        sum += h[i];
+    }
+
+    long long l = 0, r = k_H;
+    while(l != r){
+        long long mid = (l + r) >> 1;
+        if(mid * n + n * (n - 1) / 2 >= sum) r = mid;
+        else l = mid + 1;
+    } 
+
+    h[0] = l;
+    sum -= h[0];
+    bool pr = false;
+    for(int i = 1; i < n; ++i){
+        if(pr){
+            h[i] = h[i - 1] + 1;
+            sum -= h[i];
+            pr = false;
+            continue;
+        }
+        if(h[i - 1] * (n - i) + (n - i - 1) * (n - i) / 2 >= sum){
+            h[i] = h[i - 1];
+            sum -= h[i];
+            pr = true;
+        }
+        else{
+            h[i] = h[i - 1] + 1;
+            sum -= h[i];
+            pr = false;
+        }
+    }
+
+    for(int i = 0; i < n; ++i)
+        cout << h[i] << " ";
+    cout << "\n";
+}

Codeforces Global Round 10/G.cpp

@@ -0,0 +1,8 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+}

Codeforces Global Round 10/H.cpp

@@ -0,0 +1,8 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+}

Codeforces Global Round 10/I.cpp

@@ -0,0 +1,8 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+}

Codeforces Global Round 8/A.cpp

@@ -0,0 +1,51 @@
+#include <bits/stdc++.h>
+
+using namespace std;
+
+int main(){
+    ios::sync_with_stdio(false);
+    cin.tie(NULL);
+
+    int t;
+    cin >> t;
+
+    while(t--){
+        long long a, b, n;
+        cin >> a >> b >> n;
+
+        if(a < b)
+            swap(a, b);
+
+        long long ans_even = 0, ans_odd = 0;
+        long long new_a, new_b;
+
+        new_a = a;
+        new_b = b;
+        while(new_a <= n){
+            new_b += new_a;
+            new_a += new_b;
+            ans_even += 2;
+        }
+
+        new_a = a;
+        new_b = b;
+        while(new_a <= n){
+            if(ans_odd >= ans_even - 2){
+                new_a += new_b;
+                if(new_a <= n){
+                    ans_odd += 3;
+                    break;
+                }
+                else{
+                    ans_odd++;
+                    break;
+                }
+            }
+            new_b += new_a;
+            new_a += new_b;
+            ans_odd += 2;
+        }
+
+        cout << min(ans_even, ans_odd) << "\n";
+    }
+}