Problem p02618 (C++) — buggy submission, verdict: Runtime Error

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = 3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for (ll i = (n); i--;)
#define rrep2(i, n) for (ll i = (n); i--;)
#define rrep3(i, a, b) for (ll i = (b); i-- > (a);)
#define rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...)                                                              \\
  overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define each(...) overload4(__VA_ARGS__, each3, each2, each1)(__VA_ARGS__)
#define all1(i) begin(i), end(i)
#define all2(i, a) begin(i), begin(i) + a
#define all3(i, a, b) begin(i) + a, begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define rall1(i) (i).rbegin(), (i).rend()
#define rall2(i, k) (i).rbegin(), (i).rbegin() + k
#define rall3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rall(...) overload3(__VA_ARGS__, rall3, rall2, rall1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(all(__VA_ARGS__), 0.0L)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define LL(...)                                                                \\
  ll __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define ULL(...)                                                               \\
  ull __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define STR(...)                                                               \\
  string __VA_ARGS__;                                                          \\
  in(__VA_ARGS__)
#define CHR(...)                                                               \\
  char __VA_ARGS__;                                                            \\
  in(__VA_ARGS__)
#define DBL(...)                                                               \\
  double __VA_ARGS__;                                                          \\
  in(__VA_ARGS__)
#define LD(...)                                                                \\
  ld __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a)                                                                \\
  sort(all(a));                                                                \\
  a.erase(unique(all(a)), end(a))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size)                                                  \\
  vector<type> name(size);                                                     \\
  in(name)
#define vv(type, name, h, ...)                                                 \\
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w)                                                   \\
  vector<vector<type>> name(h, vector<type>(w));                               \\
  in(name)
