Some AGC

Author: dolphingarlic

Atcoder/AGC 045-A.cpp

@@ -0,0 +1,47 @@
+#include <array>
+#include <cstring>
+#include <iostream>
+using namespace std;
+typedef long long ll;
+
+ll a[200], basis[60];
+
+bool in_span(ll val) {
+    for (int i = 59; ~i; i--)
+        if (val & (1ll << i)) val ^= basis[i];
+    return val == 0;
+}
+
+void add_vec(ll val) {
+    for (int i = 59; ~i; i--)
+        if (val & (1ll << i))
+            if (basis[i]) val ^= basis[i];
+            else {
+                basis[i] = val;
+                return;
+            }
+}
+
+int main() {
+    cin.tie(0)->sync_with_stdio(0);
+    int t;
+    cin >> t;
+    while (t--) {
+        int n;
+        cin >> n;
+        for (int i = 0; i < n; i++) cin >> a[i];
+        string s;
+        cin >> s;
+        memset(basis, 0, sizeof basis);
+        bool win = true;
+        for (int i = n - 1; ~i && win; i--) {
+            if (!in_span(a[i])) {
+                if (s[i] == '0')
+                    add_vec(a[i]);
+                else
+                    win = false;
+            }
+        }
+        cout << "10"[win] << '\n';
+    }
+}

Atcoder/AGC 055-B.cpp

@@ -0,0 +1,35 @@
+#include <iostream>
+#include <vector>
+using namespace std;
+
+char shift(char c, int offset) { return 'A' + ((c - 'A') + offset) % 3; }
+
+bool consec(vector<char>& v) {
+    return v.size() > 2 && v[v.size() - 3] == v.back() &&
+           v[v.size() - 2] == v.back();
+}
+
+int main() {
+    cin.tie(0)->sync_with_stdio(0);
+    int n;
+    cin >> n;
+    vector<char> stck[2];
+    for (int i : {0, 1}) {
+        char curr = '-';
+        for (int j = 0; j < n; j++) {
+            char c;
+            cin >> c;
+            c = shift(c, n - j);
+            stck[i].push_back(c);
+            if (consec(stck[i])) {
+                stck[i].pop_back();
+                stck[i].pop_back();
+                stck[i].pop_back();
+            }
+        }
+    }
+    if (stck[0] == stck[1])
+        cout << "YES";
+    else
+        cout << "NO";
+}