Add some more problems and update TODO list

Codeforces Round 1061 (Div. 2)/D. Find the Last Number.cpp

@@ -0,0 +1,159 @@
+/* Problem URL: https://codeforces.com/contest/2156/problem/D */
+
+#include <bits/stdc++.h>
+#include <ext/pb_ds/assoc_container.hpp>
+#include <ext/pb_ds/tree_policy.hpp>
+
+using namespace std;
+using namespace __gnu_pbds;
+
+template <class T, class comp = less<>>
+using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (int i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (int i = s; i < (lim); i++)
+
+#define repv(i, v) for (auto &i : (v))
+#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
+#define sortv(v) sort(v.begin(), v.end())
+#define all(v) (v).begin(), (v).end()
+
+using vi = vector<int>;
+using vvi = vector<vi>;
+using vvvi = vector<vvi>;
+using vvvvi = vector<vvvi>;
+
+using ll = long long;
+
+using vl = vector<ll>;
+using vvl = vector<vl>;
+using vvvl = vector<vvl>;
+using vvvvl = vector<vvvl>;
+
+template<class v>
+auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
+    os << vec[0];
+    for (size_t i = 1; i < vec.size(); i++) {
+        os << ' ' << vec[i];
+    }
+    os << '\n';
+    return os;
+}
+
+template<class v>
+auto operator>>(istream &is, vector<v> &vec)->istream& {
+    for (auto &i : vec) {
+        is >> i;
+    }
+    return is;
+}
+
+template<class v>
+auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
+    for (auto &i : vec) {
+        os << i[0];
+        for (size_t j = 1; j < i.size(); j++) {
+            os << ' ' << i[j];
+        }
+        os << '\n';
+    }
+    return os;
+}
+
+template<class v>
+auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
+    for (auto &i : vec) {
+        for (auto &j : i) {
+            is >> j;
+        }
+    }
+    return is;
+}
+
+const int oo = INT32_MAX >> 1;
+const ll OO = INT64_MAX >> 1;
+
+
+void pre()
+{
+
+}
+
+#define TEST 1
+
+void solve()
+{
+    int n;
+    cin >> n;
+
+    int log = 32 - __builtin_clz(n);
+
+    set<int> cur;
+    rep(i, n - 1) {
+        cur.insert(i + 1);
+    }
+
+    set<int> all;
+    rep(i, n) {
+        all.insert(i + 1);
+    }
+
+    rep(i, log) {
+        vi ans(cur.size());
+        array<int, 2> val = {};
+
+        auto it = cur.begin();
+        rep(j, ans.size()) {
+            cout << "? " << *it << ' ' << (1 << i) << endl;
+            cin >> ans[j];
+            val[ans[j]]++;
+            it++;
+        }
+
+        array<int, 2> act = {};
+        repv(j, all) {
+            act[((j >> i) & 1)]++;
+        }
+
+        int tmp = act[1] != val[1];
+
+        auto itr = all.begin();
+        while (itr != all.end()) {
+            if (((*itr >> i) & 1) != tmp) {
+                itr = all.erase(itr);
+           } else {
+                itr++;
+           }
+        }
+
+        it = cur.begin();
+        rep(i, ans.size()) {
+            if (ans[i] == tmp) {
+                it++;
+            } else {
+                it = cur.erase(it);
+            }
+        }
+    }
+
+    cout << "! " << *all.begin() << endl;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    pre();
+
+    int t;
+    (TEST && cin >> t) || (t = 1);
+    while (t--) {
+        solve();
+    }
+}