#define vvv(type, name, h, w, ...)                                             \\
  vector<vector<vector<type>>> name(                                           \\
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
template <class T> auto min(const T &a) { return *min_element(all(a)); }
template <class T> auto max(const T &a) { return *max_element(all(a)); }
inline ll popcnt(ull a) { return __builtin_popcountll(a); }
ll gcd(ll a, ll b) {
  while (b) {
    ll c = b;
    b = a % b;
    a = c;
  }
  return a;
}
ll lcm(ll a, ll b) {
  if (!a || !b)
    return 0;
  return a * b / gcd(a, b);
}
ll intpow(ll a, ll b) {
  ll ans = 1;
  while (b) {
    if (b & 1)
      ans *= a;
    a *= a;
    b /= 2;
  }
  return ans;
}
ll modpow(ll a, ll b, ll p) {
  ll ans = 1;
  while (b) {
    if (b & 1)
      (ans *= a) %= p;
    (a *= a) %= p;
    b /= 2;
  }
  return ans;
}
template <class T, class U> bool chmin(T &a, const U &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T, class U> bool chmax(T &a, const U &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
vector<ll> iota(ll n) {
  vector<ll> a(n);
  iota(a.begin(), a.end(), 0);
  return a;
}
vector<pll> factor(ull x) {
  vector<pll> ans;
  for (ll i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ans.push_back({i, 1});
      while ((x /= i) % i == 0)
        ans.back().second++;
    }
  if (x != 1)
    ans.push_back({x, 1});
  return ans;
}
map<ll, ll> factor_map(ull x) {
  map<ll, ll> ans;
  for (ll i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ans[i] = 1;
      while ((x /= i) % i == 0)
        ans[i]++;
    }
  if (x != 1)
    ans[x] = 1;
  return ans;
}
vector<uint> divisor(uint x) {
  vector<uint> ans;
  for (uint i = 1; i * i <= x; i++)
    if (x % i == 0)
      ans.push_back(i);
  rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
  return ans;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
  auto b = a;
  sort(all(b));
  b.erase(unique(all(b)), b.end());
  unordered_map<T, ll> ans;
  rep(b.size()) ans[b[i]] = i;
  each(i, a) i = ans[i];
  return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
  auto b = a;
  sort(all(b));
  b.erase(unique(all(b)), b.end());
  map<T, ll> ans;
  rep(b.size()) ans[b[i]] = i;
  each(i, a) i = ans[i];
  return ans;
}
int scan() { return getchar(); }
void scan(int &a) { scanf("%d", &a); }
void scan(unsigned &a) { scanf("%u", &a); }
void scan(long &a) { scanf("%ld", &a); }
void scan(long long &a) { scanf("%lld", &a); }
void scan(unsigned long long &a) { scanf("%llu", &a); }
void scan(char &a) {
  do {
    a = getchar();
  } while (a == ' ' || a == '\\n');
}
void scan(float &a) { scanf("%f", &a); }
void scan(double &a) { scanf("%lf", &a); }
void scan(long double &a) { scanf("%Lf", &a); }
void scan(vector<bool> &a) {
  for (unsigned i = 0; i < a.size(); i++) {
    int b;
    scan(b);
    a[i] = b;
  }
}
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T> void scan(deque<T> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
  scan(p.first);
  scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
  for (auto &&i : a)
    scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
  scan(head);
  in(tail...);
}
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(long long a) { printf("%lld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(char a[]) { printf("%s", a); }
void print(const char a[]) { printf("%s", a); }
void print(float a) { printf("%.15f", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string &a) {
  for (auto &&i : a)
    print(i);
}
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {
  if (a.empty())
    return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T> void print(const deque<T> &a) {
  if (a.empty())
    return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T, size_t size> void print(const array<T, size> &a) {
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T, class L> void print(const pair<T, L> &p) {
  print(p.first);
  putchar(' ');
  print(p.second);
}
template <class T, size_t size> void print(const T (&a)[size]) {
  print(a[0]);
  for (auto i = a; ++i != end(a);) {
    putchar(' ');
    print(*i);
  }
}
template <class T> void print(const T &a) { cout << a; }
int out() {
  putchar('\\n');
  return 0;
}
template <class T> int out(const T &t) {
  print(t);
  putchar('\\n');
  return 0;
}
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
  print(head);
  putchar(' ');
  out(tail...);
  return 0;
}
#ifdef DEBUG
inline ll __lg(ull __n) {
  return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n);
}
#define debug(...)                                                             \\
  {                                                                            \\
    print(#__VA_ARGS__);                                                       \\
    print(":");                                                                \\
    out(__VA_ARGS__);                                                          \\
  }
#else
#define debug(...) void(0)
#endif
int first(bool i = true) { return out(i ? "first" : "second"); }
int yes(bool i = true) { return out(i ? "yes" : "no"); }
int Yes(bool i = true) { return out(i ? "Yes" : "No"); }
int No() { return out("No"); }
int YES(bool i = true) { return out(i ? "YES" : "NO"); }
int NO() { return out("NO"); }
int Yay(bool i = true) { return out(i ? "Yay!" : ":("); }
int possible(bool i = true) { return out(i ? "possible" : "impossible"); }
int Possible(bool i = true) { return out(i ? "Possible" : "Impossible"); }
int POSSIBLE(bool i = true) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
void Case(ll i) { printf("Case #%lld: ", i); }

random_device RD;
struct Xorshift64 {
  using result_type = uint32_t;
  static constexpr result_type min() { return 0; }
  static constexpr result_type max() { return -1; }
  uint64_t x = RD();
  result_type operator()() {
    x = x ^ (x << 13);
    x = x ^ (x >> 7);
    x = x ^ (x << 17);
    return static_cast<uint32_t>(x);
  }
} rnd;
#ifdef DEBUG
int d;
#else
const int d = 365;
#endif
int cnt = 0;
int c[26];
int s[365][26];
int ans[365];
int score = 0, max_score = 0;
vector<int16_t> contest[26];

inline auto add(int day, int i) {
  const int p = lower_bound(all(contest[i]), day) - contest[i].begin();
  contest[i].insert(contest[i].begin() + p, day);
  const int pre = contest[i][p - 1], nxt = contest[i][p + 1];
  score += s[day][i];
  const int d = nxt - pre, d1 = nxt - day, d2 = day - pre;
  score += c[i] * (d * (d - 1) - d1 * (d1 - 1) - d2 * (d2 - 1)) / 2;
  return p;
}
inline auto rem(int day, int i) {
  const int p = lower_bound(all(contest[i]), day) - contest[i].begin();
  const int pre = contest[i][p - 1], nxt = contest[i][p + 1];
  contest[i].erase(contest[i].begin() + p);
  score -= s[day][i];
  const int d = nxt - pre, d1 = nxt - day, d2 = day - pre;
  score -= c[i] * (d * (d - 1) - d1 * (d1 - 1) - d2 * (d2 - 1)) / 2;
  return p;
}
inline void add2(int day, int i, int p) {
  contest[i].insert(contest[i].begin() + p, day);
}
inline void rem2(int day, int i, int p) {
  contest[i].erase(contest[i].begin() + p);
}
inline auto inc(int day, int i) {
  const auto p = lower_bound(all(contest[i]), day) - contest[i].begin();
  const int pre = contest[i][p - 1], nxt = contest[i][p + 1];
  score += s[day + 1][i] - s[day][i];
  const int d1 = nxt - day, d2 = day - pre;
  score += c[i] * (d1 - 1 - d2);
  contest[i][p]++;
  return p;
}
inline auto dec(int day, int i) {
  const auto p = lower_bound(all(contest[i]), day) - contest[i].begin();
  const int pre = contest[i][p - 1], nxt = contest[i][p + 1];
  score += s[day - 1][i] - s[day][i];
  const int d1 = nxt - day, d2 = day - pre;
  score += c[i] * (d2 - 1 - d1);
  contest[i][p]--;
  return p;
}
inline void inc2(int i, int p) { contest[i][p]++; }
inline void dec2(int i, int p) { contest[i][p]--; }
signed main() {
  using namespace std::chrono;
  auto start = system_clock::now();
#ifdef DEBUG
  in(d);
#else
  while (getchar() != '\\n')
    ;
#endif
  in(c);
  rep(d) in(s[i]);
  each(i, contest) {
    i.reserve(32);
    i.push_back(-1);
  }
  rep(d) {
    int j = 0, mx = 0;
    rep(j_, 26) if (chmax(mx, s[i][j_] + (i - contest[j_].back()) * c[j_])) j =
        j_;
    ans[i] = j;
    score += s[i][j];
    contest[j].push_back(i);
    rep(j, 26) score -= (i - contest[j].back()) * c[j];
  }
  each(i, contest) i.push_back(d);
  int t = 0, l = (2'000'000 - t) / 40'000;
#ifdef DEBUG
  rep(_, 1000000) {
#else
  while (t < 1'986'000) {
#endif
    rep(20) {
      if (rnd() & 1) {
        const int day = rnd() % d, to = rnd() % 26;
        if (ans[day] == to)
          continue;
        const int prev_score = score;
        auto p1 = rem(day, ans[day]);
        auto p2 = add(day, to);
        chmax(max_score, score);
        if (score < max_score - l) {
          add2(day, ans[day], p1);
          rem2(day, to, p2);
          score = prev_score;
        } else
          ans[day] = to;
      } else {
        const int day = rnd() % (d - 1);
        if (ans[day] == ans[day + 1])
          continue;
        const int prev_score = score;
        auto p1 = inc(day, ans[day]);
        auto p2 = dec(day + 1, ans[day + 1]);
        chmax(max_score, score);
        if (score < max_score - l) {
          dec2(ans[day], p1);
          inc2(ans[day + 1], p2);
          score = prev_score;
        } else
          swap(ans[day], ans[day + 1]);
      }
    }
    t = duration_cast<microseconds>(system_clock::now() - start).count();
    l = (2'000'000 - t) / 10'000;
  }
  rep(d) out(ans[i] + 1);
#ifdef DEBUG
  out(cnt);
#endif
}

Error: WA

Fixed submission:

#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using ld = long double;
using ull = unsigned long long;
using uint = unsigned;
using pcc = pair<char, char>;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using pdd = pair<double, double>;
using tuplis = array<ll, 3>;
template <class T> using pq = priority_queue<T, vector<T>, greater<T>>;
const ll LINF = 0x1fffffffffffffff;
const ll MINF = 0x7fffffffffff;
const int INF = 0x3fffffff;
const int MOD = 1000000007;
const int MODD = 998244353;
const ld DINF = numeric_limits<ld>::infinity();
const ld EPS = 1e-9;
const ld PI = 3.1415926535897932;
const ll dx[] = {0, 1, 0, -1, 1, -1, 1, -1};
const ll dy[] = {1, 0, -1, 0, 1, 1, -1, -1};
#define overload4(_1, _2, _3, _4, name, ...) name
#define overload3(_1, _2, _3, name, ...) name
#define rep1(n) for (ll i = 0; i < n; ++i)
#define rep2(i, n) for (ll i = 0; i < n; ++i)
#define rep3(i, a, b) for (ll i = a; i < b; ++i)
#define rep4(i, a, b, c) for (ll i = a; i < b; i += c)
#define rep(...) overload4(__VA_ARGS__, rep4, rep3, rep2, rep1)(__VA_ARGS__)
#define rrep1(n) for (ll i = (n); i--;)
#define rrep2(i, n) for (ll i = (n); i--;)
#define rrep3(i, a, b) for (ll i = (b); i-- > (a);)
#define rrep4(i, a, b, c) for (ll i = a + (b - a - 1) / c * c; i >= a; i -= c)
#define rrep(...)                                                              \\
  overload4(__VA_ARGS__, rrep4, rrep3, rrep2, rrep1)(__VA_ARGS__)
#define each1(i, a) for (auto &&i : a)
#define each2(x, y, a) for (auto &&[x, y] : a)
#define each3(x, y, z, a) for (auto &&[x, y, z] : a)
#define each(...) overload4(__VA_ARGS__, each3, each2, each1)(__VA_ARGS__)
#define all1(i) begin(i), end(i)
#define all2(i, a) begin(i), begin(i) + a
#define all3(i, a, b) begin(i) + a, begin(i) + b
#define all(...) overload3(__VA_ARGS__, all3, all2, all1)(__VA_ARGS__)
#define rall1(i) (i).rbegin(), (i).rend()
#define rall2(i, k) (i).rbegin(), (i).rbegin() + k
#define rall3(i, a, b) (i).rbegin() + a, (i).rbegin() + b
#define rall(...) overload3(__VA_ARGS__, rall3, rall2, rall1)(__VA_ARGS__)
#define sum(...) accumulate(all(__VA_ARGS__), 0LL)
#define dsum(...) accumulate(all(__VA_ARGS__), 0.0L)
#define elif else if
#define unless(a) if (!(a))
#define mp make_pair
#define mt make_tuple
#define INT(...)                                                               \\
  int __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define LL(...)                                                                \\
  ll __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define ULL(...)                                                               \\
  ull __VA_ARGS__;                                                             \\
  in(__VA_ARGS__)
#define STR(...)                                                               \\
  string __VA_ARGS__;                                                          \\
  in(__VA_ARGS__)
#define CHR(...)                                                               \\
  char __VA_ARGS__;                                                            \\
  in(__VA_ARGS__)
#define DBL(...)                                                               \\
  double __VA_ARGS__;                                                          \\
  in(__VA_ARGS__)
#define LD(...)                                                                \\
  ld __VA_ARGS__;                                                              \\
  in(__VA_ARGS__)
#define Sort(a) sort(all(a))
#define Rev(a) reverse(all(a))
#define Uniq(a)                                                                \\
  sort(all(a));                                                                \\
  a.erase(unique(all(a)), end(a))
#define vec(type, name, ...) vector<type> name(__VA_ARGS__)
#define VEC(type, name, size)                                                  \\
  vector<type> name(size);                                                     \\
  in(name)
#define vv(type, name, h, ...)                                                 \\
  vector<vector<type>> name(h, vector<type>(__VA_ARGS__))
#define VV(type, name, h, w)                                                   \\
  vector<vector<type>> name(h, vector<type>(w));                               \\
  in(name)
#define vvv(type, name, h, w, ...)                                             \\
  vector<vector<vector<type>>> name(                                           \\
      h, vector<vector<type>>(w, vector<type>(__VA_ARGS__)))
template <class T> auto min(const T &a) { return *min_element(all(a)); }
template <class T> auto max(const T &a) { return *max_element(all(a)); }
inline ll popcnt(ull a) { return __builtin_popcountll(a); }
ll gcd(ll a, ll b) {
  while (b) {
    ll c = b;
    b = a % b;
    a = c;
  }
  return a;
}
ll lcm(ll a, ll b) {
  if (!a || !b)
    return 0;
  return a * b / gcd(a, b);
}
ll intpow(ll a, ll b) {
  ll ans = 1;
  while (b) {
    if (b & 1)
      ans *= a;
    a *= a;
    b /= 2;
  }
  return ans;
}
ll modpow(ll a, ll b, ll p) {
  ll ans = 1;
  while (b) {
    if (b & 1)
      (ans *= a) %= p;
    (a *= a) %= p;
    b /= 2;
  }
  return ans;
}
template <class T, class U> bool chmin(T &a, const U &b) {
  if (a > b) {
    a = b;
    return 1;
  }
  return 0;
}
template <class T, class U> bool chmax(T &a, const U &b) {
  if (a < b) {
    a = b;
    return 1;
  }
  return 0;
}
vector<ll> iota(ll n) {
  vector<ll> a(n);
  iota(a.begin(), a.end(), 0);
  return a;
}
vector<pll> factor(ull x) {
  vector<pll> ans;
  for (ll i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ans.push_back({i, 1});
      while ((x /= i) % i == 0)
        ans.back().second++;
    }
  if (x != 1)
    ans.push_back({x, 1});
  return ans;
}
map<ll, ll> factor_map(ull x) {
  map<ll, ll> ans;
  for (ll i = 2; i * i <= x; i++)
    if (x % i == 0) {
      ans[i] = 1;
      while ((x /= i) % i == 0)
        ans[i]++;
    }
  if (x != 1)
    ans[x] = 1;
  return ans;
}
vector<uint> divisor(uint x) {
  vector<uint> ans;
  for (uint i = 1; i * i <= x; i++)
    if (x % i == 0)
      ans.push_back(i);
  rrep(ans.size() - (ans.back() * ans.back() == x)) ans.push_back(x / ans[i]);
  return ans;
}
template <class T> unordered_map<T, ll> press(vector<T> &a) {
  auto b = a;
  sort(all(b));
  b.erase(unique(all(b)), b.end());
  unordered_map<T, ll> ans;
  rep(b.size()) ans[b[i]] = i;
  each(i, a) i = ans[i];
  return ans;
}
template <class T> map<T, ll> press_map(vector<T> &a) {
  auto b = a;
  sort(all(b));
  b.erase(unique(all(b)), b.end());
  map<T, ll> ans;
  rep(b.size()) ans[b[i]] = i;
  each(i, a) i = ans[i];
  return ans;
}
int scan() { return getchar(); }
void scan(int &a) { scanf("%d", &a); }
void scan(unsigned &a) { scanf("%u", &a); }
void scan(long &a) { scanf("%ld", &a); }
void scan(long long &a) { scanf("%lld", &a); }
void scan(unsigned long long &a) { scanf("%llu", &a); }
void scan(char &a) {
  do {
    a = getchar();
  } while (a == ' ' || a == '\\n');
}
void scan(float &a) { scanf("%f", &a); }
void scan(double &a) { scanf("%lf", &a); }
void scan(long double &a) { scanf("%Lf", &a); }
void scan(vector<bool> &a) {
  for (unsigned i = 0; i < a.size(); i++) {
    int b;
    scan(b);
    a[i] = b;
  }
}
void scan(char a[]) { scanf("%s", a); }
void scan(string &a) { cin >> a; }
template <class T> void scan(vector<T> &);
template <class T, size_t size> void scan(array<T, size> &);
template <class T, class L> void scan(pair<T, L> &);
template <class T, size_t size> void scan(T (&)[size]);
template <class T> void scan(vector<T> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T> void scan(deque<T> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T, size_t size> void scan(array<T, size> &a) {
  for (auto &&i : a)
    scan(i);
}
template <class T, class L> void scan(pair<T, L> &p) {
  scan(p.first);
  scan(p.second);
}
template <class T, size_t size> void scan(T (&a)[size]) {
  for (auto &&i : a)
    scan(i);
}
template <class T> void scan(T &a) { cin >> a; }
void in() {}
template <class Head, class... Tail> void in(Head &head, Tail &...tail) {
  scan(head);
  in(tail...);
}
void print() { putchar(' '); }
void print(bool a) { printf("%d", a); }
void print(int a) { printf("%d", a); }
void print(unsigned a) { printf("%u", a); }
void print(long a) { printf("%ld", a); }
void print(long long a) { printf("%lld", a); }
void print(unsigned long long a) { printf("%llu", a); }
void print(char a) { printf("%c", a); }
void print(char a[]) { printf("%s", a); }
void print(const char a[]) { printf("%s", a); }
void print(float a) { printf("%.15f", a); }
void print(double a) { printf("%.15f", a); }
void print(long double a) { printf("%.15Lf", a); }
void print(const string &a) {
  for (auto &&i : a)
    print(i);
}
template <class T> void print(const vector<T> &);
template <class T, size_t size> void print(const array<T, size> &);
template <class T, class L> void print(const pair<T, L> &p);
template <class T, size_t size> void print(const T (&)[size]);
template <class T> void print(const vector<T> &a) {
  if (a.empty())
    return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T> void print(const deque<T> &a) {
  if (a.empty())
    return;
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T, size_t size> void print(const array<T, size> &a) {
  print(a[0]);
  for (auto i = a.begin(); ++i != a.end();) {
    putchar(' ');
    print(*i);
  }
}
template <class T, class L> void print(const pair<T, L> &p) {
  print(p.first);
  putchar(' ');
  print(p.second);
}
template <class T, size_t size> void print(const T (&a)[size]) {
  print(a[0]);
  for (auto i = a; ++i != end(a);) {
    putchar(' ');
    print(*i);
  }
}
template <class T> void print(const T &a) { cout << a; }
int out() {
  putchar('\\n');
  return 0;
}
template <class T> int out(const T &t) {
  print(t);
  putchar('\\n');
  return 0;
}
template <class Head, class... Tail>
int out(const Head &head, const Tail &...tail) {
  print(head);
  putchar(' ');
  out(tail...);
  return 0;
}
#ifdef DEBUG
inline ll __lg(ull __n) {
  return sizeof(ull) * __CHAR_BIT__ - 1 - __builtin_clzll(__n);
}
#define debug(...)                                                             \\
  {                                                                            \\
    print(#__VA_ARGS__);                                                       \\
    print(":");                                                                \\
    out(__VA_ARGS__);                                                          \\
  }
#else
#define debug(...) void(0)
#endif
int first(bool i = true) { return out(i ? "first" : "second"); }
int yes(bool i = true) { return out(i ? "yes" : "no"); }
int Yes(bool i = true) { return out(i ? "Yes" : "No"); }
int No() { return out("No"); }
int YES(bool i = true) { return out(i ? "YES" : "NO"); }
int NO() { return out("NO"); }
int Yay(bool i = true) { return out(i ? "Yay!" : ":("); }
int possible(bool i = true) { return out(i ? "possible" : "impossible"); }
int Possible(bool i = true) { return out(i ? "Possible" : "Impossible"); }
int POSSIBLE(bool i = true) { return out(i ? "POSSIBLE" : "IMPOSSIBLE"); }
void Case(ll i) { printf("Case #%lld: ", i); }

random_device RD;
struct Xorshift64 {
  using result_type = uint32_t;
  static constexpr result_type min() { return 0; }
  static constexpr result_type max() { return -1; }
  uint64_t x = RD();
  result_type operator()() {
    x = x ^ (x << 13);
    x = x ^ (x >> 7);
    x = x ^ (x << 17);
    return static_cast<uint32_t>(x);
  }
} rnd;
#ifdef DEBUG
int d;
#else
const int d = 365;
#endif
int cnt = 0;
int c[26];
int s[365][26];
int ans[365];
int score = 0, max_score = 0;
vector<int16_t> contest[26];

inline auto add(int day, int i) {
  const auto p = lower_bound(all(contest[i]), day);
  contest[i].insert(p, day);
  const int pre = *prev(p), nxt = *next(p);
  score += s[day][i];
  const int d = nxt - pre, d1 = nxt - day, d2 = day - pre;
  score += c[i] * (d * (d - 1) - d1 * (d1 - 1) - d2 * (d2 - 1)) / 2;
  return p;
}
inline auto rem(int day, int i) {
  const auto p = lower_bound(all(contest[i]), day);
  const int pre = *prev(p), nxt = *next(p);
  contest[i].erase(p);
  score -= s[day][i];
  const int d = nxt - pre, d1 = nxt - day, d2 = day - pre;
  score -= c[i] * (d * (d - 1) - d1 * (d1 - 1) - d2 * (d2 - 1)) / 2;
  return p;
}
inline void add2(int day, int i, vector<int16_t>::iterator p) {
  contest[i].insert(p, day);
}
inline void rem2(int day, int i, vector<int16_t>::iterator p) {
  contest[i].erase(p);
}
inline auto inc(int day, int i) {
  const auto p = lower_bound(all(contest[i]), day);
  const int pre = *prev(p), nxt = *next(p);
  score += s[day + 1][i] - s[day][i];
  const int d1 = nxt - day, d2 = day - pre;
  score += c[i] * (d1 - 1 - d2);
  (*p)++;
  return p;
}
inline auto dec(int day, int i) {
  const auto p = lower_bound(all(contest[i]), day);
  const int pre = *prev(p), nxt = *next(p);
  score += s[day - 1][i] - s[day][i];
  const int d1 = nxt - day, d2 = day - pre;
  score += c[i] * (d2 - 1 - d1);
  (*p)++;
  return p;
}
signed main() {
  using namespace std::chrono;
  auto start = system_clock::now();
#ifdef DEBUG
  in(d);
#else
  while (getchar() != '\\n')
    ;
#endif
  in(c);
  rep(d) in(s[i]);
  each(i, contest) {
    i.reserve(32);
    i.push_back(-1);
  }
  rep(d) {
    int j = 0, mx = 0;
    rep(j_, 26) if (chmax(mx, s[i][j_] + (i - contest[j_].back()) * c[j_])) j =
        j_;
    ans[i] = j;
    score += s[i][j];
    contest[j].push_back(i);
    rep(j, 26) score -= (i - contest[j].back()) * c[j];
  }
  each(i, contest) i.push_back(d);
  int t = 0, l = (2'000'000 - t) / 40'000;
#ifdef DEBUG
  rep(_, 1000000) {
#else
  while (t < 1'986'000) {
#endif
    rep(20) {
      if (rand() & 1) {
        const int day = rnd() % d, to = rnd() % 26;
        if (ans[day] == to)
          continue;
        const int prev_score = score;
        auto p1 = rem(day, ans[day]);
        auto p2 = add(day, to);
        chmax(max_score, score);
        if (score < max_score - l) {
          add2(day, ans[day], p1);
          rem2(day, to, p2);
          score = prev_score;
        } else
          ans[day] = to;
      } else {
        const int day = rnd() % (d - 1);
        if (ans[day] == ans[day + 1])
          continue;
        const int prev_score = score;
        auto p1 = inc(day, ans[day]);
        auto p2 = dec(day + 1, ans[day + 1]);
        chmax(max_score, score);
        if (score < max_score - l) {
          p1--;
          p2++;
          score = prev_score;
        } else
          swap(ans[day], ans[day + 1]);
      }
    }
    t = duration_cast<microseconds>(system_clock::now() - start).count();
    l = (2'000'000 - t) / 10'000;
  }
  rep(d) out(ans[i] + 1);
#ifdef DEBUG
  out(cnt);
#endif
}