Problem p02618 (C++)

Buggy submission (status: Time Limit Exceeded):
const int isDebugMode = 1;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
  long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e)                                                      \
  (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e)                                                      \
  (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD) {
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
void pt() {
  cout << endl;
  return;
}
template <class Head> void pt(Head &&head) {
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail> void pt(Head &&head, Tail &&...tail) {
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
void dpt() {
  if (!isDebugMode)
    return;
  cout << endl;
  return;
}
template <class Head> void dpt(Head &&head) {
  if (!isDebugMode)
    return;
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail> void dpt(Head &&head, Tail &&...tail) {
  if (!isDebugMode)
    return;
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
template <class T> void debug(T v) {
  if (!isDebugMode)
    return;
  rep(i, v.size()) cout << v[i] << " ";
  cout << endl;
}
template <class T> void debug2(T v) {
  if (!isDebugMode)
    return;
  rep(i, v.size()) {
    rep(j, v[i].size()) cout << v[i][j] << " ";
    cout << endl;
  }
}
template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> long long gcd(T1 a, T2 b) {
  return a % b ? gcd(b, a % b) : b;
}
template <class T1, class T2> void reduce(T1 &a, T2 &b) {
  ll g = gcd(a, b);
  a /= g;
  b /= g;
  return;
}
bool valid(long long H, long long W, long long h, long long w) {
  return 0 <= h && h < H && 0 <= w && w < W;
}

int D;
vector<int> c(26);
int ss[365][26];
vector<int> ans(0);

double powyabai = 1.2;
double cyabaipow = 1.2;

double evaluate(int day, int kind) {

  double yabasa = 0;
  int s = ans.size();
  int idx;
  for (idx = s - 1; 0 <= idx; idx--) {
    if (ans[idx] == kind)
      break;
  }
  yabasa = pow(day - idx, powyabai) * pow(c[kind], cyabaipow);
  double uresisa = ss[day][kind];
  return yabasa + uresisa;
}

ll cal(vector<int> &ans) {
  ll now = 0;
  rep(i, D) {
    now += ss[i][ans[i]];
    rep(j, 26) {
      int s = i + 1;
      int idx;
      for (idx = s - 1; 0 <= idx; idx--) {
        if (ans[idx] == j)
          break;
      }
      if (idx >= 0)
        now -= (i - idx) * c[j];
    }
  }
  return now;
}

int main() {
  cin >> D;
  rep(i, 26) cin >> c[i];
  rep(i, D) rep(j, 26) cin >> ss[i][j];
  rep(i, D) {
    double max_eva = -inf;
    double choice = 0;
    rep(j, 26) {
      if (chmax(max_eva, evaluate(i, j)))
        choice = j;
    }
    ans.push_back(choice);
  }
  random_device rnd;
  mt19937 mt(rnd());

  rep(i, 3500) {
    ll lc = mt() % 365;
    ll prev = ans[lc];
    ll p = cal(ans);
    ans[lc] = mt() % 26;
    ll q = cal(ans);
    if (q <= p)
      ans[lc] = prev;
  }

  rep(i, D) pt(ans[i] + 1);
  return 0;
}

Fixed submission:
const int isDebugMode = 1;
#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<long long, long long> P;
struct edge {
  long long to, cost;
};
const int inf = 1 << 27;
const long long INF = 1LL << 60;
const int COMBMAX = 1001001;
const long long MOD = 1000000007;
const long long dy[] = {-1, 0, 0, 1};
const long long dx[] = {0, -1, 1, 0};
string abc = "abcdefghijklmnopqrstuvwxyz";
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define eachdo(v, e) for (const auto &e : (v))
#define all(v) (v).begin(), (v).end()
#define lower_index(v, e)                                                      \
  (long long)distance((v).begin(), lower_bound((v).begin(), (v).end(), e))
#define upper_index(v, e)                                                      \
  (long long)distance((v).begin(), upper_bound((v).begin(), (v).end(), e))
long long mpow(long long a, long long n, long long mod = MOD) {
  long long res = 1;
  while (n > 0) {
    if (n & 1)
      res = res * a % mod;
    a = a * a % mod;
    n >>= 1;
  }
  return res;
}
void pt() {
  cout << endl;
  return;
}
template <class Head> void pt(Head &&head) {
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail> void pt(Head &&head, Tail &&...tail) {
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
void dpt() {
  if (!isDebugMode)
    return;
  cout << endl;
  return;
}
template <class Head> void dpt(Head &&head) {
  if (!isDebugMode)
    return;
  cout << head;
  pt();
  return;
}
template <class Head, class... Tail> void dpt(Head &&head, Tail &&...tail) {
  if (!isDebugMode)
    return;
  cout << head << " ";
  pt(forward<Tail>(tail)...);
}
template <class T> void debug(T v) {
  if (!isDebugMode)
    return;
  rep(i, v.size()) cout << v[i] << " ";
  cout << endl;
}
template <class T> void debug2(T v) {
  if (!isDebugMode)
    return;
  rep(i, v.size()) {
    rep(j, v[i].size()) cout << v[i][j] << " ";
    cout << endl;
  }
}
template <class T1, class T2> inline bool chmin(T1 &a, T2 b) {
  if (a > b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> inline bool chmax(T1 &a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
template <class T1, class T2> long long gcd(T1 a, T2 b) {
  return a % b ? gcd(b, a % b) : b;
}
template <class T1, class T2> void reduce(T1 &a, T2 &b) {
  ll g = gcd(a, b);
  a /= g;
  b /= g;
  return;
}
bool valid(long long H, long long W, long long h, long long w) {
  return 0 <= h && h < H && 0 <= w && w < W;
}

int D;
vector<int> c(26);
int ss[365][26];
vector<int> ans(0);

double powyabai = 1.2;
double cyabaipow = 1.2;

double evaluate(int day, int kind) {

  double yabasa = 0;
  int s = ans.size();
  int idx;
  for (idx = s - 1; 0 <= idx; idx--) {
    if (ans[idx] == kind)
      break;
  }
  yabasa = pow(day - idx, powyabai) * pow(c[kind], cyabaipow);
  double uresisa = ss[day][kind];
  return yabasa + uresisa;
}

ll cal(vector<int> &ans) {
  ll now = 0;
  rep(i, D) {
    now += ss[i][ans[i]];
    rep(j, 26) {
      int s = i + 1;
      int idx;
      for (idx = s - 1; 0 <= idx; idx--) {
        if (ans[idx] == j)
          break;
      }
      if (idx >= 0)
        now -= (i - idx) * c[j];
    }
  }
  return now;
}

int main() {
  cin >> D;
  rep(i, 26) cin >> c[i];
  rep(i, D) rep(j, 26) cin >> ss[i][j];
  rep(i, D) {
    double max_eva = -inf;
    double choice = 0;
    rep(j, 26) {
      if (chmax(max_eva, evaluate(i, j)))
        choice = j;
    }
    ans.push_back(choice);
  }
  random_device rnd;
  mt19937 mt(rnd());

  rep(i, 2000) {
    ll lc = mt() % 365;
    ll prev = ans[lc];
    ll p = cal(ans);
    ans[lc] = mt() % 26;
    ll q = cal(ans);
    if (q <= p)
      ans[lc] = prev;
  }

  rep(i, D) pt(ans[i] + 1);
  return 0;
}