remove unused ir

codeforces/1050/2148b.cc

@@ -68,7 +68,7 @@ void solve() {
   for (auto &e : vert)
     cin >> e;
 
-  println("{}", n + m);
+  println("{}", m + n);
 }
 
 int main() { // {{{

codeforces/1050/2148f.cc

@@ -14,8 +14,9 @@ namespace rs = std::ranges;
 
 using namespace std;
 
-using i32 = int32_t;
+using i16 = int16_t;
 using u16 = uint16_t;
+using i32 = int32_t;
 using u32 = uint32_t;
 using i64 = int64_t;
 using u64 = uint64_t;
@@ -57,47 +58,45 @@ template <typename T> using vec = std::vector<T>;
 //  }}}
 
 void solve() {
-  u32 n;
+  u32 n, k;
   cin >> n;
 
-  vec<u16> a(n);
-  for (auto &e : a)
-    cin >> e;
-
-  vec<vec<u32>> f(200 + 1);
-  vec<vec<u32>> pref(200 + 1, vec<u32>(n + 1, 0));
-
-  u32 ans = 0;
-
-  for (u32 i = 1; i <= n; ++i) {
-    f[a[i - 1]].push_back(i);
-
-    for (u32 x = 1; x <= 200; ++x) {
-      pref[x][i] = pref[x][i - 1];
+  vec<vec<u32>> a(n);
+  u32 maxlen = 0;
+  for (u32 i = 0; i < n; ++i) {
+    cin >> k;
+    a[i].resize(k);
+    for (u32 j = 0; j < k; ++j) {
+      cin >> a[i][j];
     }
-
-    ans = max(ans, ++pref[a[i - 1]][i]);
+    maxlen = max(maxlen, k);
   }
 
-  for (u16 x = 1; x <= 200; ++x) {
-    for (u32 A = 1; A <= f[x].size() / 2; ++A) {
-      i32 l = f[x][A - 1] + 1;
-      i32 r = f[x][f[x].size() - A] - 1;
+  sort(all(a),
+       [](auto const &A, auto const &B) { return A.size() < B.size(); });
 
-      if (l > r) {
-        continue;
-      }
-
-      u32 B = 0;
-      for (u16 y = 1; y <= 200; ++y) {
-        B = max(B, pref[y][r] - pref[y][l - 1]);
-      }
-
-      ans = max(ans, 2 * A + B);
+  u32 index = 0;
+  for (u32 i = 0; i < maxlen;) {
+    while (i >= a[index].size()) {
+      ++index;
     }
+
+    u32 best = index;
+    for (u32 j = index + 1; j < n; ++j) {
+      if (lexicographical_compare(a[j].begin() + i, a[j].end(),
+                                  a[best].begin() + i, a[best].end())) {
+        best = j;
+      }
+    }
+
+    for (u32 j = i; j < a[best].size(); ++j) {
+      cout << a[best][j] << ' ';
+    }
+
+    i = a[best].size();
   }
 
-  println("{}", ans);
+  cout << '\n';
 }
 
 int main() { // {{{

codeforces/1050/abc042a.cc

@@ -14,6 +14,8 @@ namespace rs = std::ranges;
 
 using namespace std;
 
+using i16 = int16_t;
+using u16 = uint16_t;
 using i32 = int32_t;
 using u32 = uint32_t;
 using i64 = int64_t;
@@ -56,11 +58,9 @@ template <typename T> using vec = std::vector<T>;
 //  }}}
 
 void solve() {
-  u32 n;
-  cin >> n;
-
-  u32 ans = (n + 1) / 2 - 1;
-  println("{}", ans);
+  u32 a, b, c;
+  cin >> a >> b >> c;
+  YES();
 }
 
 int main() { // {{{
@@ -74,12 +74,7 @@ int main() { // {{{
   std::cin.tie(nullptr)->sync_with_stdio(false);
 #endif
 
-  u32 tc = 1;
-  std::cin >> tc;
-
-  for (u32 t = 0; t < tc; ++t) {
-    solve();
-  }
+  solve();
 
   return 0;
 }

codeforces/1050/io/2148a.cpout

@@ -4,6 +4,6 @@
 4
 
 [code]: 0
-[time]: 2.70 ms
+[time]: 2.80 ms
 [debug]: false
 [ok]: true

codeforces/1050/io/2148b.cpout

@@ -2,6 +2,6 @@
 3
 
 [code]: 0
-[time]: 2.45 ms
+[time]: 2.97 ms
 [debug]: false
 [ok]: true

codeforces/1050/io/2148f.1.cpin

@@ -0,0 +1,14 @@
+4
+1
+3 5 2 7
+2
+2 2 9
+3 3 1 4
+3
+1 5
+2 5 1
+2 5 2
+3
+3 4 4 9
+7 7 6 5 4 3 2 1
+4 2 4 5 1

codeforces/1050/io/2148f.1.cpout

@@ -0,0 +1,4 @@
+5 2 7 
+2 9 4 
+5 1 
+2 4 5 1 3 2 1

codeforces/634/1335b.cc

@@ -1,97 +0,0 @@
-#include <bits/stdc++.h> // {{{
-
-#include <version>
-#ifdef __cpp_lib_ranges_enumerate
-#include <ranges>
-namespace rv = std::views;
-namespace rs = std::ranges;
-#endif
-
-// https://codeforces.com/blog/entry/96344
-
-#pragma GCC optimize("O2,unroll-loops")
-#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
-
-using namespace std;
-
-using i32 = int32_t;
-using u32 = uint32_t;
-using i64 = int64_t;
-using u64 = uint64_t;
-using f64 = double;
-using f128 = long double;
-
-#if __cplusplus >= 202002L
-template <typename T> constexpr T MIN = std::numeric_limits<T>::min();
-
-template <typename T> constexpr T MAX = std::numeric_limits<T>::max();
-
-template <typename T> [[nodiscard]] static T sc(auto &&x) {
-  return static_cast<T>(x);
-}
-
-template <typename T> [[nodiscard]] static T sz(auto &&x) {
-  return static_cast<T>(x.size());
-}
-#endif
-
-static void NO() { std::cout << "NO\n"; }
-
-static void YES() { std::cout << "YES\n"; }
-
-template <typename T> using vec = std::vector<T>;
-
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define ff first
-#define ss second
-
-#ifdef LOCAL
-#define db(...) std::print(__VA_ARGS__)
-#define dbln(...) std::println(__VA_ARGS__)
-#else
-#define db(...)
-#define dbln(...)
-#endif
-//  }}}
-
-void solve() {
-  u32 n, a, b;
-  cin >> n >> a >> b;
-
-  string ans(n, 'a');
-
-  char c = 'a';
-  for (u32 i = a - 1, count = 0; count < b; ++count, --i) {
-    ans[i] = c;
-    ++c;
-  }
-
-  for (u32 i = a; i < n; ++i) {
-    ans[i] = ans[i - b];
-  }
-
-  println("{}", ans);
-}
-
-int main() { // {{{
-  std::cin.exceptions(std::cin.failbit);
-
-#ifdef LOCAL
-  std::cerr.rdbuf(std::cout.rdbuf());
-  std::cout.setf(std::ios::unitbuf);
-  std::cerr.setf(std::ios::unitbuf);
-#else
-  std::cin.tie(nullptr)->sync_with_stdio(false);
-#endif
-
-  u32 tc = 1;
-  std::cin >> tc;
-
-  for (u32 t = 0; t < tc; ++t) {
-    solve();
-  }
-
-  return 0;
-}
-// }}}

codeforces/634/1335c.cc

@@ -1,117 +0,0 @@
-#include <bits/stdc++.h> // {{{
-
-#include <version>
-#ifdef __cpp_lib_ranges_enumerate
-#include <ranges>
-namespace rv = std::views;
-namespace rs = std::ranges;
-#endif
-
-// https://codeforces.com/blog/entry/96344
-
-#pragma GCC optimize("O2,unroll-loops")
-#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
-
-using namespace std;
-
-using i32 = int32_t;
-using u32 = uint32_t;
-using i64 = int64_t;
-using u64 = uint64_t;
-using f64 = double;
-using f128 = long double;
-
-#if __cplusplus >= 202002L
-template <typename T> constexpr T MIN = std::numeric_limits<T>::min();
-
-template <typename T> constexpr T MAX = std::numeric_limits<T>::max();
-
-template <typename T> [[nodiscard]] static T sc(auto &&x) {
-  return static_cast<T>(x);
-}
-
-template <typename T> [[nodiscard]] static T sz(auto &&x) {
-  return static_cast<T>(x.size());
-}
-#endif
-
-static void NO() { std::cout << "NO\n"; }
-
-static void YES() { std::cout << "YES\n"; }
-
-template <typename T> using vec = std::vector<T>;
-
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define ff first
-#define ss second
-
-#ifdef LOCAL
-#define db(...) std::print(__VA_ARGS__)
-#define dbln(...) std::println(__VA_ARGS__)
-#else
-#define db(...)
-#define dbln(...)
-#endif
-//  }}}
-
-void solve() {
-  u32 n;
-  cin >> n;
-
-  vec<u32> a(n);
-  map<u32, u32> f;
-  for (auto &e : a) {
-    cin >> e;
-    ++f[e];
-  }
-
-  i32 l = 0, r = n / 2;
-
-  while (l <= r) {
-    i32 m = l + (r - l) / 2;
-
-    bool ok = false;
-    for (auto &[number, frequency] : f) {
-      if (frequency >= m) {
-        i32 rest = (i32)f.size() - (frequency == m);
-
-        if (rest >= m) {
-          ok = true;
-          break;
-        }
-      }
-    }
-
-    if (ok) {
-      l = m + 1;
-    } else {
-      r = m - 1;
-    }
-  }
-
-  println("{}", r);
-}
-
-int main() { // {{{
-  std::cin.exceptions(std::cin.failbit);
-
-#ifdef LOCAL
-  std::cerr.rdbuf(std::cout.rdbuf());
-  std::cout.setf(std::ios::unitbuf);
-  std::cerr.setf(std::ios::unitbuf);
-#else
-  std::cin.tie(nullptr)->sync_with_stdio(false);
-#endif
-
-  u32 tc = 1;
-  std::cin >> tc;
-
-  for (u32 t = 0; t < tc; ++t) {
-    solve();
-  }
-
-  return 0;
-}
-// }}}
-

codeforces/634/1335e1.cc

@@ -1,88 +0,0 @@
-#include <bits/stdc++.h> // {{{
-
-#include <version>
-#ifdef __cpp_lib_ranges_enumerate
-#include <ranges>
-namespace rv = std::views;
-namespace rs = std::ranges;
-#endif
-
-// https://codeforces.com/blog/entry/96344
-
-#pragma GCC optimize("O2,unroll-loops")
-#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
-
-using namespace std;
-
-using i32 = int32_t;
-using u32 = uint32_t;
-using i64 = int64_t;
-using u64 = uint64_t;
-using f64 = double;
-using f128 = long double;
-
-#if __cplusplus >= 202002L
-template <typename T> constexpr T MIN = std::numeric_limits<T>::min();
-
-template <typename T> constexpr T MAX = std::numeric_limits<T>::max();
-
-template <typename T> [[nodiscard]] static T sc(auto &&x) {
-  return static_cast<T>(x);
-}
-
-template <typename T> [[nodiscard]] static T sz(auto &&x) {
-  return static_cast<T>(x.size());
-}
-#endif
-
-static void NO() { std::cout << "NO\n"; }
-
-static void YES() { std::cout << "YES\n"; }
-
-template <typename T> using vec = std::vector<T>;
-
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define ff first
-#define ss second
-
-#ifdef LOCAL
-#define db(...) std::print(__VA_ARGS__)
-#define dbln(...) std::println(__VA_ARGS__)
-#else
-#define db(...)
-#define dbln(...)
-#endif
-//  }}}
-
-void solve() {
-  u32 n;
-  cin >> n;
-  vec<u32> a(n);
-  for (auto &e : a)
-    cin >> e;
-
-  cout << "hi\n";
-}
-
-int main() { // {{{
-  std::cin.exceptions(std::cin.failbit);
-
-#ifdef LOCAL
-  std::cerr.rdbuf(std::cout.rdbuf());
-  std::cout.setf(std::ios::unitbuf);
-  std::cerr.setf(std::ios::unitbuf);
-#else
-  std::cin.tie(nullptr)->sync_with_stdio(false);
-#endif
-
-  u32 tc = 1;
-  std::cin >> tc;
-
-  for (u32 t = 0; t < tc; ++t) {
-    solve();
-  }
-
-  return 0;
-}
-// }}}

codeforces/634/1335f.cc

@@ -1,91 +0,0 @@
-#include <bits/stdc++.h>  // {{{
-
-#include <version>
-#ifdef __cpp_lib_ranges_enumerate
-#include <ranges>
-namespace rv = std::views;
-namespace rs = std::ranges;
-#endif
-
-// https://codeforces.com/blog/entry/96344
-
-#pragma GCC optimize("O2,unroll-loops")
-#pragma GCC target("avx2,bmi,bmi2,lzcnt,popcnt")
-
-using namespace std;
-
-using i32 = int32_t;
-using u32 = uint32_t;
-using i64 = int64_t;
-using u64 = uint64_t;
-using f64 = double;
-using f128 = long double;
-
-#if __cplusplus >= 202002L
-template <typename T>
-constexpr T MIN = std::numeric_limits<T>::min();
-
-template <typename T>
-constexpr T MAX = std::numeric_limits<T>::max();
-
-template <typename T>
-[[nodiscard]] static T sc(auto&& x) {
-  return static_cast<T>(x);
-}
-
-template <typename T>
-[[nodiscard]] static T sz(auto&& x) {
-  return static_cast<T>(x.size());
-}
-#endif
-
-static void NO() {
-  std::cout << "NO\n";
-}
-
-static void YES() {
-  std::cout << "YES\n";
-}
-
-template <typename T>
-using vec = std::vector<T>;
-
-#define all(x) (x).begin(), (x).end()
-#define rall(x) (x).rbegin(), (x).rend()
-#define ff first
-#define ss second
-
-#ifdef LOCAL
-#define db(...) std::print(__VA_ARGS__)
-#define dbln(...) std::println(__VA_ARGS__)
-#else
-#define db(...)
-#define dbln(...)
-#endif
-//  }}}
-
-void solve() {
-  
-}
-
-int main() {  // {{{
-  std::cin.exceptions(std::cin.failbit);
-
-#ifdef LOCAL
-  std::cerr.rdbuf(std::cout.rdbuf());
-  std::cout.setf(std::ios::unitbuf);
-  std::cerr.setf(std::ios::unitbuf);
-#else
-  std::cin.tie(nullptr)->sync_with_stdio(false);
-#endif
-
-  u32 tc = 1;
-  std::cin >> tc;
-
-  for (u32 t = 0; t < tc; ++t) {
-    solve();
-  }
-
-  return 0;
-}
-// }}}

codeforces/634/io/1068.1.cpin

@@ -1 +0,0 @@
-3

codeforces/634/io/1068.1.cpout

@@ -1 +0,0 @@
-3 10 5 16 8 4 2 1

codeforces/634/io/1068.cpin

@@ -1 +0,0 @@
-3

codeforces/634/io/1068.cpout

@@ -1,5 +0,0 @@
-3
-[code]: 0
-[time]: 2.44 ms
-[debug]: false
-[ok]: false

codeforces/634/io/1068.expected

@@ -1 +0,0 @@
-3 10 5 16 8 4 2 1

codeforces/634/io/1069.1.cpin

@@ -1 +0,0 @@
-ATTCGGGA

codeforces/634/io/1069.1.cpout

@@ -1 +0,0 @@
-3

codeforces/634/io/1069.cpin

@@ -1 +0,0 @@
-ATTCGGGA

codeforces/634/io/1069.cpout

@@ -1,4 +0,0 @@
-
-[code]: 124 (TIMEOUT)
-[time]: 2001.50 ms
-[debug]: false

codeforces/634/io/1069.expected

@@ -1 +0,0 @@
-3

codeforces/634/io/1335e1.1.cpin

@@ -1,13 +0,0 @@
-6
-8
-1 1 2 2 3 2 1 1
-3
-1 3 3
-4
-1 10 10 1
-1
-26
-2
-2 1
-3
-1 1 1

codeforces/634/io/1335e1.1.cpout

@@ -1,6 +0,0 @@
-7
-2
-4
-1
-1
-3

codeforces/634/io/1335e1.cpin

@@ -1,13 +0,0 @@
-6
-8
-1 1 2 2 3 2 1 1
-3
-1 3 3
-4
-1 10 10 1
-1
-26
-2
-2 1
-3
-1 1 1

codeforces/634/io/1335e1.cpout

@@ -1,11 +0,0 @@
-hi
-hi
-hi
-hi
-hi
-hi
-
-[code]: 0
-[time]: 4.03 ms
-[debug]: false
-[ok]: false

codeforces/634/io/1335e1.expected

@@ -1,6 +0,0 @@
-7
-2
-4
-1
-1
-3

codeforces/634/io/1335e2.1.cpin

@@ -1,13 +0,0 @@
-6
-8
-1 1 2 2 3 2 1 1
-3
-1 3 3
-4
-1 10 10 1
-1
-26
-2
-2 1
-3
-1 1 1

codeforces/634/io/1335e2.1.cpout

@@ -1,6 +0,0 @@
-7
-2
-4
-1
-1
-3

codeforces/634/io/1335e2.cpin

@@ -1,13 +0,0 @@
-6
-8
-1 1 2 2 3 2 1 1
-3
-1 3 3
-4
-1 10 10 1
-1
-26
-2
-2 1
-3
-1 1 1

codeforces/634/io/1335e2.cpout

@@ -1,11 +0,0 @@
-7
-2
-4
-1
-1
-3
-
-[code]: 0
-[time]: 3.38 ms
-[debug]: false
-[ok]: true

codeforces/634/io/1335e2.expected

@@ -1,6 +0,0 @@
-7
-2
-4
-1
-1
-3

codeforces/634/io/1933a.1.cpin

@@ -1,17 +0,0 @@
-8
-3
--2 3 -3
-1
-0
-2
-0 1
-1
--99
-4
-10 -2 -3 7
-5
--1 -2 -3 -4 -5
-6
--41 22 -69 73 -15 -50
-12
-1 2 3 4 5 6 7 8 9 10 11 12

codeforces/634/io/1933a.1.cpout

@@ -1,8 +0,0 @@
-8
-0
-1
-99
-22
-15
-270
-78

codeforces/634/io/1933a.cpin

@@ -1,17 +0,0 @@
-8
-3
--2 3 -3
-1
-0
-2
-0 1
-1
--99
-4
-10 -2 -3 7
-5
--1 -2 -3 -4 -5
-6
--41 22 -69 73 -15 -50
-12
-1 2 3 4 5 6 7 8 9 10 11 12

codeforces/634/io/1933a.cpout

@@ -1,13 +0,0 @@
--2 3 -3 
-0 
-0 1 
--99 
-10 -2 -3 7 
--1 -2 -3 -4 -5 
--41 22 -69 73 -15 -50 
-1 2 3 4 5 6 7 8 9 10 11 12 
-
-[code]: 0
-[time]: 2.65 ms
-[debug]: false
-[matches]: false

codeforces/634/io/1933a.expected

@@ -1,8 +0,0 @@
-8
-0
-1
-99
-22
-15
-270
-78

codeforces/634/io/abc042a.cpin

@@ -1,3 +0,0 @@
-2
-5 5 7
-7 7 5

codeforces/634/io/abc042a.cpout

@@ -1,7 +0,0 @@
-17
-19
-
-[code]: 0
-[time]: 2.68 ms
-[debug]: false
-[ok]: false

codeforces/634/io/abc042a.expected

@@ -1,2 +0,0 @@
-YES
-NO