Add a bunch of other problems.

Some are not finished...

Codeforces Round 998 (Div. 3)/B. Farmer John's Card Game.cpp

@@ -0,0 +1,130 @@
+/* Problem URL: https://codeforces.com/contest/2060/problem/B */
+
+#include <bits/stdc++.h>
+
+using namespace std;
+
+#define V vector
+
+#define rmin(a, b) a = min(a, b)
+#define rmax(a, b) a = max(a, b)
+
+#define rep(i, lim) for (size_t i = 0; i < (lim); i++)
+#define nrep(i, s, lim) for (size_t 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;
+}
+
+int main()
+{
+    ios::sync_with_stdio(false);
+    cin.tie(nullptr);
+
+    int t;
+    cin >> t;
+    while (t--) {
+        int n, m;
+        cin >> n >> m;
+        
+        priority_queue<pair<int, int>, V<pair<int, int>>, greater<>> pq;
+
+        rep(i, n) {
+            rep(j, m) {
+                int card;
+                cin >> card;
+
+                pq.emplace(card, i);
+            }
+        }
+
+        vi played(n, -1);
+
+        bool pos = true;
+        for (size_t j = 0; j < m && pos; j++) {
+            for (size_t i = 0; i < n; i++) {
+                auto [card, cow] = pq.top();
+                pq.pop();
+
+                if (played[cow] == -1) {
+                    played[cow] = i;
+                    continue;
+                }
+
+                if (played[cow] != i) {
+                    pos = false;
+                    break;
+                }
+            }
+        }
+
+        if (pos) {
+            priority_queue<pair<int, int>, V<pair<int, int>>, greater<>> ord;
+
+            rep(i, n) {
+                ord.emplace(played[i], i + 1);
+            }
+
+            while (!ord.empty()) {
+                cout << ord.top().second << ' ';
+                ord.pop();
+            }
+            cout << '\n';
+        } else {
+            cout << "-1\n";
+        }
+    }
+}